./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/eca-rers2012/Problem11_label06.c -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 e7162a37b2481575f46ee042f017cf4130087aba4666f87e20be1f5306ddf30d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:10:06,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:10:06,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:10:06,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:10:06,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:10:06,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:10:06,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:10:06,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:10:06,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:10:06,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:10:06,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:10:06,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:10:06,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:10:06,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:10:06,522 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:10:06,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:10:06,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:10:06,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:10:06,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:10:06,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:10:06,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:10:06,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:10:06,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:10:06,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:10:06,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:10:06,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:10:06,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:10:06,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:10:06,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:10:06,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:10:06,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:10:06,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:10:06,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:06,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:10:06,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:10:06,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:10:06,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:10:06,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:10:06,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:10:06,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:10:06,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:10:06,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:10:06,536 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 -> e7162a37b2481575f46ee042f017cf4130087aba4666f87e20be1f5306ddf30d [2024-11-08 11:10:06,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:10:06,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:10:06,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:10:06,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:10:06,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:10:06,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label06.c [2024-11-08 11:10:08,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:10:08,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:10:08,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label06.c [2024-11-08 11:10:08,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374effff5/410b794334c14e72ad79fb61ac6b114f/FLAG1ea8afc0f [2024-11-08 11:10:08,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374effff5/410b794334c14e72ad79fb61ac6b114f [2024-11-08 11:10:08,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:10:08,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:10:08,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:08,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:10:08,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:10:08,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:08" (1/1) ... [2024-11-08 11:10:08,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdfc9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:08, skipping insertion in model container [2024-11-08 11:10:08,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:08" (1/1) ... [2024-11-08 11:10:08,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:10:08,925 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/eca-rers2012/Problem11_label06.c[9087,9100] [2024-11-08 11:10:09,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:09,110 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:10:09,144 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/eca-rers2012/Problem11_label06.c[9087,9100] [2024-11-08 11:10:09,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:09,255 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:10:09,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09 WrapperNode [2024-11-08 11:10:09,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:09,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:09,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:10:09,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:10:09,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,396 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:10:09,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:09,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:10:09,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:10:09,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:10:09,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,498 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-08 11:10:09,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:10:09,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:10:09,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:10:09,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:10:09,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (1/1) ... [2024-11-08 11:10:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:09,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:09,649 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-08 11:10:09,709 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-08 11:10:09,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:10:09,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:10:09,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:10:09,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:10:09,829 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:10:09,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:10:11,320 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:10:11,321 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:10:11,346 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:10:11,346 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:10:11,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:11 BoogieIcfgContainer [2024-11-08 11:10:11,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:10:11,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:10:11,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:10:11,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:10:11,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:10:08" (1/3) ... [2024-11-08 11:10:11,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368ea3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:11, skipping insertion in model container [2024-11-08 11:10:11,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:09" (2/3) ... [2024-11-08 11:10:11,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368ea3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:11, skipping insertion in model container [2024-11-08 11:10:11,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:11" (3/3) ... [2024-11-08 11:10:11,356 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label06.c [2024-11-08 11:10:11,374 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:10:11,374 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:10:11,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:10:11,454 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;@ce0678a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:10:11,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:10:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 11:10:11,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:11,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:11,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -696204111, now seen corresponding path program 1 times [2024-11-08 11:10:11,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:11,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339985584] [2024-11-08 11:10:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339985584] [2024-11-08 11:10:11,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339985584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:11,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:11,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478041039] [2024-11-08 11:10:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:11,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:11,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:11,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:11,983 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:13,091 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-08 11:10:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 11:10:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:13,105 INFO L225 Difference]: With dead ends: 761 [2024-11-08 11:10:13,106 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 11:10:13,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:13,112 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 165 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:13,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:10:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 11:10:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-08 11:10:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-08 11:10:13,170 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 63 [2024-11-08 11:10:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:13,171 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-08 11:10:13,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-08 11:10:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 11:10:13,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:13,177 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:13,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:10:13,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1774038808, now seen corresponding path program 1 times [2024-11-08 11:10:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57687508] [2024-11-08 11:10:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57687508] [2024-11-08 11:10:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57687508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:13,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384702189] [2024-11-08 11:10:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:13,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:13,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:13,392 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:14,200 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-08 11:10:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:14,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-11-08 11:10:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:14,204 INFO L225 Difference]: With dead ends: 1211 [2024-11-08 11:10:14,204 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 11:10:14,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:14,207 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:14,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:10:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 11:10:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-08 11:10:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-08 11:10:14,240 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 131 [2024-11-08 11:10:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:14,240 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-08 11:10:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-08 11:10:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 11:10:14,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:14,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:14,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:10:14,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:14,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -977289123, now seen corresponding path program 1 times [2024-11-08 11:10:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:14,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977982393] [2024-11-08 11:10:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:14,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977982393] [2024-11-08 11:10:14,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977982393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:14,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:14,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760480664] [2024-11-08 11:10:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:14,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:14,699 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:15,382 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-08 11:10:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-11-08 11:10:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:15,387 INFO L225 Difference]: With dead ends: 1945 [2024-11-08 11:10:15,387 INFO L226 Difference]: Without dead ends: 1158 [2024-11-08 11:10:15,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:15,389 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:15,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-08 11:10:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-08 11:10:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-08 11:10:15,422 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 133 [2024-11-08 11:10:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:15,423 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-08 11:10:15,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-08 11:10:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 11:10:15,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:15,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:15,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:10:15,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:15,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash -873825219, now seen corresponding path program 1 times [2024-11-08 11:10:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715793498] [2024-11-08 11:10:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:15,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715793498] [2024-11-08 11:10:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715793498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:15,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:15,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862456750] [2024-11-08 11:10:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:15,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:15,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:15,764 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:16,511 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-08 11:10:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2024-11-08 11:10:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:16,517 INFO L225 Difference]: With dead ends: 2519 [2024-11-08 11:10:16,517 INFO L226 Difference]: Without dead ends: 1548 [2024-11-08 11:10:16,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:16,520 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 172 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:16,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-08 11:10:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-08 11:10:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-08 11:10:16,556 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 190 [2024-11-08 11:10:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:16,558 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-08 11:10:16,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-08 11:10:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 11:10:16,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:16,563 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:16,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:10:16,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:16,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2127494464, now seen corresponding path program 1 times [2024-11-08 11:10:16,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:16,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140695784] [2024-11-08 11:10:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:10:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140695784] [2024-11-08 11:10:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140695784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865949911] [2024-11-08 11:10:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:16,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:16,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:16,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:16,910 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:17,727 INFO L93 Difference]: Finished difference Result 4009 states and 5316 transitions. [2024-11-08 11:10:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2024-11-08 11:10:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:17,738 INFO L225 Difference]: With dead ends: 4009 [2024-11-08 11:10:17,738 INFO L226 Difference]: Without dead ends: 2650 [2024-11-08 11:10:17,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:17,743 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 144 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:17,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 347 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:10:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2024-11-08 11:10:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2024-11-08 11:10:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2649 states have (on average 1.2431106077765195) internal successors, (3293), 2649 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3293 transitions. [2024-11-08 11:10:17,791 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3293 transitions. Word has length 245 [2024-11-08 11:10:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:17,791 INFO L471 AbstractCegarLoop]: Abstraction has 2650 states and 3293 transitions. [2024-11-08 11:10:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3293 transitions. [2024-11-08 11:10:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 11:10:17,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:17,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:17,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:10:17,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:17,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash -468248497, now seen corresponding path program 1 times [2024-11-08 11:10:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411757316] [2024-11-08 11:10:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 25 proven. 96 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:10:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:18,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411757316] [2024-11-08 11:10:18,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411757316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928108160] [2024-11-08 11:10:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:18,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:18,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:10:18,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:10:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:18,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:10:18,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:10:18,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:10:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928108160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:18,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:10:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:10:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487148363] [2024-11-08 11:10:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:18,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:18,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:18,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:10:18,550 INFO L87 Difference]: Start difference. First operand 2650 states and 3293 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:19,487 INFO L93 Difference]: Finished difference Result 6228 states and 7865 transitions. [2024-11-08 11:10:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-11-08 11:10:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:19,500 INFO L225 Difference]: With dead ends: 6228 [2024-11-08 11:10:19,501 INFO L226 Difference]: Without dead ends: 3764 [2024-11-08 11:10:19,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:10:19,505 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 133 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:19,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 384 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:10:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2024-11-08 11:10:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3755. [2024-11-08 11:10:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.2192328183271177) internal successors, (4577), 3754 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4577 transitions. [2024-11-08 11:10:19,575 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4577 transitions. Word has length 251 [2024-11-08 11:10:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:19,576 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 4577 transitions. [2024-11-08 11:10:19,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4577 transitions. [2024-11-08 11:10:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-08 11:10:19,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:19,583 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:19,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:10:19,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 11:10:19,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash 496121255, now seen corresponding path program 1 times [2024-11-08 11:10:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341906729] [2024-11-08 11:10:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 11:10:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:20,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341906729] [2024-11-08 11:10:20,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341906729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:20,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:20,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946637953] [2024-11-08 11:10:20,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:20,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:20,053 INFO L87 Difference]: Start difference. First operand 3755 states and 4577 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:20,859 INFO L93 Difference]: Finished difference Result 8442 states and 10451 transitions. [2024-11-08 11:10:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:20,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2024-11-08 11:10:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:20,874 INFO L225 Difference]: With dead ends: 8442 [2024-11-08 11:10:20,874 INFO L226 Difference]: Without dead ends: 4873 [2024-11-08 11:10:20,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:20,879 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:20,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 344 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:20,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-08 11:10:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4676. [2024-11-08 11:10:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4676 states, 4675 states have (on average 1.2094117647058824) internal successors, (5654), 4675 states have internal predecessors, (5654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 5654 transitions. [2024-11-08 11:10:20,956 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 5654 transitions. Word has length 322 [2024-11-08 11:10:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:20,957 INFO L471 AbstractCegarLoop]: Abstraction has 4676 states and 5654 transitions. [2024-11-08 11:10:20,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 5654 transitions. [2024-11-08 11:10:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-08 11:10:20,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:20,966 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:20,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:10:20,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:20,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:20,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1494112082, now seen corresponding path program 1 times [2024-11-08 11:10:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481395364] [2024-11-08 11:10:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:10:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481395364] [2024-11-08 11:10:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481395364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:21,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:21,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:21,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374170120] [2024-11-08 11:10:21,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:21,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:21,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:21,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:21,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:21,180 INFO L87 Difference]: Start difference. First operand 4676 states and 5654 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:21,889 INFO L93 Difference]: Finished difference Result 9326 states and 11272 transitions. [2024-11-08 11:10:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2024-11-08 11:10:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:21,906 INFO L225 Difference]: With dead ends: 9326 [2024-11-08 11:10:21,906 INFO L226 Difference]: Without dead ends: 4652 [2024-11-08 11:10:21,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:21,913 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 159 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:21,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 150 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2024-11-08 11:10:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4651. [2024-11-08 11:10:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4651 states, 4650 states have (on average 1.15247311827957) internal successors, (5359), 4650 states have internal predecessors, (5359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4651 states to 4651 states and 5359 transitions. [2024-11-08 11:10:21,991 INFO L78 Accepts]: Start accepts. Automaton has 4651 states and 5359 transitions. Word has length 325 [2024-11-08 11:10:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:21,991 INFO L471 AbstractCegarLoop]: Abstraction has 4651 states and 5359 transitions. [2024-11-08 11:10:21,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4651 states and 5359 transitions. [2024-11-08 11:10:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-11-08 11:10:22,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:22,001 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:22,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:10:22,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:22,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash -547751050, now seen corresponding path program 1 times [2024-11-08 11:10:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:22,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651161779] [2024-11-08 11:10:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:22,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651161779] [2024-11-08 11:10:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651161779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:22,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:10:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270966829] [2024-11-08 11:10:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:22,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:22,827 INFO L87 Difference]: Start difference. First operand 4651 states and 5359 transitions. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:24,069 INFO L93 Difference]: Finished difference Result 12640 states and 14697 transitions. [2024-11-08 11:10:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:24,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 388 [2024-11-08 11:10:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:24,102 INFO L225 Difference]: With dead ends: 12640 [2024-11-08 11:10:24,103 INFO L226 Difference]: Without dead ends: 7991 [2024-11-08 11:10:24,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:24,110 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 234 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:24,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 159 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:10:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2024-11-08 11:10:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 7435. [2024-11-08 11:10:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 7434 states have (on average 1.146758138283562) internal successors, (8525), 7434 states have internal predecessors, (8525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 8525 transitions. [2024-11-08 11:10:24,256 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 8525 transitions. Word has length 388 [2024-11-08 11:10:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:24,257 INFO L471 AbstractCegarLoop]: Abstraction has 7435 states and 8525 transitions. [2024-11-08 11:10:24,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 8525 transitions. [2024-11-08 11:10:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-08 11:10:24,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:24,271 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-08 11:10:24,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:10:24,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:24,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -467739689, now seen corresponding path program 1 times [2024-11-08 11:10:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741241724] [2024-11-08 11:10:24,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 11:10:24,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:24,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741241724] [2024-11-08 11:10:24,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741241724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877487929] [2024-11-08 11:10:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:24,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:24,615 INFO L87 Difference]: Start difference. First operand 7435 states and 8525 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:24,967 INFO L93 Difference]: Finished difference Result 14862 states and 17042 transitions. [2024-11-08 11:10:24,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:24,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2024-11-08 11:10:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:24,981 INFO L225 Difference]: With dead ends: 14862 [2024-11-08 11:10:24,981 INFO L226 Difference]: Without dead ends: 7429 [2024-11-08 11:10:24,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:24,990 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:24,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:10:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2024-11-08 11:10:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7428. [2024-11-08 11:10:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7428 states, 7427 states have (on average 1.1460885956644675) internal successors, (8512), 7427 states have internal predecessors, (8512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 8512 transitions. [2024-11-08 11:10:25,092 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 8512 transitions. Word has length 403 [2024-11-08 11:10:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:25,092 INFO L471 AbstractCegarLoop]: Abstraction has 7428 states and 8512 transitions. [2024-11-08 11:10:25,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 8512 transitions. [2024-11-08 11:10:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-11-08 11:10:25,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:25,108 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:25,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:10:25,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:25,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1746481750, now seen corresponding path program 1 times [2024-11-08 11:10:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:25,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103906061] [2024-11-08 11:10:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:25,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 11:10:25,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103906061] [2024-11-08 11:10:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103906061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:25,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392038023] [2024-11-08 11:10:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:25,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:25,557 INFO L87 Difference]: Start difference. First operand 7428 states and 8512 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:26,169 INFO L93 Difference]: Finished difference Result 16714 states and 19129 transitions. [2024-11-08 11:10:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:26,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2024-11-08 11:10:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:26,186 INFO L225 Difference]: With dead ends: 16714 [2024-11-08 11:10:26,187 INFO L226 Difference]: Without dead ends: 9288 [2024-11-08 11:10:26,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:26,197 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:26,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 179 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2024-11-08 11:10:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 9084. [2024-11-08 11:10:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 9083 states have (on average 1.1353077177144115) internal successors, (10312), 9083 states have internal predecessors, (10312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 10312 transitions. [2024-11-08 11:10:26,319 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 10312 transitions. Word has length 435 [2024-11-08 11:10:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:26,320 INFO L471 AbstractCegarLoop]: Abstraction has 9084 states and 10312 transitions. [2024-11-08 11:10:26,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 10312 transitions. [2024-11-08 11:10:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-11-08 11:10:26,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:26,368 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:26,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:10:26,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:26,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1744296818, now seen corresponding path program 1 times [2024-11-08 11:10:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721394419] [2024-11-08 11:10:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 11:10:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721394419] [2024-11-08 11:10:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721394419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:26,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475109660] [2024-11-08 11:10:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:26,729 INFO L87 Difference]: Start difference. First operand 9084 states and 10312 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:27,405 INFO L93 Difference]: Finished difference Result 20925 states and 23747 transitions. [2024-11-08 11:10:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 487 [2024-11-08 11:10:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:27,423 INFO L225 Difference]: With dead ends: 20925 [2024-11-08 11:10:27,423 INFO L226 Difference]: Without dead ends: 11107 [2024-11-08 11:10:27,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:27,435 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 65 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:27,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 350 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11107 states. [2024-11-08 11:10:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11107 to 10555. [2024-11-08 11:10:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10555 states, 10554 states have (on average 1.1255448171309457) internal successors, (11879), 10554 states have internal predecessors, (11879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10555 states to 10555 states and 11879 transitions. [2024-11-08 11:10:27,570 INFO L78 Accepts]: Start accepts. Automaton has 10555 states and 11879 transitions. Word has length 487 [2024-11-08 11:10:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:27,571 INFO L471 AbstractCegarLoop]: Abstraction has 10555 states and 11879 transitions. [2024-11-08 11:10:27,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 10555 states and 11879 transitions. [2024-11-08 11:10:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-11-08 11:10:27,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:27,586 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:10:27,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash -192105898, now seen corresponding path program 1 times [2024-11-08 11:10:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331464580] [2024-11-08 11:10:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 621 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-08 11:10:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331464580] [2024-11-08 11:10:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331464580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213450713] [2024-11-08 11:10:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:28,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:28,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:28,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:28,045 INFO L87 Difference]: Start difference. First operand 10555 states and 11879 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:28,666 INFO L93 Difference]: Finished difference Result 24423 states and 27490 transitions. [2024-11-08 11:10:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 527 [2024-11-08 11:10:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:28,690 INFO L225 Difference]: With dead ends: 24423 [2024-11-08 11:10:28,690 INFO L226 Difference]: Without dead ends: 13870 [2024-11-08 11:10:28,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:28,703 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 125 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:28,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 79 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2024-11-08 11:10:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13867. [2024-11-08 11:10:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13867 states, 13866 states have (on average 1.117914322803981) internal successors, (15501), 13866 states have internal predecessors, (15501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13867 states to 13867 states and 15501 transitions. [2024-11-08 11:10:28,920 INFO L78 Accepts]: Start accepts. Automaton has 13867 states and 15501 transitions. Word has length 527 [2024-11-08 11:10:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 13867 states and 15501 transitions. [2024-11-08 11:10:28,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13867 states and 15501 transitions. [2024-11-08 11:10:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2024-11-08 11:10:28,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:28,936 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:28,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:10:28,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:28,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2020315425, now seen corresponding path program 1 times [2024-11-08 11:10:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:28,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688285646] [2024-11-08 11:10:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 324 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-08 11:10:30,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688285646] [2024-11-08 11:10:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688285646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:10:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273459429] [2024-11-08 11:10:30,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:30,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:10:30,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:30,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:10:30,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:10:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:30,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:10:30,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:10:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-08 11:10:30,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:10:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273459429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:30,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:10:30,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:10:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702370046] [2024-11-08 11:10:30,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:30,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:30,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:10:30,929 INFO L87 Difference]: Start difference. First operand 13867 states and 15501 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:31,644 INFO L93 Difference]: Finished difference Result 16261 states and 18135 transitions. [2024-11-08 11:10:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:31,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 533 [2024-11-08 11:10:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:31,671 INFO L225 Difference]: With dead ends: 16261 [2024-11-08 11:10:31,671 INFO L226 Difference]: Without dead ends: 16259 [2024-11-08 11:10:31,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:10:31,677 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 158 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:31,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 137 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16259 states. [2024-11-08 11:10:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16259 to 13867. [2024-11-08 11:10:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13867 states, 13866 states have (on average 1.117842203952113) internal successors, (15500), 13866 states have internal predecessors, (15500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13867 states to 13867 states and 15500 transitions. [2024-11-08 11:10:31,882 INFO L78 Accepts]: Start accepts. Automaton has 13867 states and 15500 transitions. Word has length 533 [2024-11-08 11:10:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:31,882 INFO L471 AbstractCegarLoop]: Abstraction has 13867 states and 15500 transitions. [2024-11-08 11:10:31,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 13867 states and 15500 transitions. [2024-11-08 11:10:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-11-08 11:10:31,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:31,901 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:31,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:10:32,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 11:10:32,103 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:32,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1051688403, now seen corresponding path program 1 times [2024-11-08 11:10:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125829136] [2024-11-08 11:10:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-08 11:10:33,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:33,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125829136] [2024-11-08 11:10:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125829136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:33,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:10:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51406666] [2024-11-08 11:10:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:33,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:33,284 INFO L87 Difference]: Start difference. First operand 13867 states and 15500 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:34,363 INFO L93 Difference]: Finished difference Result 30691 states and 34303 transitions. [2024-11-08 11:10:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:34,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 551 [2024-11-08 11:10:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:34,389 INFO L225 Difference]: With dead ends: 30691 [2024-11-08 11:10:34,389 INFO L226 Difference]: Without dead ends: 16826 [2024-11-08 11:10:34,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:34,402 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 206 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:34,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 156 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:10:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16826 states. [2024-11-08 11:10:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16826 to 13681. [2024-11-08 11:10:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13681 states, 13680 states have (on average 1.1176169590643275) internal successors, (15289), 13680 states have internal predecessors, (15289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13681 states to 13681 states and 15289 transitions. [2024-11-08 11:10:34,642 INFO L78 Accepts]: Start accepts. Automaton has 13681 states and 15289 transitions. Word has length 551 [2024-11-08 11:10:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:34,642 INFO L471 AbstractCegarLoop]: Abstraction has 13681 states and 15289 transitions. [2024-11-08 11:10:34,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 13681 states and 15289 transitions. [2024-11-08 11:10:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2024-11-08 11:10:34,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:34,655 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-08 11:10:34,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:10:34,656 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 720401217, now seen corresponding path program 1 times [2024-11-08 11:10:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527175851] [2024-11-08 11:10:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 834 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 11:10:35,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:35,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527175851] [2024-11-08 11:10:35,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527175851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:35,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:10:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444116086] [2024-11-08 11:10:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:35,192 INFO L87 Difference]: Start difference. First operand 13681 states and 15289 transitions. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:36,372 INFO L93 Difference]: Finished difference Result 32710 states and 36531 transitions. [2024-11-08 11:10:36,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:36,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 581 [2024-11-08 11:10:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:36,397 INFO L225 Difference]: With dead ends: 32710 [2024-11-08 11:10:36,397 INFO L226 Difference]: Without dead ends: 19031 [2024-11-08 11:10:36,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:36,412 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 157 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:36,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 59 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:10:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2024-11-08 11:10:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 15333. [2024-11-08 11:10:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15333 states, 15332 states have (on average 1.1081398382468042) internal successors, (16990), 15332 states have internal predecessors, (16990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15333 states to 15333 states and 16990 transitions. [2024-11-08 11:10:36,715 INFO L78 Accepts]: Start accepts. Automaton has 15333 states and 16990 transitions. Word has length 581 [2024-11-08 11:10:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:36,716 INFO L471 AbstractCegarLoop]: Abstraction has 15333 states and 16990 transitions. [2024-11-08 11:10:36,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 15333 states and 16990 transitions. [2024-11-08 11:10:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-11-08 11:10:36,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:36,739 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 11:10:36,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:10:36,739 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:36,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1947745532, now seen corresponding path program 1 times [2024-11-08 11:10:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:36,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965530711] [2024-11-08 11:10:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-08 11:10:37,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:37,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965530711] [2024-11-08 11:10:37,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965530711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:37,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:37,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:37,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719347866] [2024-11-08 11:10:37,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:37,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:10:37,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:37,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:10:37,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:37,230 INFO L87 Difference]: Start difference. First operand 15333 states and 16990 transitions. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:38,279 INFO L93 Difference]: Finished difference Result 39329 states and 43397 transitions. [2024-11-08 11:10:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:10:38,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 599 [2024-11-08 11:10:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:38,302 INFO L225 Difference]: With dead ends: 39329 [2024-11-08 11:10:38,302 INFO L226 Difference]: Without dead ends: 23998 [2024-11-08 11:10:38,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:10:38,314 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 160 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:38,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 67 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:10:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23998 states. [2024-11-08 11:10:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23998 to 22519. [2024-11-08 11:10:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22519 states, 22518 states have (on average 1.10134114930278) internal successors, (24800), 22518 states have internal predecessors, (24800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22519 states to 22519 states and 24800 transitions. [2024-11-08 11:10:38,630 INFO L78 Accepts]: Start accepts. Automaton has 22519 states and 24800 transitions. Word has length 599 [2024-11-08 11:10:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:38,631 INFO L471 AbstractCegarLoop]: Abstraction has 22519 states and 24800 transitions. [2024-11-08 11:10:38,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22519 states and 24800 transitions. [2024-11-08 11:10:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2024-11-08 11:10:38,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:38,652 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-08 11:10:38,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:10:38,652 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1631375320, now seen corresponding path program 1 times [2024-11-08 11:10:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314593911] [2024-11-08 11:10:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-11-08 11:10:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:38,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314593911] [2024-11-08 11:10:38,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314593911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:38,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586781655] [2024-11-08 11:10:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:38,944 INFO L87 Difference]: Start difference. First operand 22519 states and 24800 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:39,547 INFO L93 Difference]: Finished difference Result 45032 states and 49618 transitions. [2024-11-08 11:10:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:39,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 650 [2024-11-08 11:10:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:39,570 INFO L225 Difference]: With dead ends: 45032 [2024-11-08 11:10:39,570 INFO L226 Difference]: Without dead ends: 25095 [2024-11-08 11:10:39,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:39,586 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 145 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:39,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 113 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25095 states. [2024-11-08 11:10:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25095 to 22887. [2024-11-08 11:10:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22887 states, 22886 states have (on average 1.097876431005855) internal successors, (25126), 22886 states have internal predecessors, (25126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22887 states to 22887 states and 25126 transitions. [2024-11-08 11:10:39,844 INFO L78 Accepts]: Start accepts. Automaton has 22887 states and 25126 transitions. Word has length 650 [2024-11-08 11:10:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:39,845 INFO L471 AbstractCegarLoop]: Abstraction has 22887 states and 25126 transitions. [2024-11-08 11:10:39,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 22887 states and 25126 transitions. [2024-11-08 11:10:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2024-11-08 11:10:39,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:39,867 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 11:10:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:10:39,868 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:39,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1057845284, now seen corresponding path program 1 times [2024-11-08 11:10:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:39,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448699640] [2024-11-08 11:10:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:39,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-11-08 11:10:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448699640] [2024-11-08 11:10:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448699640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719865629] [2024-11-08 11:10:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:40,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:40,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:40,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:40,261 INFO L87 Difference]: Start difference. First operand 22887 states and 25126 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:40,873 INFO L93 Difference]: Finished difference Result 47243 states and 51839 transitions. [2024-11-08 11:10:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 683 [2024-11-08 11:10:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:40,898 INFO L225 Difference]: With dead ends: 47243 [2024-11-08 11:10:40,898 INFO L226 Difference]: Without dead ends: 24726 [2024-11-08 11:10:40,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:40,914 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 115 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:40,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 137 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24726 states. [2024-11-08 11:10:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24726 to 22327. [2024-11-08 11:10:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22327 states, 22326 states have (on average 1.0942846904953865) internal successors, (24431), 22326 states have internal predecessors, (24431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22327 states to 22327 states and 24431 transitions. [2024-11-08 11:10:41,123 INFO L78 Accepts]: Start accepts. Automaton has 22327 states and 24431 transitions. Word has length 683 [2024-11-08 11:10:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:41,124 INFO L471 AbstractCegarLoop]: Abstraction has 22327 states and 24431 transitions. [2024-11-08 11:10:41,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 22327 states and 24431 transitions. [2024-11-08 11:10:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2024-11-08 11:10:41,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:41,145 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 11:10:41,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:10:41,145 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:41,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2044993265, now seen corresponding path program 1 times [2024-11-08 11:10:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:41,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630339497] [2024-11-08 11:10:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:41,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1777 backedges. 1159 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-08 11:10:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630339497] [2024-11-08 11:10:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630339497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:41,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255154591] [2024-11-08 11:10:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:41,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:41,617 INFO L87 Difference]: Start difference. First operand 22327 states and 24431 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:42,249 INFO L93 Difference]: Finished difference Result 43363 states and 47434 transitions. [2024-11-08 11:10:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 732 [2024-11-08 11:10:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:42,251 INFO L225 Difference]: With dead ends: 43363 [2024-11-08 11:10:42,251 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:10:42,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:42,266 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:42,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 338 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:10:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:10:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:10:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:10:42,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2024-11-08 11:10:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:42,268 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:10:42,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:10:42,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:10:42,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:10:42,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:10:42,273 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:42,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:10:47,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:10:47,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:10:47 BoogieIcfgContainer [2024-11-08 11:10:47,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:10:47,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:10:47,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:10:47,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:10:47,846 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:11" (3/4) ... [2024-11-08 11:10:47,848 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:10:47,873 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:10:47,874 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:10:47,875 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:10:47,876 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:10:48,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:10:48,043 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:10:48,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:10:48,043 INFO L158 Benchmark]: Toolchain (without parser) took 39483.98ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 88.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 438.2MB. Max. memory is 16.1GB. [2024-11-08 11:10:48,044 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:10:48,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.72ms. Allocated memory is still 157.3MB. Free memory was 87.9MB in the beginning and 92.4MB in the end (delta: -4.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-08 11:10:48,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.36ms. Allocated memory is still 157.3MB. Free memory was 92.4MB in the beginning and 74.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 11:10:48,045 INFO L158 Benchmark]: Boogie Preprocessor took 215.05ms. Allocated memory is still 157.3MB. Free memory was 74.7MB in the beginning and 49.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:10:48,045 INFO L158 Benchmark]: RCFGBuilder took 1733.98ms. Allocated memory was 157.3MB in the beginning and 237.0MB in the end (delta: 79.7MB). Free memory was 49.6MB in the beginning and 162.1MB in the end (delta: -112.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-08 11:10:48,046 INFO L158 Benchmark]: TraceAbstraction took 36494.23ms. Allocated memory was 237.0MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 161.1MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-08 11:10:48,049 INFO L158 Benchmark]: Witness Printer took 198.14ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:10:48,050 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.72ms. Allocated memory is still 157.3MB. Free memory was 87.9MB in the beginning and 92.4MB in the end (delta: -4.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.36ms. Allocated memory is still 157.3MB. Free memory was 92.4MB in the beginning and 74.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 215.05ms. Allocated memory is still 157.3MB. Free memory was 74.7MB in the beginning and 49.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1733.98ms. Allocated memory was 157.3MB in the beginning and 237.0MB in the end (delta: 79.7MB). Free memory was 49.6MB in the beginning and 162.1MB in the end (delta: -112.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 36494.23ms. Allocated memory was 237.0MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 161.1MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 198.14ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 205]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2863 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2863 mSDsluCounter, 3892 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 466 mSDsCounter, 2002 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12642 IncrementalHoareTripleChecker+Invalid, 14644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2002 mSolverCounterUnsat, 3426 mSDtfsCounter, 12642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 844 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22887occurred in iteration=18, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 16859 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 9013 NumberOfCodeBlocks, 9013 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 8991 ConstructedInterpolants, 0 QuantifiedInterpolants, 19855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 13232/13734 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((a25 == 11) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29)) && (0 <= ((long long) a23 + 42))) || (((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a8 <= 15)) && (a29 <= 220)) && (a4 == 1))) || (((((a25 == 11) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || (((((139 <= a23) && (a8 <= 15)) && (a29 <= 599998)) && (a4 == 1)) && (a23 <= 312))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a8 <= 15)) && (a25 == 10))) || (((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a8 <= 15)) && (a23 <= 312)) && (13 <= a25))) || ((((a25 == 12) && (a8 <= 15)) && (((long long) 28470 + a29) <= 0)) && (a4 == 1))) || ((((a25 == 12) && (a4 == 0)) && (a8 <= 15)) && (a29 <= 599998))) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312))) || (((((a25 == 12) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1)) && (a23 <= 312))) || ((((((a4 == 0) && (a25 == 11)) && (a8 <= 15)) && (a29 <= 599998)) && (a23 <= 312)) && (246 <= a29))) || (((a25 <= 10) && (a8 <= 15)) && (a4 == 1))) || (((((a25 == 12) && (a8 <= 15)) && (a4 == 1)) && (312 <= a23)) && (a29 <= 231))) || (((((a8 <= 15) && (a29 <= 599998)) && (a4 == 1)) && (312 <= a23)) && (246 <= a29))) || ((((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a29 <= 599998)) && (246 <= a29))) || ((((a8 <= 15) && (a29 <= 220)) && (a4 == 1)) && (312 <= a23))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a8 <= 15)) && (((long long) 28470 + a29) <= 0))) || ((((a29 <= 274) && (a8 <= 15)) && (a4 == 1)) && (13 <= a25))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:10:48,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE