./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ea5326ea6a4625baef91f26404c87dc5d5aed789a046625372b5a13e975410bc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:40:18,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:40:18,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:40:18,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:40:18,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:40:18,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:40:18,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:40:18,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:40:18,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:40:18,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:40:18,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:40:18,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:40:18,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:40:18,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:40:18,547 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:40:18,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:40:18,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:40:18,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:40:18,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:40:18,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:40:18,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:40:18,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:40:18,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:40:18,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:40:18,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:40:18,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:40:18,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:40:18,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:40:18,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:40:18,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:40:18,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:40:18,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:40:18,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:40:18,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:40:18,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:40:18,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:40:18,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:40:18,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:40:18,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:40:18,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:40:18,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:40:18,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:40:18,553 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-clean/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-clean/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 -> ea5326ea6a4625baef91f26404c87dc5d5aed789a046625372b5a13e975410bc [2024-10-10 23:40:18,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:40:18,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:40:18,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:40:18,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:40:18,818 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:40:18,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c [2024-10-10 23:40:20,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:40:20,377 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:40:20,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c [2024-10-10 23:40:20,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ba9a3530/664f318715034cc486c3e0f092e87957/FLAGd642477d7 [2024-10-10 23:40:20,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ba9a3530/664f318715034cc486c3e0f092e87957 [2024-10-10 23:40:20,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:40:20,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:40:20,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:40:20,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:40:20,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:40:20,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:40:20" (1/1) ... [2024-10-10 23:40:20,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4705f3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:20, skipping insertion in model container [2024-10-10 23:40:20,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:40:20" (1/1) ... [2024-10-10 23:40:20,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:40:20,872 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c[3517,3530] [2024-10-10 23:40:21,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:40:21,159 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:40:21,178 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c[3517,3530] [2024-10-10 23:40:21,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:40:21,299 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:40:21,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21 WrapperNode [2024-10-10 23:40:21,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:40:21,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:40:21,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:40:21,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:40:21,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,450 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:40:21,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:40:21,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:40:21,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:40:21,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:40:21,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,521 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:40:21,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:40:21,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:40:21,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:40:21,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:40:21,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (1/1) ... [2024-10-10 23:40:21,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:40:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:21,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:40:21,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:40:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:40:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:40:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:40:21,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:40:21,749 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:40:21,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:40:23,376 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:40:23,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:40:23,415 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:40:23,415 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:40:23,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:23 BoogieIcfgContainer [2024-10-10 23:40:23,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:40:23,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:40:23,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:40:23,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:40:23,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:40:20" (1/3) ... [2024-10-10 23:40:23,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3c6a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:40:23, skipping insertion in model container [2024-10-10 23:40:23,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:21" (2/3) ... [2024-10-10 23:40:23,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3c6a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:40:23, skipping insertion in model container [2024-10-10 23:40:23,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:23" (3/3) ... [2024-10-10 23:40:23,423 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label10.c [2024-10-10 23:40:23,436 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:40:23,437 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:40:23,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:40:23,509 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;@6e0e394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:40:23,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:40:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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-10-10 23:40:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 23:40:23,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:23,523 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] [2024-10-10 23:40:23,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -221418203, now seen corresponding path program 1 times [2024-10-10 23:40:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:23,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370591895] [2024-10-10 23:40:23,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:23,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:23,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370591895] [2024-10-10 23:40:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370591895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:23,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:23,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758774356] [2024-10-10 23:40:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:23,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:40:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:40:23,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:40:23,711 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-10-10 23:40:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:23,751 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:40:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:40:23,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2024-10-10 23:40:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:23,767 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:40:23,767 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:40:23,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:40:23,776 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:23,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:40:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:40:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:40:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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-10-10 23:40:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:40:23,820 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 31 [2024-10-10 23:40:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:23,821 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:40:23,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-10-10 23:40:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:40:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 23:40:23,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:23,822 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] [2024-10-10 23:40:23,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:40:23,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:23,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash -789274314, now seen corresponding path program 1 times [2024-10-10 23:40:23,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:23,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374539961] [2024-10-10 23:40:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:23,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:23,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374539961] [2024-10-10 23:40:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374539961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:23,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720035742] [2024-10-10 23:40:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:23,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:23,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:23,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:23,954 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-10-10 23:40:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:25,362 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-10 23:40:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:25,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2024-10-10 23:40:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:25,365 INFO L225 Difference]: With dead ends: 992 [2024-10-10 23:40:25,365 INFO L226 Difference]: Without dead ends: 661 [2024-10-10 23:40:25,366 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-10-10 23:40:25,367 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 318 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:25,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 77 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:40:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-10 23:40:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-10 23:40:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7015151515151514) internal successors, (1123), 660 states have internal predecessors, (1123), 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-10-10 23:40:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1123 transitions. [2024-10-10 23:40:25,400 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1123 transitions. Word has length 31 [2024-10-10 23:40:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:25,400 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1123 transitions. [2024-10-10 23:40:25,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-10-10 23:40:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1123 transitions. [2024-10-10 23:40:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-10 23:40:25,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:25,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:25,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:40:25,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:25,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash -877317963, now seen corresponding path program 1 times [2024-10-10 23:40:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:25,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183812388] [2024-10-10 23:40:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183812388] [2024-10-10 23:40:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183812388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220126666] [2024-10-10 23:40:25,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:25,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:25,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:25,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:25,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:25,590 INFO L87 Difference]: Start difference. First operand 661 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-10-10 23:40:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:26,757 INFO L93 Difference]: Finished difference Result 1979 states and 3366 transitions. [2024-10-10 23:40:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:26,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2024-10-10 23:40:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:26,762 INFO L225 Difference]: With dead ends: 1979 [2024-10-10 23:40:26,762 INFO L226 Difference]: Without dead ends: 1319 [2024-10-10 23:40:26,763 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-10-10 23:40:26,764 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:26,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 75 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:40:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-10 23:40:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-10 23:40:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6206373292867982) internal successors, (2136), 1318 states have internal predecessors, (2136), 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-10-10 23:40:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2136 transitions. [2024-10-10 23:40:26,816 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2136 transitions. Word has length 97 [2024-10-10 23:40:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:26,816 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2136 transitions. [2024-10-10 23:40:26,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-10-10 23:40:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2136 transitions. [2024-10-10 23:40:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-10 23:40:26,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:26,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:26,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:40:26,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:26,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1946389903, now seen corresponding path program 1 times [2024-10-10 23:40:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933128431] [2024-10-10 23:40:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:26,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:26,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933128431] [2024-10-10 23:40:26,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933128431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:26,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:26,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698308263] [2024-10-10 23:40:26,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:26,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:26,913 INFO L87 Difference]: Start difference. First operand 1319 states and 2136 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-10-10 23:40:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:27,984 INFO L93 Difference]: Finished difference Result 3295 states and 5284 transitions. [2024-10-10 23:40:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 98 [2024-10-10 23:40:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:27,991 INFO L225 Difference]: With dead ends: 3295 [2024-10-10 23:40:27,992 INFO L226 Difference]: Without dead ends: 1977 [2024-10-10 23:40:27,997 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-10-10 23:40:27,999 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:27,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 153 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:40:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-10 23:40:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-10 23:40:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.33248987854251) internal successors, (2633), 1976 states have internal predecessors, (2633), 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-10-10 23:40:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2633 transitions. [2024-10-10 23:40:28,030 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2633 transitions. Word has length 98 [2024-10-10 23:40:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:28,031 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2633 transitions. [2024-10-10 23:40:28,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-10-10 23:40:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2633 transitions. [2024-10-10 23:40:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-10 23:40:28,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:28,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:28,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:40:28,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:28,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash -375205463, now seen corresponding path program 1 times [2024-10-10 23:40:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:28,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822884153] [2024-10-10 23:40:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:28,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:28,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822884153] [2024-10-10 23:40:28,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822884153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:28,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:28,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:28,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991499080] [2024-10-10 23:40:28,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:28,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:28,243 INFO L87 Difference]: Start difference. First operand 1977 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 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-10-10 23:40:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:29,289 INFO L93 Difference]: Finished difference Result 5927 states and 7896 transitions. [2024-10-10 23:40:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 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-10-10 23:40:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:29,306 INFO L225 Difference]: With dead ends: 5927 [2024-10-10 23:40:29,306 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:40:29,309 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-10-10 23:40:29,315 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:29,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 257 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:40:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:40:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:40:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 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-10-10 23:40:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-10 23:40:29,396 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 190 [2024-10-10 23:40:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:29,398 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-10 23:40:29,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 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-10-10 23:40:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-10 23:40:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-10 23:40:29,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:29,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:40:29,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1177634642, now seen corresponding path program 1 times [2024-10-10 23:40:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:29,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067017304] [2024-10-10 23:40:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:29,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:29,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067017304] [2024-10-10 23:40:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067017304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:29,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:29,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098502599] [2024-10-10 23:40:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:29,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:29,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:29,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:29,877 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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-10-10 23:40:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:30,991 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-10 23:40:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:30,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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 276 [2024-10-10 23:40:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:31,003 INFO L225 Difference]: With dead ends: 8230 [2024-10-10 23:40:31,003 INFO L226 Difference]: Without dead ends: 4280 [2024-10-10 23:40:31,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:31,009 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:31,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:40:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-10 23:40:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-10 23:40:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 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-10-10 23:40:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-10 23:40:31,060 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 276 [2024-10-10 23:40:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:31,061 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-10 23:40:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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-10-10 23:40:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-10 23:40:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-10-10 23:40:31,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:31,064 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:31,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:40:31,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:31,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash -83366261, now seen corresponding path program 1 times [2024-10-10 23:40:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:31,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723557667] [2024-10-10 23:40:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:31,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723557667] [2024-10-10 23:40:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723557667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:40:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291760465] [2024-10-10 23:40:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:40:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:40:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:40:31,596 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 6 states have internal predecessors, (363), 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-10-10 23:40:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:33,004 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-10 23:40:33,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:40:33,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 6 states have internal predecessors, (363), 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 363 [2024-10-10 23:40:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:33,017 INFO L225 Difference]: With dead ends: 8089 [2024-10-10 23:40:33,018 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:40:33,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:40:33,023 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 314 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:33,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 285 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:40:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:40:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:40:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 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-10-10 23:40:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-10 23:40:33,074 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 363 [2024-10-10 23:40:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:33,075 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-10 23:40:33,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 6 states have internal predecessors, (363), 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-10-10 23:40:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-10 23:40:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-10-10 23:40:33,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:33,079 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:33,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:40:33,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:33,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash 841547371, now seen corresponding path program 1 times [2024-10-10 23:40:33,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:33,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891162459] [2024-10-10 23:40:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-10 23:40:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891162459] [2024-10-10 23:40:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891162459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989523655] [2024-10-10 23:40:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:33,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:40:33,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:40:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:33,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:40:33,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-10 23:40:34,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:40:34,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989523655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:34,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:40:34,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:40:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085660933] [2024-10-10 23:40:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:34,003 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 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-10-10 23:40:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:34,712 INFO L93 Difference]: Finished difference Result 4940 states and 5286 transitions. [2024-10-10 23:40:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:34,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 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 370 [2024-10-10 23:40:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:34,724 INFO L225 Difference]: With dead ends: 4940 [2024-10-10 23:40:34,724 INFO L226 Difference]: Without dead ends: 4938 [2024-10-10 23:40:34,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:34,726 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:34,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 81 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2024-10-10 23:40:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4280. [2024-10-10 23:40:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.077120822622108) internal successors, (4609), 4279 states have internal predecessors, (4609), 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-10-10 23:40:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 4609 transitions. [2024-10-10 23:40:34,779 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 4609 transitions. Word has length 370 [2024-10-10 23:40:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:34,779 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 4609 transitions. [2024-10-10 23:40:34,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 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-10-10 23:40:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 4609 transitions. [2024-10-10 23:40:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2024-10-10 23:40:34,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:34,788 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:34,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:40:34,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:34,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1248185673, now seen corresponding path program 1 times [2024-10-10 23:40:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739798689] [2024-10-10 23:40:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-10 23:40:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739798689] [2024-10-10 23:40:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739798689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:35,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396082182] [2024-10-10 23:40:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:35,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:35,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:35,546 INFO L87 Difference]: Start difference. First operand 4280 states and 4609 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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-10-10 23:40:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:36,802 INFO L93 Difference]: Finished difference Result 12178 states and 13188 transitions. [2024-10-10 23:40:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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 569 [2024-10-10 23:40:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:36,822 INFO L225 Difference]: With dead ends: 12178 [2024-10-10 23:40:36,822 INFO L226 Difference]: Without dead ends: 8228 [2024-10-10 23:40:36,826 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-10-10 23:40:36,828 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 306 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:36,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 91 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:40:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8228 states. [2024-10-10 23:40:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8228 to 7899. [2024-10-10 23:40:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 7898 states have (on average 1.0724233983286908) internal successors, (8470), 7898 states have internal predecessors, (8470), 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-10-10 23:40:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 8470 transitions. [2024-10-10 23:40:36,929 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 8470 transitions. Word has length 569 [2024-10-10 23:40:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 7899 states and 8470 transitions. [2024-10-10 23:40:36,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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-10-10 23:40:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 8470 transitions. [2024-10-10 23:40:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2024-10-10 23:40:36,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:36,945 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, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:40:36,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1928520137, now seen corresponding path program 1 times [2024-10-10 23:40:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241746028] [2024-10-10 23:40:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-10 23:40:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241746028] [2024-10-10 23:40:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241746028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51816488] [2024-10-10 23:40:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:37,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:37,405 INFO L87 Difference]: Start difference. First operand 7899 states and 8470 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-10-10 23:40:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:38,008 INFO L93 Difference]: Finished difference Result 18429 states and 19932 transitions. [2024-10-10 23:40:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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 673 [2024-10-10 23:40:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:38,024 INFO L225 Difference]: With dead ends: 18429 [2024-10-10 23:40:38,024 INFO L226 Difference]: Without dead ends: 11189 [2024-10-10 23:40:38,031 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-10-10 23:40:38,032 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:38,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 36 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-10 23:40:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 11189. [2024-10-10 23:40:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0761530210940293) internal successors, (12040), 11188 states have internal predecessors, (12040), 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-10-10 23:40:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 12040 transitions. [2024-10-10 23:40:38,139 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 12040 transitions. Word has length 673 [2024-10-10 23:40:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:38,140 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 12040 transitions. [2024-10-10 23:40:38,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-10-10 23:40:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 12040 transitions. [2024-10-10 23:40:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2024-10-10 23:40:38,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:38,148 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:38,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:40:38,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:38,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1231189288, now seen corresponding path program 1 times [2024-10-10 23:40:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:38,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009602488] [2024-10-10 23:40:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2024-10-10 23:40:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009602488] [2024-10-10 23:40:39,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009602488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:39,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345357092] [2024-10-10 23:40:39,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:39,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:39,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:39,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:39,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:39,062 INFO L87 Difference]: Start difference. First operand 11189 states and 12040 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 3 states have internal predecessors, (523), 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-10-10 23:40:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:40,108 INFO L93 Difference]: Finished difference Result 22048 states and 23748 transitions. [2024-10-10 23:40:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 3 states have internal predecessors, (523), 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 792 [2024-10-10 23:40:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:40,123 INFO L225 Difference]: With dead ends: 22048 [2024-10-10 23:40:40,123 INFO L226 Difference]: Without dead ends: 11189 [2024-10-10 23:40:40,132 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-10-10 23:40:40,132 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 268 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:40,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 118 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:40:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-10 23:40:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 11189. [2024-10-10 23:40:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0757061136932426) internal successors, (12035), 11188 states have internal predecessors, (12035), 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-10-10 23:40:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 12035 transitions. [2024-10-10 23:40:40,235 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 12035 transitions. Word has length 792 [2024-10-10 23:40:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:40,235 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 12035 transitions. [2024-10-10 23:40:40,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 3 states have internal predecessors, (523), 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-10-10 23:40:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 12035 transitions. [2024-10-10 23:40:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2024-10-10 23:40:40,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:40,247 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, 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, 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, 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, 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] [2024-10-10 23:40:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:40:40,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2040847646, now seen corresponding path program 1 times [2024-10-10 23:40:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283245923] [2024-10-10 23:40:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 878 proven. 0 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2024-10-10 23:40:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283245923] [2024-10-10 23:40:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283245923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:40,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:40,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:40,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160938782] [2024-10-10 23:40:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:40,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:40,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:40,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:40,668 INFO L87 Difference]: Start difference. First operand 11189 states and 12035 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-10-10 23:40:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:41,433 INFO L93 Difference]: Finished difference Result 24351 states and 26360 transitions. [2024-10-10 23:40:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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 853 [2024-10-10 23:40:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:41,452 INFO L225 Difference]: With dead ends: 24351 [2024-10-10 23:40:41,452 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:40:41,463 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-10-10 23:40:41,464 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:41,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 434 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:40:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13163. [2024-10-10 23:40:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.065491566631211) internal successors, (14024), 13162 states have internal predecessors, (14024), 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-10-10 23:40:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 14024 transitions. [2024-10-10 23:40:41,654 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 14024 transitions. Word has length 853 [2024-10-10 23:40:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:41,655 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 14024 transitions. [2024-10-10 23:40:41,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-10-10 23:40:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 14024 transitions. [2024-10-10 23:40:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2024-10-10 23:40:41,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:41,666 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, 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, 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, 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, 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] [2024-10-10 23:40:41,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:40:41,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:41,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1903757885, now seen corresponding path program 1 times [2024-10-10 23:40:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:41,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159670919] [2024-10-10 23:40:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-10 23:40:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159670919] [2024-10-10 23:40:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159670919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:42,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:42,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073767663] [2024-10-10 23:40:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:42,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:42,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:42,117 INFO L87 Difference]: Start difference. First operand 13163 states and 14024 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-10-10 23:40:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:42,814 INFO L93 Difference]: Finished difference Result 30602 states and 32689 transitions. [2024-10-10 23:40:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 854 [2024-10-10 23:40:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:42,834 INFO L225 Difference]: With dead ends: 30602 [2024-10-10 23:40:42,834 INFO L226 Difference]: Without dead ends: 16782 [2024-10-10 23:40:42,847 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-10-10 23:40:42,847 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 272 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:42,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 425 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-10 23:40:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16453. [2024-10-10 23:40:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.050145878920496) internal successors, (17277), 16452 states have internal predecessors, (17277), 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-10-10 23:40:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 17277 transitions. [2024-10-10 23:40:43,007 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 17277 transitions. Word has length 854 [2024-10-10 23:40:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:43,008 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 17277 transitions. [2024-10-10 23:40:43,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-10-10 23:40:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 17277 transitions. [2024-10-10 23:40:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2024-10-10 23:40:43,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:43,021 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, 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, 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, 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, 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] [2024-10-10 23:40:43,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:40:43,022 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:43,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1670877019, now seen corresponding path program 1 times [2024-10-10 23:40:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:43,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486418437] [2024-10-10 23:40:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-10 23:40:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486418437] [2024-10-10 23:40:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486418437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365539093] [2024-10-10 23:40:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:43,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:43,441 INFO L87 Difference]: Start difference. First operand 16453 states and 17277 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-10-10 23:40:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:44,038 INFO L93 Difference]: Finished difference Result 33563 states and 35283 transitions. [2024-10-10 23:40:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:44,039 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 866 [2024-10-10 23:40:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:44,057 INFO L225 Difference]: With dead ends: 33563 [2024-10-10 23:40:44,057 INFO L226 Difference]: Without dead ends: 17769 [2024-10-10 23:40:44,071 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-10-10 23:40:44,072 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 253 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:44,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 422 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2024-10-10 23:40:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17111. [2024-10-10 23:40:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17111 states, 17110 states have (on average 1.0423728813559323) internal successors, (17835), 17110 states have internal predecessors, (17835), 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-10-10 23:40:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 17835 transitions. [2024-10-10 23:40:44,223 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 17835 transitions. Word has length 866 [2024-10-10 23:40:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:44,223 INFO L471 AbstractCegarLoop]: Abstraction has 17111 states and 17835 transitions. [2024-10-10 23:40:44,224 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-10-10 23:40:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 17835 transitions. [2024-10-10 23:40:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2024-10-10 23:40:44,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:44,266 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, 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, 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, 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, 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-10-10 23:40:44,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:40:44,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:44,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1679201070, now seen corresponding path program 1 times [2024-10-10 23:40:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:44,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489767535] [2024-10-10 23:40:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2024-10-10 23:40:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489767535] [2024-10-10 23:40:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489767535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:45,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:45,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14287780] [2024-10-10 23:40:45,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:45,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:45,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:45,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:45,004 INFO L87 Difference]: Start difference. First operand 17111 states and 17835 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-10 23:40:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:45,591 INFO L93 Difference]: Finished difference Result 33563 states and 35007 transitions. [2024-10-10 23:40:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 880 [2024-10-10 23:40:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:45,607 INFO L225 Difference]: With dead ends: 33563 [2024-10-10 23:40:45,608 INFO L226 Difference]: Without dead ends: 17111 [2024-10-10 23:40:45,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:45,618 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 285 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:45,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 374 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-10 23:40:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 16782. [2024-10-10 23:40:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.0376020499374292) internal successors, (17412), 16781 states have internal predecessors, (17412), 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-10-10 23:40:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17412 transitions. [2024-10-10 23:40:45,831 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17412 transitions. Word has length 880 [2024-10-10 23:40:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17412 transitions. [2024-10-10 23:40:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-10 23:40:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17412 transitions. [2024-10-10 23:40:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2024-10-10 23:40:45,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:45,858 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 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, 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] [2024-10-10 23:40:45,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:40:45,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:45,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1237097204, now seen corresponding path program 1 times [2024-10-10 23:40:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970349607] [2024-10-10 23:40:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3124 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 2412 trivial. 0 not checked. [2024-10-10 23:40:46,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:46,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970349607] [2024-10-10 23:40:46,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970349607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:46,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:46,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408809399] [2024-10-10 23:40:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:46,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:46,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:46,556 INFO L87 Difference]: Start difference. First operand 16782 states and 17412 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-10-10 23:40:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:47,289 INFO L93 Difference]: Finished difference Result 35537 states and 36958 transitions. [2024-10-10 23:40:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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 1207 [2024-10-10 23:40:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:47,304 INFO L225 Difference]: With dead ends: 35537 [2024-10-10 23:40:47,304 INFO L226 Difference]: Without dead ends: 17111 [2024-10-10 23:40:47,313 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-10-10 23:40:47,313 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 273 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:47,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 410 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-10 23:40:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 17111. [2024-10-10 23:40:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17111 states, 17110 states have (on average 1.0328462887200467) internal successors, (17672), 17110 states have internal predecessors, (17672), 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-10-10 23:40:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 17672 transitions. [2024-10-10 23:40:47,450 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 17672 transitions. Word has length 1207 [2024-10-10 23:40:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:47,451 INFO L471 AbstractCegarLoop]: Abstraction has 17111 states and 17672 transitions. [2024-10-10 23:40:47,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-10-10 23:40:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 17672 transitions. [2024-10-10 23:40:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2024-10-10 23:40:47,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:47,469 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:47,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:40:47,470 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:47,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 223971990, now seen corresponding path program 1 times [2024-10-10 23:40:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:47,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593628179] [2024-10-10 23:40:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 2801 proven. 0 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-10-10 23:40:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593628179] [2024-10-10 23:40:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593628179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:48,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82676236] [2024-10-10 23:40:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:48,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:48,052 INFO L87 Difference]: Start difference. First operand 17111 states and 17672 transitions. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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-10-10 23:40:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:48,685 INFO L93 Difference]: Finished difference Result 33892 states and 35011 transitions. [2024-10-10 23:40:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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 1339 [2024-10-10 23:40:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:48,703 INFO L225 Difference]: With dead ends: 33892 [2024-10-10 23:40:48,703 INFO L226 Difference]: Without dead ends: 17111 [2024-10-10 23:40:48,714 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-10-10 23:40:48,714 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:48,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 418 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-10 23:40:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 16782. [2024-10-10 23:40:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.026637268339193) internal successors, (17228), 16781 states have internal predecessors, (17228), 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-10-10 23:40:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17228 transitions. [2024-10-10 23:40:48,855 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17228 transitions. Word has length 1339 [2024-10-10 23:40:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:48,855 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17228 transitions. [2024-10-10 23:40:48,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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-10-10 23:40:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17228 transitions. [2024-10-10 23:40:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2024-10-10 23:40:48,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:48,872 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 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, 1, 1] [2024-10-10 23:40:48,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:40:48,873 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:48,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash -329103036, now seen corresponding path program 1 times [2024-10-10 23:40:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:48,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427231026] [2024-10-10 23:40:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 2690 trivial. 0 not checked. [2024-10-10 23:40:50,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:50,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427231026] [2024-10-10 23:40:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427231026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:50,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:50,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100281182] [2024-10-10 23:40:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:50,143 INFO L87 Difference]: Start difference. First operand 16782 states and 17228 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-10-10 23:40:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:50,793 INFO L93 Difference]: Finished difference Result 32905 states and 33793 transitions. [2024-10-10 23:40:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:50,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 1349 [2024-10-10 23:40:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:50,809 INFO L225 Difference]: With dead ends: 32905 [2024-10-10 23:40:50,809 INFO L226 Difference]: Without dead ends: 16782 [2024-10-10 23:40:50,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:50,821 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 271 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:50,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 361 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-10 23:40:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16782. [2024-10-10 23:40:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.0228234312615458) internal successors, (17164), 16781 states have internal predecessors, (17164), 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-10-10 23:40:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17164 transitions. [2024-10-10 23:40:50,998 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17164 transitions. Word has length 1349 [2024-10-10 23:40:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:50,999 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17164 transitions. [2024-10-10 23:40:51,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-10-10 23:40:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17164 transitions. [2024-10-10 23:40:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1678 [2024-10-10 23:40:51,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:51,035 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:40:51,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:40:51,036 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash 874199182, now seen corresponding path program 1 times [2024-10-10 23:40:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235330089] [2024-10-10 23:40:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4653 backedges. 1863 proven. 32 refuted. 0 times theorem prover too weak. 2758 trivial. 0 not checked. [2024-10-10 23:40:52,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235330089] [2024-10-10 23:40:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235330089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430914873] [2024-10-10 23:40:52,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:52,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:52,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:52,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:40:52,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:40:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:52,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:40:52,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4653 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 4414 trivial. 0 not checked. [2024-10-10 23:40:52,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:40:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430914873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:52,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:40:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 23:40:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870828779] [2024-10-10 23:40:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:52,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:52,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:52,600 INFO L87 Difference]: Start difference. First operand 16782 states and 17164 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-10-10 23:40:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:53,203 INFO L93 Difference]: Finished difference Result 32903 states and 33664 transitions. [2024-10-10 23:40:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:53,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 1677 [2024-10-10 23:40:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:53,206 INFO L225 Difference]: With dead ends: 32903 [2024-10-10 23:40:53,206 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:40:53,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1681 GetRequests, 1677 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-10-10 23:40:53,216 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 315 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:53,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 48 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:40:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:40:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:40:53,217 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-10-10 23:40:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:40:53,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1677 [2024-10-10 23:40:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:53,218 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:40:53,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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-10-10 23:40:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:40:53,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:40:53,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:40:53,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:40:53,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:53,424 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] [2024-10-10 23:40:53,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:40:54,257 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:40:54,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:40:54 BoogieIcfgContainer [2024-10-10 23:40:54,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:40:54,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:40:54,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:40:54,285 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:40:54,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:23" (3/4) ... [2024-10-10 23:40:54,287 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:40:54,310 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:40:54,312 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:40:54,313 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:40:54,314 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:40:54,493 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:40:54,493 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:40:54,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:40:54,494 INFO L158 Benchmark]: Toolchain (without parser) took 33851.89ms. Allocated memory was 163.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 130.3MB in the beginning and 678.4MB in the end (delta: -548.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-10 23:40:54,494 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:40:54,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.08ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 66.5MB in the end (delta: 63.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-10 23:40:54,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.70ms. Allocated memory is still 163.6MB. Free memory was 66.5MB in the beginning and 109.1MB in the end (delta: -42.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-10-10 23:40:54,495 INFO L158 Benchmark]: Boogie Preprocessor took 169.01ms. Allocated memory is still 163.6MB. Free memory was 109.1MB in the beginning and 74.3MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-10 23:40:54,495 INFO L158 Benchmark]: RCFGBuilder took 1795.47ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 74.3MB in the beginning and 132.2MB in the end (delta: -57.9MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-10-10 23:40:54,495 INFO L158 Benchmark]: TraceAbstraction took 30862.38ms. Allocated memory was 243.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 131.2MB in the beginning and 704.6MB in the end (delta: -573.4MB). Peak memory consumption was 916.6MB. Max. memory is 16.1GB. [2024-10-10 23:40:54,495 INFO L158 Benchmark]: Witness Printer took 208.66ms. Allocated memory is still 1.7GB. Free memory was 704.6MB in the beginning and 678.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:40:54,496 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.17ms. Allocated memory is still 163.6MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.08ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 66.5MB in the end (delta: 63.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.70ms. Allocated memory is still 163.6MB. Free memory was 66.5MB in the beginning and 109.1MB in the end (delta: -42.6MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 169.01ms. Allocated memory is still 163.6MB. Free memory was 109.1MB in the beginning and 74.3MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1795.47ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 74.3MB in the beginning and 132.2MB in the end (delta: -57.9MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30862.38ms. Allocated memory was 243.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 131.2MB in the beginning and 704.6MB in the end (delta: -573.4MB). Peak memory consumption was 916.6MB. Max. memory is 16.1GB. * Witness Printer took 208.66ms. Allocated memory is still 1.7GB. Free memory was 704.6MB in the beginning and 678.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 113]: 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, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.9s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4650 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4650 mSDsluCounter, 4979 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 2777 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17388 IncrementalHoareTripleChecker+Invalid, 20165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2777 mSolverCounterUnsat, 4818 mSDtfsCounter, 17388 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2109 GetRequests, 2078 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17111occurred in iteration=14, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 3290 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 14562 NumberOfCodeBlocks, 14562 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 14541 ConstructedInterpolants, 0 QuantifiedInterpolants, 28875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2377 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 29798/29866 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: 1783]: Loop Invariant Derived loop invariant: (((((((((((((((((((a16 == 9) && (7 == a12)) || (((a16 == 8) && (a15 != 3)) && (7 == a12))) || ((a12 == 9) && (a16 == 9))) || (((a16 == 8) && (a15 <= 3)) && (((long long) 87 + a18) <= 0))) || (((0 <= ((long long) 87 + a18)) && (a16 == 9)) && (a15 <= 3))) || (((5 != a12) && (a12 <= 6)) && (a16 <= 11))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (5 != a12)) && (a12 <= 6))) || (((a12 == 9) && (a15 <= 3)) && (((long long) 87 + a18) <= 0))) || (((5 == a12) && (a15 == 3)) && (11 <= a16))) || ((a16 == 9) && (5 == a12))) || ((a16 == 9) && (a12 == 8))) || ((a16 == 8) && (a12 == 8))) || ((a15 <= 3) && (a12 == 8))) || ((a12 == 9) && (a16 == 8))) || (((a15 <= 3) && (11 <= a16)) && (7 == a12))) || (((a12 <= 5) && (a15 != 3)) && (a16 <= 11))) || (((0 <= ((long long) 87 + a18)) && (a12 <= 6)) && (a15 == 3))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:40:54,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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