./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/Problem02_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label49.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72620f06cf213625543d30e414a89c2b8e83a12871b1ae1124ef85c707116f4d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:44:56,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:44:56,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:44:56,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:44:56,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:44:56,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:44:56,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:44:56,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:44:56,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:44:56,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:44:56,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:44:56,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:44:56,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:44:56,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:44:56,376 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:44:56,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:44:56,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:44:56,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:44:56,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:44:56,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:44:56,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:44:56,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:44:56,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:44:56,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:44:56,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:44:56,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:44:56,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:44:56,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:44:56,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:44:56,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:44:56,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:44:56,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:44:56,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:44:56,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:44:56,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:44:56,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:44:56,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:44:56,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:44:56,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:44:56,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:44:56,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:44:56,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:44:56,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72620f06cf213625543d30e414a89c2b8e83a12871b1ae1124ef85c707116f4d [2024-10-13 22:44:56,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:44:56,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:44:56,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:44:56,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:44:56,682 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:44:56,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2024-10-13 22:44:58,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:44:58,464 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:44:58,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2024-10-13 22:44:58,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2e3f51c/8c865cdf1be9434f92799b8279078c92/FLAG30416c481 [2024-10-13 22:44:58,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2e3f51c/8c865cdf1be9434f92799b8279078c92 [2024-10-13 22:44:58,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:44:58,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:44:58,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:44:58,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:44:58,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:44:58,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:44:58" (1/1) ... [2024-10-13 22:44:58,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e646234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:58, skipping insertion in model container [2024-10-13 22:44:58,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:44:58" (1/1) ... [2024-10-13 22:44:58,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:44:58,965 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/Problem02_label49.c[19626,19639] [2024-10-13 22:44:59,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:44:59,012 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:44:59,078 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/Problem02_label49.c[19626,19639] [2024-10-13 22:44:59,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:44:59,103 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:44:59,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59 WrapperNode [2024-10-13 22:44:59,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:44:59,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:44:59,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:44:59,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:44:59,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,172 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-13 22:44:59,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:44:59,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:44:59,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:44:59,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:44:59,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,223 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 22:44:59,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:44:59,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:44:59,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:44:59,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:44:59,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (1/1) ... [2024-10-13 22:44:59,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:44:59,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:44:59,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 22:44:59,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 22:44:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:44:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:44:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:44:59,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:44:59,454 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:44:59,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:45:00,504 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-13 22:45:00,504 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:45:00,572 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:45:00,575 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:45:00,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:00 BoogieIcfgContainer [2024-10-13 22:45:00,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:45:00,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:45:00,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:45:00,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:45:00,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:44:58" (1/3) ... [2024-10-13 22:45:00,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542f8878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:00, skipping insertion in model container [2024-10-13 22:45:00,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:59" (2/3) ... [2024-10-13 22:45:00,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542f8878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:00, skipping insertion in model container [2024-10-13 22:45:00,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:00" (3/3) ... [2024-10-13 22:45:00,584 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2024-10-13 22:45:00,598 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:45:00,598 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:45:00,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:45:00,673 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;@1802d316, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:45:00,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:45:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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-13 22:45:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 22:45:00,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:00,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:45:00,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:00,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 10423311, now seen corresponding path program 1 times [2024-10-13 22:45:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559138271] [2024-10-13 22:45:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:01,059 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-13 22:45:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559138271] [2024-10-13 22:45:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559138271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:01,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:01,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:45:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085102350] [2024-10-13 22:45:01,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:01,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:45:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:45:01,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:45:01,099 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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 62.0) internal successors, (124), 2 states have internal predecessors, (124), 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-13 22:45:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:01,132 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-13 22:45:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:45:01,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-10-13 22:45:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:01,144 INFO L225 Difference]: With dead ends: 329 [2024-10-13 22:45:01,145 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 22:45:01,147 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-13 22:45:01,150 INFO L432 NwaCegarLoop]: 248 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, 248 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-13 22:45:01,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:45:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 22:45:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-13 22:45:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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-13 22:45:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-13 22:45:01,219 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 124 [2024-10-13 22:45:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:01,235 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-13 22:45:01,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 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-13 22:45:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-13 22:45:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 22:45:01,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:01,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:45:01,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:45:01,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -157440126, now seen corresponding path program 1 times [2024-10-13 22:45:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771442481] [2024-10-13 22:45:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:01,555 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-13 22:45:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771442481] [2024-10-13 22:45:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771442481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:45:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644097264] [2024-10-13 22:45:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:01,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:01,561 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-13 22:45:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:02,145 INFO L93 Difference]: Finished difference Result 479 states and 731 transitions. [2024-10-13 22:45:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-10-13 22:45:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:02,149 INFO L225 Difference]: With dead ends: 479 [2024-10-13 22:45:02,149 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 22:45:02,150 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-13 22:45:02,155 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:02,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 72 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 22:45:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 22:45:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-13 22:45:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4746835443037976) internal successors, (466), 316 states have internal predecessors, (466), 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-13 22:45:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 466 transitions. [2024-10-13 22:45:02,185 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 466 transitions. Word has length 124 [2024-10-13 22:45:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:02,186 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 466 transitions. [2024-10-13 22:45:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-13 22:45:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 466 transitions. [2024-10-13 22:45:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 22:45:02,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:02,190 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:45:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:45:02,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:02,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash 940917879, now seen corresponding path program 1 times [2024-10-13 22:45:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420215682] [2024-10-13 22:45:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:45:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420215682] [2024-10-13 22:45:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420215682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:45:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368328243] [2024-10-13 22:45:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:02,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:02,578 INFO L87 Difference]: Start difference. First operand 317 states and 466 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-13 22:45:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:03,050 INFO L93 Difference]: Finished difference Result 918 states and 1356 transitions. [2024-10-13 22:45:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:03,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 128 [2024-10-13 22:45:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:03,054 INFO L225 Difference]: With dead ends: 918 [2024-10-13 22:45:03,054 INFO L226 Difference]: Without dead ends: 602 [2024-10-13 22:45:03,055 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-13 22:45:03,056 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 144 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:03,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:45:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-10-13 22:45:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2024-10-13 22:45:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.2938230383973288) internal successors, (775), 599 states have internal predecessors, (775), 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-13 22:45:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 775 transitions. [2024-10-13 22:45:03,087 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 775 transitions. Word has length 128 [2024-10-13 22:45:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 775 transitions. [2024-10-13 22:45:03,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-13 22:45:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 775 transitions. [2024-10-13 22:45:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 22:45:03,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:03,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-13 22:45:03,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:45:03,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:03,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash -875213346, now seen corresponding path program 1 times [2024-10-13 22:45:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230465624] [2024-10-13 22:45:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:45:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230465624] [2024-10-13 22:45:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230465624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:03,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:45:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011888027] [2024-10-13 22:45:03,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:03,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:03,318 INFO L87 Difference]: Start difference. First operand 600 states and 775 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:45:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:03,784 INFO L93 Difference]: Finished difference Result 1485 states and 1975 transitions. [2024-10-13 22:45:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-13 22:45:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:03,788 INFO L225 Difference]: With dead ends: 1485 [2024-10-13 22:45:03,788 INFO L226 Difference]: Without dead ends: 886 [2024-10-13 22:45:03,790 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-13 22:45:03,791 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 144 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:03,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 252 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:45:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-13 22:45:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2024-10-13 22:45:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.233295583238958) internal successors, (1089), 883 states have internal predecessors, (1089), 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-13 22:45:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1089 transitions. [2024-10-13 22:45:03,815 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1089 transitions. Word has length 133 [2024-10-13 22:45:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:03,816 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1089 transitions. [2024-10-13 22:45:03,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:45:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1089 transitions. [2024-10-13 22:45:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 22:45:03,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:03,819 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:45:03,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:45:03,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash -201049402, now seen corresponding path program 1 times [2024-10-13 22:45:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:03,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959761197] [2024-10-13 22:45:03,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:45:03,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959761197] [2024-10-13 22:45:03,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959761197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:03,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:03,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:45:03,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110627418] [2024-10-13 22:45:03,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:03,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:03,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:03,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:03,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:03,920 INFO L87 Difference]: Start difference. First operand 884 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-13 22:45:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:04,354 INFO L93 Difference]: Finished difference Result 2468 states and 3054 transitions. [2024-10-13 22:45:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:04,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 134 [2024-10-13 22:45:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:04,360 INFO L225 Difference]: With dead ends: 2468 [2024-10-13 22:45:04,360 INFO L226 Difference]: Without dead ends: 1585 [2024-10-13 22:45:04,362 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-13 22:45:04,363 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 188 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:04,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 79 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:45:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-10-13 22:45:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2024-10-13 22:45:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1584 states have (on average 1.1950757575757576) internal successors, (1893), 1584 states have internal predecessors, (1893), 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-13 22:45:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 1893 transitions. [2024-10-13 22:45:04,391 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 1893 transitions. Word has length 134 [2024-10-13 22:45:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:04,392 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 1893 transitions. [2024-10-13 22:45:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-13 22:45:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1893 transitions. [2024-10-13 22:45:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 22:45:04,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:04,396 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:45:04,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:45:04,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1551677335, now seen corresponding path program 1 times [2024-10-13 22:45:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054002068] [2024-10-13 22:45:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:45:04,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:04,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054002068] [2024-10-13 22:45:04,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054002068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:04,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:04,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:45:04,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40182279] [2024-10-13 22:45:04,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:04,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:04,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:04,500 INFO L87 Difference]: Start difference. First operand 1585 states and 1893 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-13 22:45:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:05,018 INFO L93 Difference]: Finished difference Result 3730 states and 4452 transitions. [2024-10-13 22:45:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:05,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-10-13 22:45:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:05,027 INFO L225 Difference]: With dead ends: 3730 [2024-10-13 22:45:05,028 INFO L226 Difference]: Without dead ends: 2146 [2024-10-13 22:45:05,030 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-13 22:45:05,031 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:05,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 65 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:45:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2024-10-13 22:45:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2145. [2024-10-13 22:45:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.1674440298507462) internal successors, (2503), 2144 states have internal predecessors, (2503), 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-13 22:45:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2503 transitions. [2024-10-13 22:45:05,077 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2503 transitions. Word has length 153 [2024-10-13 22:45:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:05,078 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 2503 transitions. [2024-10-13 22:45:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-13 22:45:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2503 transitions. [2024-10-13 22:45:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 22:45:05,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:05,083 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:45:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:45:05,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1740808033, now seen corresponding path program 1 times [2024-10-13 22:45:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4580496] [2024-10-13 22:45:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:45:05,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4580496] [2024-10-13 22:45:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4580496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:05,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:05,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:45:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110415313] [2024-10-13 22:45:05,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:05,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:05,182 INFO L87 Difference]: Start difference. First operand 2145 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-13 22:45:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:05,612 INFO L93 Difference]: Finished difference Result 4862 states and 5768 transitions. [2024-10-13 22:45:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 157 [2024-10-13 22:45:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:05,621 INFO L225 Difference]: With dead ends: 4862 [2024-10-13 22:45:05,622 INFO L226 Difference]: Without dead ends: 2718 [2024-10-13 22:45:05,625 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-13 22:45:05,629 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 145 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:05,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 253 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:45:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2024-10-13 22:45:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2709. [2024-10-13 22:45:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2708 states have (on average 1.1624815361890695) internal successors, (3148), 2708 states have internal predecessors, (3148), 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-13 22:45:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 3148 transitions. [2024-10-13 22:45:05,694 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 3148 transitions. Word has length 157 [2024-10-13 22:45:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:05,694 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 3148 transitions. [2024-10-13 22:45:05,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-13 22:45:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3148 transitions. [2024-10-13 22:45:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 22:45:05,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:05,700 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:45:05,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:45:05,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:05,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash -662687254, now seen corresponding path program 1 times [2024-10-13 22:45:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412879931] [2024-10-13 22:45:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 22:45:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412879931] [2024-10-13 22:45:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412879931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:05,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:05,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:45:05,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607278396] [2024-10-13 22:45:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:05,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:05,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:05,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:05,859 INFO L87 Difference]: Start difference. First operand 2709 states and 3148 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-13 22:45:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:06,295 INFO L93 Difference]: Finished difference Result 5418 states and 6297 transitions. [2024-10-13 22:45:06,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:06,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 169 [2024-10-13 22:45:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:06,304 INFO L225 Difference]: With dead ends: 5418 [2024-10-13 22:45:06,305 INFO L226 Difference]: Without dead ends: 2710 [2024-10-13 22:45:06,308 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-13 22:45:06,309 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:06,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 262 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:45:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2024-10-13 22:45:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2709. [2024-10-13 22:45:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2708 states have (on average 1.1421713441654358) internal successors, (3093), 2708 states have internal predecessors, (3093), 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-13 22:45:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 3093 transitions. [2024-10-13 22:45:06,386 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 3093 transitions. Word has length 169 [2024-10-13 22:45:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:06,387 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 3093 transitions. [2024-10-13 22:45:06,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-13 22:45:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3093 transitions. [2024-10-13 22:45:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 22:45:06,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:06,392 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-13 22:45:06,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:45:06,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:06,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash 120374198, now seen corresponding path program 1 times [2024-10-13 22:45:06,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:06,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696048064] [2024-10-13 22:45:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 22:45:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696048064] [2024-10-13 22:45:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696048064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:06,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:45:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074269293] [2024-10-13 22:45:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:06,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:06,497 INFO L87 Difference]: Start difference. First operand 2709 states and 3093 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-13 22:45:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:06,924 INFO L93 Difference]: Finished difference Result 5119 states and 5866 transitions. [2024-10-13 22:45:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:06,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-13 22:45:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:06,935 INFO L225 Difference]: With dead ends: 5119 [2024-10-13 22:45:06,935 INFO L226 Difference]: Without dead ends: 1989 [2024-10-13 22:45:06,939 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-13 22:45:06,940 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 126 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:06,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 252 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:45:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-10-13 22:45:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2024-10-13 22:45:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1988 states have (on average 1.1081488933601609) internal successors, (2203), 1988 states have internal predecessors, (2203), 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-13 22:45:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2203 transitions. [2024-10-13 22:45:06,977 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2203 transitions. Word has length 190 [2024-10-13 22:45:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:06,978 INFO L471 AbstractCegarLoop]: Abstraction has 1989 states and 2203 transitions. [2024-10-13 22:45:06,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-13 22:45:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2203 transitions. [2024-10-13 22:45:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 22:45:06,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:06,982 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-13 22:45:06,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:45:06,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash -199200315, now seen corresponding path program 1 times [2024-10-13 22:45:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651649744] [2024-10-13 22:45:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:45:07,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651649744] [2024-10-13 22:45:07,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651649744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:07,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:07,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:45:07,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361797181] [2024-10-13 22:45:07,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:07,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:07,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:07,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:07,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:07,119 INFO L87 Difference]: Start difference. First operand 1989 states and 2203 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-13 22:45:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:07,559 INFO L93 Difference]: Finished difference Result 4819 states and 5397 transitions. [2024-10-13 22:45:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:07,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 196 [2024-10-13 22:45:07,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:07,570 INFO L225 Difference]: With dead ends: 4819 [2024-10-13 22:45:07,570 INFO L226 Difference]: Without dead ends: 2831 [2024-10-13 22:45:07,573 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-13 22:45:07,574 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:07,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 205 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:45:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2024-10-13 22:45:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2550. [2024-10-13 22:45:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2549 states have (on average 1.1153393487642214) internal successors, (2843), 2549 states have internal predecessors, (2843), 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-13 22:45:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 2843 transitions. [2024-10-13 22:45:07,621 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 2843 transitions. Word has length 196 [2024-10-13 22:45:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 2843 transitions. [2024-10-13 22:45:07,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-13 22:45:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 2843 transitions. [2024-10-13 22:45:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 22:45:07,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:07,627 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-10-13 22:45:07,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 22:45:07,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash -958904427, now seen corresponding path program 1 times [2024-10-13 22:45:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:07,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211786675] [2024-10-13 22:45:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-13 22:45:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211786675] [2024-10-13 22:45:07,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211786675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:07,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:07,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:45:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023051032] [2024-10-13 22:45:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:07,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:07,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:07,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:07,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:45:07,788 INFO L87 Difference]: Start difference. First operand 2550 states and 2843 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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-13 22:45:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:08,031 INFO L93 Difference]: Finished difference Result 4386 states and 4906 transitions. [2024-10-13 22:45:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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 207 [2024-10-13 22:45:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:08,037 INFO L225 Difference]: With dead ends: 4386 [2024-10-13 22:45:08,037 INFO L226 Difference]: Without dead ends: 1132 [2024-10-13 22:45:08,041 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-13 22:45:08,042 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:08,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 17 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:45:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-13 22:45:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2024-10-13 22:45:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.063660477453581) internal successors, (1203), 1131 states have internal predecessors, (1203), 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-13 22:45:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1203 transitions. [2024-10-13 22:45:08,068 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1203 transitions. Word has length 207 [2024-10-13 22:45:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:08,068 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1203 transitions. [2024-10-13 22:45:08,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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-13 22:45:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1203 transitions. [2024-10-13 22:45:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-13 22:45:08,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:08,072 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-13 22:45:08,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 22:45:08,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:08,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1106241195, now seen corresponding path program 1 times [2024-10-13 22:45:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373242462] [2024-10-13 22:45:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:45:08,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:08,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373242462] [2024-10-13 22:45:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373242462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:45:08,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:45:08,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725056606] [2024-10-13 22:45:08,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:08,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:45:08,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:45:08,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:45:08,284 INFO L87 Difference]: Start difference. First operand 1132 states and 1203 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-13 22:45:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:08,817 INFO L93 Difference]: Finished difference Result 2125 states and 2266 transitions. [2024-10-13 22:45:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:45:08,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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 222 [2024-10-13 22:45:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:08,821 INFO L225 Difference]: With dead ends: 2125 [2024-10-13 22:45:08,821 INFO L226 Difference]: Without dead ends: 1134 [2024-10-13 22:45:08,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:45:08,823 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 254 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:08,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 210 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:45:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-10-13 22:45:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1132. [2024-10-13 22:45:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.0610079575596818) internal successors, (1200), 1131 states have internal predecessors, (1200), 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-13 22:45:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1200 transitions. [2024-10-13 22:45:08,840 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1200 transitions. Word has length 222 [2024-10-13 22:45:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:08,840 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1200 transitions. [2024-10-13 22:45:08,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-13 22:45:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1200 transitions. [2024-10-13 22:45:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-13 22:45:08,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:45:08,844 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2024-10-13 22:45:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 22:45:08,845 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:45:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:45:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1155705411, now seen corresponding path program 1 times [2024-10-13 22:45:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:45:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139586326] [2024-10-13 22:45:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:45:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:45:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:45:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139586326] [2024-10-13 22:45:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139586326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:45:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162905701] [2024-10-13 22:45:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:45:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:45:09,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:45:09,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:45:09,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 22:45:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:45:09,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:45:09,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:45:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 22:45:09,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:45:09,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162905701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:45:09,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:45:09,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 22:45:09,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832583940] [2024-10-13 22:45:09,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:45:09,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:45:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:45:09,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:45:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:45:09,661 INFO L87 Difference]: Start difference. First operand 1132 states and 1200 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-13 22:45:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:45:09,983 INFO L93 Difference]: Finished difference Result 2123 states and 2259 transitions. [2024-10-13 22:45:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:45:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 254 [2024-10-13 22:45:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:45:09,985 INFO L225 Difference]: With dead ends: 2123 [2024-10-13 22:45:09,985 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 22:45:09,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:45:09,988 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:45:09,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 50 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:45:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 22:45:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 22:45:09,989 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-13 22:45:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 22:45:09,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2024-10-13 22:45:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:45:09,990 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 22:45:09,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-13 22:45:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 22:45:09,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 22:45:09,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:45:10,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 22:45:10,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 22:45:10,198 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:45:10,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 22:45:10,414 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:45:10,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:45:10 BoogieIcfgContainer [2024-10-13 22:45:10,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:45:10,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:45:10,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:45:10,440 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:45:10,440 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:00" (3/4) ... [2024-10-13 22:45:10,442 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 22:45:10,463 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 22:45:10,464 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 22:45:10,465 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 22:45:10,466 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 22:45:10,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:45:10,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 22:45:10,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:45:10,613 INFO L158 Benchmark]: Toolchain (without parser) took 12110.99ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 97.9MB in the beginning and 207.3MB in the end (delta: -109.4MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-10-13 22:45:10,613 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:45:10,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.45ms. Allocated memory is still 157.3MB. Free memory was 97.2MB in the beginning and 110.0MB in the end (delta: -12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:45:10,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.82ms. Allocated memory is still 157.3MB. Free memory was 110.0MB in the beginning and 104.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:45:10,614 INFO L158 Benchmark]: Boogie Preprocessor took 113.07ms. Allocated memory is still 157.3MB. Free memory was 104.4MB in the beginning and 99.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 22:45:10,615 INFO L158 Benchmark]: RCFGBuilder took 1288.22ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 99.5MB in the beginning and 117.7MB in the end (delta: -18.1MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-10-13 22:45:10,615 INFO L158 Benchmark]: TraceAbstraction took 9860.91ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 116.6MB in the beginning and 219.9MB in the end (delta: -103.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:45:10,615 INFO L158 Benchmark]: Witness Printer took 174.13ms. Allocated memory is still 293.6MB. Free memory was 219.9MB in the beginning and 207.3MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 22:45:10,616 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.15ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.45ms. Allocated memory is still 157.3MB. Free memory was 97.2MB in the beginning and 110.0MB in the end (delta: -12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.82ms. Allocated memory is still 157.3MB. Free memory was 110.0MB in the beginning and 104.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.07ms. Allocated memory is still 157.3MB. Free memory was 104.4MB in the beginning and 99.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1288.22ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 99.5MB in the beginning and 117.7MB in the end (delta: -18.1MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9860.91ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 116.6MB in the beginning and 219.9MB in the end (delta: -103.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 174.13ms. Allocated memory is still 293.6MB. Free memory was 219.9MB in the beginning and 207.3MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. 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: 557]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1725 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1725 mSDsluCounter, 2084 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4348 IncrementalHoareTripleChecker+Invalid, 5028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 1895 mSDtfsCounter, 4348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2709occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 298 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2445 NumberOfCodeBlocks, 2445 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2431 ConstructedInterpolants, 0 QuantifiedInterpolants, 5969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 988/1089 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: 616]: Loop Invariant Derived loop invariant: (((((((((((((a25 == 1) && (a11 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7)) || ((((((9 <= a28) && (a11 == 1)) && (a28 <= 10)) && (a19 == 1)) || ((((9 <= a28) && (a25 == 1)) && (a11 == 1)) && (a28 <= 10))) && (a17 <= 8))) || (((a11 == 1) && (a28 == 10)) && (a25 != 1))) || ((((a28 == 10) && (a11 == 0)) && (a17 <= 8)) && (a19 == 1))) || ((((a25 == 1) && (a11 == 0)) && (a17 <= 8)) && (a28 <= 10))) || ((((a11 == 1) && (a17 <= 8)) && (a28 <= 10)) && (a25 <= 0))) || ((((11 <= a28) && (a11 == 1)) && (a25 != 1)) && (a19 == 1))) || ((((a11 == 0) && (a17 <= 8)) && (a28 <= 10)) && (a25 <= 0))) || ((((a25 == 1) && (a11 == 0)) && (a17 <= 8)) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 22:45:10,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE