./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_fillercode_fillercodesize_normal_file-34.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 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:36:07,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:36:07,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:36:07,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:36:07,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:36:07,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:36:07,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:36:07,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:36:07,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:36:07,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:36:07,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:36:07,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:36:07,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:36:07,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:36:07,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:36:07,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:36:07,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:36:07,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:36:07,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:36:07,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:36:07,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:36:07,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:36:07,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:36:07,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:36:07,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:36:07,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:36:07,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:36:07,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:36:07,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:36:07,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:36:07,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:36:07,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:36:07,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:36:07,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:36:07,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:36:07,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:36:07,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:36:07,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:36:07,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:36:07,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:36:07,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:36:07,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:36:07,777 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 -> 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 [2024-11-12 01:36:08,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:36:08,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:36:08,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:36:08,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:36:08,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:36:08,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2024-11-12 01:36:09,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:36:09,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:36:09,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2024-11-12 01:36:09,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5103c2bc5/938420030a224a84b4995ecb8ec7b6dc/FLAG0e7c52b08 [2024-11-12 01:36:10,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5103c2bc5/938420030a224a84b4995ecb8ec7b6dc [2024-11-12 01:36:10,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:36:10,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:36:10,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:36:10,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:36:10,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:36:10,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7140ea0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10, skipping insertion in model container [2024-11-12 01:36:10,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:36:10,369 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2024-11-12 01:36:10,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:36:10,472 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:36:10,486 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2024-11-12 01:36:10,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:36:10,551 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:36:10,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10 WrapperNode [2024-11-12 01:36:10,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:36:10,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:36:10,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:36:10,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:36:10,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,620 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-12 01:36:10,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:36:10,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:36:10,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:36:10,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:36:10,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,674 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-12 01:36:10,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:36:10,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:36:10,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:36:10,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:36:10,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (1/1) ... [2024-11-12 01:36:10,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:36:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:36:10,766 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-12 01:36:10,770 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-12 01:36:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:36:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:36:10,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:36:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:36:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:36:10,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:36:10,922 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:36:10,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:36:11,338 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-12 01:36:11,339 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:36:11,359 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:36:11,359 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:36:11,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:36:11 BoogieIcfgContainer [2024-11-12 01:36:11,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:36:11,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:36:11,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:36:11,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:36:11,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:36:10" (1/3) ... [2024-11-12 01:36:11,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed48a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:36:11, skipping insertion in model container [2024-11-12 01:36:11,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:36:10" (2/3) ... [2024-11-12 01:36:11,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed48a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:36:11, skipping insertion in model container [2024-11-12 01:36:11,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:36:11" (3/3) ... [2024-11-12 01:36:11,373 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-34.i [2024-11-12 01:36:11,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:36:11,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:36:11,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:36:11,459 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;@4182c407, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:36:11,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:36:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:36:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 01:36:11,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:11,475 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:11,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:11,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:11,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1167158208, now seen corresponding path program 1 times [2024-11-12 01:36:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:11,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578709550] [2024-11-12 01:36:11,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578709550] [2024-11-12 01:36:11,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578709550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:11,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:11,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:36:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889443532] [2024-11-12 01:36:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:11,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:36:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:36:11,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:36:11,980 INFO L87 Difference]: Start difference. First operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:36:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:12,012 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2024-11-12 01:36:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:36:12,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2024-11-12 01:36:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:12,024 INFO L225 Difference]: With dead ends: 135 [2024-11-12 01:36:12,024 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 01:36:12,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-12 01:36:12,035 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:12,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:36:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 01:36:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 01:36:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:36:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-12 01:36:12,086 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2024-11-12 01:36:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:12,087 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-12 01:36:12,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:36:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-12 01:36:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 01:36:12,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:12,094 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:12,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:36:12,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:12,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1294889278, now seen corresponding path program 1 times [2024-11-12 01:36:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835357900] [2024-11-12 01:36:12,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835357900] [2024-11-12 01:36:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835357900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:36:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196522287] [2024-11-12 01:36:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:12,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:36:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:36:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:36:12,660 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:12,835 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2024-11-12 01:36:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:36:12,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-12 01:36:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:12,840 INFO L225 Difference]: With dead ends: 225 [2024-11-12 01:36:12,840 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 01:36:12,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-12 01:36:12,843 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:12,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 321 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:36:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 01:36:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2024-11-12 01:36:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:36:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2024-11-12 01:36:12,887 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 94 [2024-11-12 01:36:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:12,888 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2024-11-12 01:36:12,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2024-11-12 01:36:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 01:36:12,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:12,890 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:12,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:36:12,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:12,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1947848368, now seen corresponding path program 1 times [2024-11-12 01:36:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:12,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059678994] [2024-11-12 01:36:12,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059678994] [2024-11-12 01:36:13,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059678994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:13,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:13,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:36:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437172669] [2024-11-12 01:36:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:13,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:36:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:13,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:36:13,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:36:13,275 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:13,512 INFO L93 Difference]: Finished difference Result 382 states and 580 transitions. [2024-11-12 01:36:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:36:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-11-12 01:36:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:13,515 INFO L225 Difference]: With dead ends: 382 [2024-11-12 01:36:13,515 INFO L226 Difference]: Without dead ends: 254 [2024-11-12 01:36:13,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:36:13,521 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:13,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:36:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-12 01:36:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 135. [2024-11-12 01:36:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:36:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2024-11-12 01:36:13,543 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 95 [2024-11-12 01:36:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:13,543 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2024-11-12 01:36:13,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2024-11-12 01:36:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 01:36:13,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:13,551 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:13,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:36:13,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 343445546, now seen corresponding path program 1 times [2024-11-12 01:36:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:13,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112792000] [2024-11-12 01:36:13,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:13,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112792000] [2024-11-12 01:36:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112792000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 01:36:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820531183] [2024-11-12 01:36:38,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:38,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:36:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:38,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:36:38,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:36:38,355 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:41,976 INFO L93 Difference]: Finished difference Result 535 states and 786 transitions. [2024-11-12 01:36:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 01:36:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-12 01:36:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:41,980 INFO L225 Difference]: With dead ends: 535 [2024-11-12 01:36:41,980 INFO L226 Difference]: Without dead ends: 403 [2024-11-12 01:36:41,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-12 01:36:41,983 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 378 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:41,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 586 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 01:36:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-12 01:36:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 249. [2024-11-12 01:36:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 206 states have (on average 1.4223300970873787) internal successors, (293), 206 states have internal predecessors, (293), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:36:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 371 transitions. [2024-11-12 01:36:42,032 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 371 transitions. Word has length 96 [2024-11-12 01:36:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:42,032 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 371 transitions. [2024-11-12 01:36:42,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 371 transitions. [2024-11-12 01:36:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 01:36:42,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:42,034 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:42,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:36:42,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:42,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2118452908, now seen corresponding path program 1 times [2024-11-12 01:36:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619308898] [2024-11-12 01:36:42,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619308898] [2024-11-12 01:36:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619308898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 01:36:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250558450] [2024-11-12 01:36:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 01:36:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 01:36:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 01:36:44,178 INFO L87 Difference]: Start difference. First operand 249 states and 371 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:45,231 INFO L93 Difference]: Finished difference Result 608 states and 909 transitions. [2024-11-12 01:36:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 01:36:45,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-12 01:36:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:45,235 INFO L225 Difference]: With dead ends: 608 [2024-11-12 01:36:45,236 INFO L226 Difference]: Without dead ends: 460 [2024-11-12 01:36:45,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:36:45,238 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 362 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:45,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 376 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 01:36:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-12 01:36:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 294. [2024-11-12 01:36:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 251 states have (on average 1.4183266932270917) internal successors, (356), 251 states have internal predecessors, (356), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:36:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-12 01:36:45,263 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 96 [2024-11-12 01:36:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:45,263 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-12 01:36:45,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-12 01:36:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 01:36:45,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:45,265 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:45,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:36:45,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1023503916, now seen corresponding path program 1 times [2024-11-12 01:36:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273189273] [2024-11-12 01:36:45,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273189273] [2024-11-12 01:36:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273189273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:49,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 01:36:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338297598] [2024-11-12 01:36:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:49,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 01:36:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 01:36:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:36:49,593 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:50,922 INFO L93 Difference]: Finished difference Result 602 states and 884 transitions. [2024-11-12 01:36:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 01:36:50,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-12 01:36:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:50,926 INFO L225 Difference]: With dead ends: 602 [2024-11-12 01:36:50,927 INFO L226 Difference]: Without dead ends: 456 [2024-11-12 01:36:50,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-12 01:36:50,929 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 366 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:50,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 448 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 01:36:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-12 01:36:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 354. [2024-11-12 01:36:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 311 states have (on average 1.459807073954984) internal successors, (454), 311 states have internal predecessors, (454), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:36:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 532 transitions. [2024-11-12 01:36:50,970 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 532 transitions. Word has length 96 [2024-11-12 01:36:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:50,971 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 532 transitions. [2024-11-12 01:36:50,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 532 transitions. [2024-11-12 01:36:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 01:36:50,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:50,972 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:50,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 01:36:50,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:50,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -926687525, now seen corresponding path program 1 times [2024-11-12 01:36:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580337265] [2024-11-12 01:36:50,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580337265] [2024-11-12 01:36:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580337265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 01:36:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224329244] [2024-11-12 01:36:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:52,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:36:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:52,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:36:52,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:36:52,460 INFO L87 Difference]: Start difference. First operand 354 states and 532 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:52,861 INFO L93 Difference]: Finished difference Result 656 states and 980 transitions. [2024-11-12 01:36:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 01:36:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-12 01:36:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:52,864 INFO L225 Difference]: With dead ends: 656 [2024-11-12 01:36:52,864 INFO L226 Difference]: Without dead ends: 472 [2024-11-12 01:36:52,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 01:36:52,866 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 156 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:52,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 345 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:36:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-12 01:36:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 360. [2024-11-12 01:36:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 317 states have (on average 1.444794952681388) internal successors, (458), 317 states have internal predecessors, (458), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:36:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 536 transitions. [2024-11-12 01:36:52,902 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 536 transitions. Word has length 96 [2024-11-12 01:36:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:52,903 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 536 transitions. [2024-11-12 01:36:52,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2024-11-12 01:36:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 01:36:52,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:52,905 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:52,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 01:36:52,905 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:52,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:52,906 INFO L85 PathProgramCache]: Analyzing trace with hash -667671704, now seen corresponding path program 1 times [2024-11-12 01:36:52,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:52,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942141499] [2024-11-12 01:36:52,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:53,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942141499] [2024-11-12 01:36:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942141499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:53,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:53,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:36:53,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112774984] [2024-11-12 01:36:53,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:53,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:36:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:53,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:36:53,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:36:53,185 INFO L87 Difference]: Start difference. First operand 360 states and 536 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:53,385 INFO L93 Difference]: Finished difference Result 576 states and 859 transitions. [2024-11-12 01:36:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:36:53,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-12 01:36:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:53,388 INFO L225 Difference]: With dead ends: 576 [2024-11-12 01:36:53,388 INFO L226 Difference]: Without dead ends: 350 [2024-11-12 01:36:53,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-12 01:36:53,392 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:53,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 230 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:36:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-12 01:36:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 322. [2024-11-12 01:36:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 279 states have internal predecessors, (392), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:36:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2024-11-12 01:36:53,427 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 96 [2024-11-12 01:36:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:53,428 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2024-11-12 01:36:53,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2024-11-12 01:36:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 01:36:53,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:53,430 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:53,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 01:36:53,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:53,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1326331525, now seen corresponding path program 1 times [2024-11-12 01:36:53,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:53,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113566435] [2024-11-12 01:36:53,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113566435] [2024-11-12 01:36:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113566435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 01:36:55,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283592172] [2024-11-12 01:36:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:55,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 01:36:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 01:36:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 01:36:55,659 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:36:56,774 INFO L93 Difference]: Finished difference Result 647 states and 936 transitions. [2024-11-12 01:36:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 01:36:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-12 01:36:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:36:56,778 INFO L225 Difference]: With dead ends: 647 [2024-11-12 01:36:56,778 INFO L226 Difference]: Without dead ends: 515 [2024-11-12 01:36:56,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:36:56,780 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 260 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 01:36:56,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 480 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 01:36:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-12 01:36:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 358. [2024-11-12 01:36:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 313 states have (on average 1.3738019169329074) internal successors, (430), 313 states have internal predecessors, (430), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:36:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 508 transitions. [2024-11-12 01:36:56,822 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 508 transitions. Word has length 97 [2024-11-12 01:36:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:36:56,823 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 508 transitions. [2024-11-12 01:36:56,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:36:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 508 transitions. [2024-11-12 01:36:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 01:36:56,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:36:56,824 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:36:56,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 01:36:56,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:36:56,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:36:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 491239673, now seen corresponding path program 1 times [2024-11-12 01:36:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:36:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491593343] [2024-11-12 01:36:56,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:36:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:36:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:36:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:36:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:36:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:36:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:36:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:36:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:36:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:36:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:36:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:36:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:36:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:36:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:36:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:36:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:36:59,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:36:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491593343] [2024-11-12 01:36:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491593343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:36:59,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:36:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 01:36:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898464458] [2024-11-12 01:36:59,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:36:59,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 01:36:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:36:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 01:36:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:36:59,329 INFO L87 Difference]: Start difference. First operand 358 states and 508 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:37:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:37:01,858 INFO L93 Difference]: Finished difference Result 841 states and 1200 transitions. [2024-11-12 01:37:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 01:37:01,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-12 01:37:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:37:01,862 INFO L225 Difference]: With dead ends: 841 [2024-11-12 01:37:01,863 INFO L226 Difference]: Without dead ends: 625 [2024-11-12 01:37:01,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-11-12 01:37:01,864 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 371 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 01:37:01,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 428 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 01:37:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-12 01:37:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 441. [2024-11-12 01:37:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3914141414141414) internal successors, (551), 396 states have internal predecessors, (551), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:37:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 629 transitions. [2024-11-12 01:37:01,897 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 629 transitions. Word has length 97 [2024-11-12 01:37:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:37:01,897 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 629 transitions. [2024-11-12 01:37:01,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:37:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 629 transitions. [2024-11-12 01:37:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 01:37:01,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:37:01,899 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:37:01,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 01:37:01,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:37:01,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:37:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1171298043, now seen corresponding path program 1 times [2024-11-12 01:37:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:37:01,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139791089] [2024-11-12 01:37:01,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:37:01,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:37:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:37:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:37:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:37:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:37:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:37:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:37:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:37:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:37:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:37:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:37:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:37:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:37:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:37:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:37:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:37:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139791089] [2024-11-12 01:37:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139791089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:37:07,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:37:07,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 01:37:07,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342444048] [2024-11-12 01:37:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:37:07,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:37:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:37:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:37:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:37:07,741 INFO L87 Difference]: Start difference. First operand 441 states and 629 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:37:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:37:09,788 INFO L93 Difference]: Finished difference Result 832 states and 1170 transitions. [2024-11-12 01:37:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 01:37:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-12 01:37:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:37:09,793 INFO L225 Difference]: With dead ends: 832 [2024-11-12 01:37:09,793 INFO L226 Difference]: Without dead ends: 543 [2024-11-12 01:37:09,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-11-12 01:37:09,795 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 272 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:37:09,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 757 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 01:37:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-12 01:37:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 441. [2024-11-12 01:37:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3888888888888888) internal successors, (550), 396 states have internal predecessors, (550), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:37:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2024-11-12 01:37:09,828 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 97 [2024-11-12 01:37:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:37:09,829 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2024-11-12 01:37:09,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:37:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2024-11-12 01:37:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 01:37:09,830 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:37:09,830 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:37:09,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 01:37:09,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:37:09,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:37:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1743707403, now seen corresponding path program 1 times [2024-11-12 01:37:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:37:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698371050] [2024-11-12 01:37:09,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:37:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:37:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:37:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:37:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:37:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:37:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:37:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:37:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:37:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:37:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:37:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:37:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:37:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:37:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:37:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:37:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:37:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:37:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698371050] [2024-11-12 01:37:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698371050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:37:17,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:37:17,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 01:37:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758400244] [2024-11-12 01:37:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:37:17,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 01:37:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:37:17,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 01:37:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-12 01:37:17,751 INFO L87 Difference]: Start difference. First operand 441 states and 628 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:37:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:37:20,402 INFO L93 Difference]: Finished difference Result 785 states and 1112 transitions. [2024-11-12 01:37:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 01:37:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-12 01:37:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:37:20,405 INFO L225 Difference]: With dead ends: 785 [2024-11-12 01:37:20,406 INFO L226 Difference]: Without dead ends: 557 [2024-11-12 01:37:20,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2024-11-12 01:37:20,407 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 356 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:37:20,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 531 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 01:37:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-12 01:37:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2024-11-12 01:37:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 376 states have (on average 1.3936170212765957) internal successors, (524), 376 states have internal predecessors, (524), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:37:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 602 transitions. [2024-11-12 01:37:20,437 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 602 transitions. Word has length 98 [2024-11-12 01:37:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:37:20,438 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 602 transitions. [2024-11-12 01:37:20,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:37:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 602 transitions. [2024-11-12 01:37:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 01:37:20,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:37:20,439 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:37:20,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 01:37:20,440 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:37:20,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:37:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1063649033, now seen corresponding path program 1 times [2024-11-12 01:37:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:37:20,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634891367] [2024-11-12 01:37:20,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:37:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:37:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat