./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f04db10568a800b95189a827d616dfd35581f855ab463aa07cbc605d28fef196 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:39:11,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:39:11,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:39:11,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:39:11,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:39:11,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:39:11,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:39:11,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:39:11,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:39:11,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:39:11,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:39:11,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:39:11,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:39:11,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:39:11,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:39:11,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:39:11,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:39:11,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:39:11,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:39:11,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:39:11,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:39:11,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:39:11,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:39:11,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:39:11,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:39:11,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:39:11,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:39:11,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:39:11,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:39:11,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:39:11,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:39:11,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:39:11,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:39:11,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:39:11,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:39:11,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:39:11,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:39:11,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:39:11,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:39:11,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:39:11,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:39:11,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:39:11,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f04db10568a800b95189a827d616dfd35581f855ab463aa07cbc605d28fef196 [2024-11-16 16:39:12,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:39:12,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:39:12,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:39:12,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:39:12,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:39:12,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2024-11-16 16:39:13,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:39:13,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:39:13,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2024-11-16 16:39:13,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2abe9c55e/920daafe1d984b65beb6b2ac10b0159d/FLAG614f79763 [2024-11-16 16:39:13,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2abe9c55e/920daafe1d984b65beb6b2ac10b0159d [2024-11-16 16:39:13,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:39:13,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:39:13,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:39:13,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:39:13,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:39:13,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d674d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13, skipping insertion in model container [2024-11-16 16:39:13,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:39:13,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i[915,928] [2024-11-16 16:39:13,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:39:13,803 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:39:13,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i[915,928] [2024-11-16 16:39:13,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:39:13,852 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:39:13,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13 WrapperNode [2024-11-16 16:39:13,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:39:13,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:39:13,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:39:13,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:39:13,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,913 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-16 16:39:13,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:39:13,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:39:13,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:39:13,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:39:13,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,945 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:39:13,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:39:13,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:39:13,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:39:13,965 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:39:13,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (1/1) ... [2024-11-16 16:39:13,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:39:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:39:13,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:39:13,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:39:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:39:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:39:14,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:39:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:39:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:39:14,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:39:14,102 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:39:14,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:39:14,371 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2024-11-16 16:39:14,399 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-16 16:39:14,399 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:39:14,420 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:39:14,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:39:14,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:39:14 BoogieIcfgContainer [2024-11-16 16:39:14,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:39:14,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:39:14,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:39:14,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:39:14,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:39:13" (1/3) ... [2024-11-16 16:39:14,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47425bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:39:14, skipping insertion in model container [2024-11-16 16:39:14,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:13" (2/3) ... [2024-11-16 16:39:14,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47425bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:39:14, skipping insertion in model container [2024-11-16 16:39:14,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:39:14" (3/3) ... [2024-11-16 16:39:14,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-10.i [2024-11-16 16:39:14,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:39:14,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:39:14,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:39:14,491 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19cc9522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:39:14,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:39:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:39:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 16:39:14,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:14,504 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:14,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:14,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 661365092, now seen corresponding path program 1 times [2024-11-16 16:39:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585073787] [2024-11-16 16:39:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:39:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:39:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:39:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:39:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:39:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:39:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:39:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:39:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:39:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:39:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:39:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:39:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:39:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:39:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:39:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 16:39:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 16:39:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:39:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:14,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585073787] [2024-11-16 16:39:14,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585073787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:14,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:14,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:39:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939342385] [2024-11-16 16:39:14,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:39:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:39:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:39:14,877 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:39:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:14,903 INFO L93 Difference]: Finished difference Result 150 states and 240 transitions. [2024-11-16 16:39:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:39:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-16 16:39:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:14,911 INFO L225 Difference]: With dead ends: 150 [2024-11-16 16:39:14,911 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 16:39:14,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:39:14,918 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:14,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:39:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 16:39:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-16 16:39:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:39:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2024-11-16 16:39:14,957 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 124 [2024-11-16 16:39:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:14,957 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2024-11-16 16:39:14,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:39:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2024-11-16 16:39:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 16:39:14,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:14,960 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:39:14,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1998007804, now seen corresponding path program 1 times [2024-11-16 16:39:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000814789] [2024-11-16 16:39:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:39:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:39:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:39:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:39:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:39:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:39:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:39:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:39:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:39:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:39:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:39:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:39:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:39:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:39:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:39:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 16:39:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 16:39:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:39:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:15,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000814789] [2024-11-16 16:39:15,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000814789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:15,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:39:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133887121] [2024-11-16 16:39:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:39:15,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:15,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:39:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:39:15,439 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:39:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:15,582 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-11-16 16:39:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:39:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-16 16:39:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:15,585 INFO L225 Difference]: With dead ends: 212 [2024-11-16 16:39:15,586 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 16:39:15,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:39:15,588 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 74 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:15,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 280 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:39:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 16:39:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2024-11-16 16:39:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 16:39:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2024-11-16 16:39:15,609 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 124 [2024-11-16 16:39:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:15,609 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2024-11-16 16:39:15,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:39:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2024-11-16 16:39:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 16:39:15,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:15,612 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:15,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:39:15,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:15,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash -307283695, now seen corresponding path program 1 times [2024-11-16 16:39:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:15,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510519382] [2024-11-16 16:39:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:39:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:39:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:39:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:39:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:39:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:39:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:39:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:39:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:39:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:39:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:39:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:39:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:39:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:39:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:39:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 16:39:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 16:39:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:39:30,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510519382] [2024-11-16 16:39:30,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510519382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:30,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:30,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 16:39:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369126153] [2024-11-16 16:39:30,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:30,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 16:39:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:30,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 16:39:30,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:39:30,083 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:39:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:31,666 INFO L93 Difference]: Finished difference Result 401 states and 567 transitions. [2024-11-16 16:39:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 16:39:31,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-16 16:39:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:31,670 INFO L225 Difference]: With dead ends: 401 [2024-11-16 16:39:31,673 INFO L226 Difference]: Without dead ends: 332 [2024-11-16 16:39:31,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2024-11-16 16:39:31,675 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 655 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:31,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 669 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 16:39:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-16 16:39:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 195. [2024-11-16 16:39:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 136 states have (on average 1.286764705882353) internal successors, (175), 137 states have internal predecessors, (175), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 16:39:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2024-11-16 16:39:31,713 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 125 [2024-11-16 16:39:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:31,715 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2024-11-16 16:39:31,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:39:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2024-11-16 16:39:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 16:39:31,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:31,717 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:39:31,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:31,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1797705232, now seen corresponding path program 1 times [2024-11-16 16:39:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552373325] [2024-11-16 16:39:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:39:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:39:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:39:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:39:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:39:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:39:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:39:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:39:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:39:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:39:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:39:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:39:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:39:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:39:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:39:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 16:39:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 16:39:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:39:44,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:44,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552373325] [2024-11-16 16:39:44,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552373325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:44,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:44,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 16:39:44,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120499118] [2024-11-16 16:39:44,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:44,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 16:39:44,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:44,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 16:39:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:39:44,570 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:39:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:45,675 INFO L93 Difference]: Finished difference Result 518 states and 720 transitions. [2024-11-16 16:39:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 16:39:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-16 16:39:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:45,677 INFO L225 Difference]: With dead ends: 518 [2024-11-16 16:39:45,677 INFO L226 Difference]: Without dead ends: 449 [2024-11-16 16:39:45,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2024-11-16 16:39:45,679 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 648 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:45,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 606 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:39:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-16 16:39:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 219. [2024-11-16 16:39:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 159 states have internal predecessors, (208), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 16:39:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-16 16:39:45,709 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 125 [2024-11-16 16:39:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:45,711 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-16 16:39:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:39:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-16 16:39:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 16:39:45,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:45,713 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:39:45,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1601191727, now seen corresponding path program 1 times [2024-11-16 16:39:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356095047] [2024-11-16 16:39:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:40:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:40:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:40:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:40:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:40:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:40:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:40:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:40:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:40:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:40:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:40:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:40:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:40:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:40:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:40:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:40:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 16:40:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 16:40:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:40:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:40:36,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:40:36,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356095047] [2024-11-16 16:40:36,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356095047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:40:36,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:40:36,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 16:40:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391198892] [2024-11-16 16:40:36,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:40:36,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 16:40:36,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:40:36,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 16:40:36,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:40:36,987 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:40:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:40:38,262 INFO L93 Difference]: Finished difference Result 407 states and 573 transitions. [2024-11-16 16:40:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 16:40:38,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-16 16:40:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:40:38,266 INFO L225 Difference]: With dead ends: 407 [2024-11-16 16:40:38,266 INFO L226 Difference]: Without dead ends: 338 [2024-11-16 16:40:38,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-16 16:40:38,267 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 623 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:40:38,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 587 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:40:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-16 16:40:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 226. [2024-11-16 16:40:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 165 states have (on average 1.309090909090909) internal successors, (216), 165 states have internal predecessors, (216), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 16:40:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2024-11-16 16:40:38,284 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 125 [2024-11-16 16:40:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:40:38,284 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2024-11-16 16:40:38,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:40:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2024-11-16 16:40:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 16:40:38,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:40:38,286 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:40:38,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:40:38,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:40:38,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:40:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1307788720, now seen corresponding path program 1 times [2024-11-16 16:40:38,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:40:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100635532] [2024-11-16 16:40:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:40:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:40:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat