./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-45.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 a87b1445829ed3e5d4b1e8d4b5847d1f5634c4a1659432e4da11a1afd44c4303 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:46:15,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:46:15,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:46:15,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:46:15,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:46:15,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:46:15,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:46:15,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:46:15,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:46:15,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:46:15,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:46:15,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:46:15,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:46:15,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:46:15,670 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:46:15,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:46:15,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:46:15,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:46:15,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:46:15,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:46:15,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:46:15,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:46:15,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:46:15,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:46:15,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:46:15,675 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:46:15,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:46:15,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:46:15,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:46:15,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:46:15,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:46:15,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:46:15,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:46:15,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:46:15,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:46:15,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:46:15,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:46:15,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:46:15,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:46:15,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:46:15,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:46:15,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:46:15,684 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 -> a87b1445829ed3e5d4b1e8d4b5847d1f5634c4a1659432e4da11a1afd44c4303 [2024-10-13 00:46:15,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:46:15,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:46:15,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:46:15,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:46:15,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:46:15,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-45.i [2024-10-13 00:46:17,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:46:17,581 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:46:17,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-45.i [2024-10-13 00:46:17,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0821e14/55d7b207cb36430b9baa238a6b8d1495/FLAG870ef680b [2024-10-13 00:46:17,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0821e14/55d7b207cb36430b9baa238a6b8d1495 [2024-10-13 00:46:17,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:46:17,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:46:17,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:46:17,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:46:17,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:46:17,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:17,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1cefb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17, skipping insertion in model container [2024-10-13 00:46:17,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:17,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:46:17,793 WARN L248 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_fillercode_fillercodesize_ps-cn-10_file-45.i[915,928] [2024-10-13 00:46:17,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:46:17,858 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:46:17,874 WARN L248 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_fillercode_fillercodesize_ps-cn-10_file-45.i[915,928] [2024-10-13 00:46:17,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:46:17,935 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:46:17,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17 WrapperNode [2024-10-13 00:46:17,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:46:17,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:46:17,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:46:17,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:46:17,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:17,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:17,989 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-13 00:46:17,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:46:17,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:46:17,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:46:17,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:46:18,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,026 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-10-13 00:46:18,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:46:18,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:46:18,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:46:18,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:46:18,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (1/1) ... [2024-10-13 00:46:18,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:46:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:46:18,107 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-10-13 00:46:18,110 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-10-13 00:46:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:46:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:46:18,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:46:18,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:46:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:46:18,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:46:18,273 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:46:18,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:46:18,645 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:46:18,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:46:18,700 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:46:18,701 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:46:18,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:18 BoogieIcfgContainer [2024-10-13 00:46:18,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:46:18,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:46:18,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:46:18,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:46:18,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:46:17" (1/3) ... [2024-10-13 00:46:18,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5be56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:18, skipping insertion in model container [2024-10-13 00:46:18,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:17" (2/3) ... [2024-10-13 00:46:18,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5be56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:18, skipping insertion in model container [2024-10-13 00:46:18,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:18" (3/3) ... [2024-10-13 00:46:18,712 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-45.i [2024-10-13 00:46:18,734 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:46:18,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:46:18,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:46:18,803 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;@eb68145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:46:18,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:46:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 00:46:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 00:46:18,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:18,825 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:46:18,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:18,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1253278939, now seen corresponding path program 1 times [2024-10-13 00:46:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521061256] [2024-10-13 00:46:18,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:46:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:46:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:46:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:46:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:46:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:46:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:46:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:46:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:46:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:46:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:46:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:46:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 00:46:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521061256] [2024-10-13 00:46:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521061256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:46:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:46:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:46:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604347379] [2024-10-13 00:46:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:46:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:46:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:19,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:46:19,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:46:19,528 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 00:46:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:19,626 INFO L93 Difference]: Finished difference Result 186 states and 346 transitions. [2024-10-13 00:46:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:46:19,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 153 [2024-10-13 00:46:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:19,641 INFO L225 Difference]: With dead ends: 186 [2024-10-13 00:46:19,641 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 00:46:19,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:46:19,652 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 86 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:19,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 173 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:46:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 00:46:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-13 00:46:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 67 states have internal predecessors, (83), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 00:46:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 183 transitions. [2024-10-13 00:46:19,734 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 183 transitions. Word has length 153 [2024-10-13 00:46:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:19,738 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 183 transitions. [2024-10-13 00:46:19,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 00:46:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 183 transitions. [2024-10-13 00:46:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 00:46:19,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:19,743 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:46:19,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:46:19,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:19,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash 181465565, now seen corresponding path program 1 times [2024-10-13 00:46:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:19,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624562270] [2024-10-13 00:46:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:46:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:46:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:46:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:46:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:46:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:46:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:46:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:46:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:46:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:46:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:46:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:46:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 00:46:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:34,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624562270] [2024-10-13 00:46:34,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624562270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:46:34,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:46:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:46:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137037852] [2024-10-13 00:46:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:46:34,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:46:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:34,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:46:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:46:34,364 INFO L87 Difference]: Start difference. First operand 120 states and 183 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 00:46:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:35,061 INFO L93 Difference]: Finished difference Result 352 states and 522 transitions. [2024-10-13 00:46:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:46:35,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 154 [2024-10-13 00:46:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:35,067 INFO L225 Difference]: With dead ends: 352 [2024-10-13 00:46:35,067 INFO L226 Difference]: Without dead ends: 233 [2024-10-13 00:46:35,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:46:35,072 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 76 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:35,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 00:46:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-13 00:46:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 186. [2024-10-13 00:46:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 117 states have internal predecessors, (146), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:46:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2024-10-13 00:46:35,125 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 154 [2024-10-13 00:46:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:35,126 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2024-10-13 00:46:35,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 00:46:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2024-10-13 00:46:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 00:46:35,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:35,129 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:46:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:46:35,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:35,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1956472927, now seen corresponding path program 1 times [2024-10-13 00:46:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77601539] [2024-10-13 00:46:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:46:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:46:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:46:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:46:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:46:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:46:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:46:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:46:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:46:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:46:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:46:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:46:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 00:46:36,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77601539] [2024-10-13 00:46:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77601539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:46:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:46:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:46:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147474029] [2024-10-13 00:46:36,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:46:36,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:46:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:46:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:46:36,826 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 00:46:37,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:37,256 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2024-10-13 00:46:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:46:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 154 [2024-10-13 00:46:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:37,260 INFO L225 Difference]: With dead ends: 418 [2024-10-13 00:46:37,260 INFO L226 Difference]: Without dead ends: 233 [2024-10-13 00:46:37,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:46:37,262 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 73 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:37,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 378 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:46:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-13 00:46:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 181. [2024-10-13 00:46:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 112 states have internal predecessors, (139), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:46:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2024-10-13 00:46:37,327 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 154 [2024-10-13 00:46:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:37,328 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2024-10-13 00:46:37,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 00:46:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2024-10-13 00:46:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 00:46:37,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:37,331 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:46:37,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:46:37,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:37,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -560820525, now seen corresponding path program 1 times [2024-10-13 00:46:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:37,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38673157] [2024-10-13 00:46:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat