./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/Problem11_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.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 f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:59:49,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:59:49,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:59:49,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:59:49,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:59:49,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:59:49,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:59:49,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:59:49,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:59:49,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:59:49,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:59:49,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:59:49,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:59:49,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:59:49,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:59:49,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:59:49,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:59:49,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:59:49,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:59:49,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:59:49,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:59:49,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:59:49,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:59:49,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:59:49,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:59:49,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:59:49,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:59:49,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:59:49,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:59:49,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:59:49,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:59:49,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:59:49,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:59:49,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:59:49,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:59:49,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:59:49,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:59:49,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:59:49,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:59:49,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:59:49,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:59:49,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:59:49,705 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 -> f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 [2024-10-12 15:59:49,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:59:49,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:59:49,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:59:49,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:59:49,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:59:49,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2024-10-12 15:59:51,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:59:51,373 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:59:51,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2024-10-12 15:59:51,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3b97854/9a02467b2cd94b40b2d31946119d8386/FLAGde35dea81 [2024-10-12 15:59:51,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3b97854/9a02467b2cd94b40b2d31946119d8386 [2024-10-12 15:59:51,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:59:51,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:59:51,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:59:51,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:59:51,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:59:51,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:51,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9dd3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51, skipping insertion in model container [2024-10-12 15:59:51,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:51,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:59:51,657 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/Problem11_label26.c[5699,5712] [2024-10-12 15:59:51,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:59:51,833 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:59:51,852 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/Problem11_label26.c[5699,5712] [2024-10-12 15:59:51,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:59:51,946 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:59:51,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51 WrapperNode [2024-10-12 15:59:51,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:59:51,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:59:51,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:59:51,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:59:51,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:51,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,032 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-12 15:59:52,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:59:52,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:59:52,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:59:52,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:59:52,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,138 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-12 15:59:52,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:59:52,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:59:52,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:59:52,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:59:52,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (1/1) ... [2024-10-12 15:59:52,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:59:52,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:52,277 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-12 15:59:52,280 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-12 15:59:52,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:59:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:59:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:59:52,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:59:52,373 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:59:52,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:59:53,510 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-12 15:59:53,511 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:59:53,560 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:59:53,561 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:59:53,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:59:53 BoogieIcfgContainer [2024-10-12 15:59:53,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:59:53,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:59:53,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:59:53,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:59:53,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:59:51" (1/3) ... [2024-10-12 15:59:53,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b7e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:59:53, skipping insertion in model container [2024-10-12 15:59:53,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:51" (2/3) ... [2024-10-12 15:59:53,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b7e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:59:53, skipping insertion in model container [2024-10-12 15:59:53,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:59:53" (3/3) ... [2024-10-12 15:59:53,570 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label26.c [2024-10-12 15:59:53,585 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:59:53,586 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:59:53,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:59:53,650 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;@685b61f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:59:53,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:59:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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-12 15:59:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:59:53,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:53,666 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] [2024-10-12 15:59:53,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -248824699, now seen corresponding path program 1 times [2024-10-12 15:59:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:53,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064972109] [2024-10-12 15:59:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:53,838 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-12 15:59:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064972109] [2024-10-12 15:59:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064972109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:53,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331461643] [2024-10-12 15:59:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:53,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:59:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:59:53,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:59:53,862 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-12 15:59:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:53,905 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-12 15:59:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:59:53,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 38 [2024-10-12 15:59:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:53,917 INFO L225 Difference]: With dead ends: 441 [2024-10-12 15:59:53,917 INFO L226 Difference]: Without dead ends: 219 [2024-10-12 15:59:53,920 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-12 15:59:53,922 INFO L432 NwaCegarLoop]: 355 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, 355 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-12 15:59:53,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:59:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-12 15:59:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-12 15:59:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 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-12 15:59:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-12 15:59:53,959 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 38 [2024-10-12 15:59:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:53,959 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-12 15:59:53,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-12 15:59:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-12 15:59:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 15:59:53,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:53,960 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] [2024-10-12 15:59:53,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:59:53,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:53,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash 568008558, now seen corresponding path program 1 times [2024-10-12 15:59:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:53,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423971732] [2024-10-12 15:59:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:54,117 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-12 15:59:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423971732] [2024-10-12 15:59:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423971732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:54,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814752476] [2024-10-12 15:59:54,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:54,120 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-12 15:59:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:54,810 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2024-10-12 15:59:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:54,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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 38 [2024-10-12 15:59:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:54,814 INFO L225 Difference]: With dead ends: 630 [2024-10-12 15:59:54,814 INFO L226 Difference]: Without dead ends: 412 [2024-10-12 15:59:54,814 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-12 15:59:54,815 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 169 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:54,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-12 15:59:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-10-12 15:59:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 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-12 15:59:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2024-10-12 15:59:54,841 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 38 [2024-10-12 15:59:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:54,844 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2024-10-12 15:59:54,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-12 15:59:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2024-10-12 15:59:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 15:59:54,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:54,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:59:54,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:59:54,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:54,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash 413753813, now seen corresponding path program 1 times [2024-10-12 15:59:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:54,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437465706] [2024-10-12 15:59:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:55,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437465706] [2024-10-12 15:59:55,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437465706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:55,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60120978] [2024-10-12 15:59:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:55,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:55,032 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-12 15:59:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:55,634 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2024-10-12 15:59:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:55,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2024-10-12 15:59:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:55,637 INFO L225 Difference]: With dead ends: 1208 [2024-10-12 15:59:55,637 INFO L226 Difference]: Without dead ends: 799 [2024-10-12 15:59:55,638 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-12 15:59:55,639 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:55,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-12 15:59:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2024-10-12 15:59:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3847133757961783) internal successors, (1087), 785 states have internal predecessors, (1087), 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-12 15:59:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1087 transitions. [2024-10-12 15:59:55,666 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1087 transitions. Word has length 106 [2024-10-12 15:59:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:55,667 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1087 transitions. [2024-10-12 15:59:55,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-12 15:59:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1087 transitions. [2024-10-12 15:59:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 15:59:55,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:55,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:59:55,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:59:55,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:55,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash -426164518, now seen corresponding path program 1 times [2024-10-12 15:59:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:55,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772240451] [2024-10-12 15:59:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:55,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772240451] [2024-10-12 15:59:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772240451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:55,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388325595] [2024-10-12 15:59:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:55,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:55,942 INFO L87 Difference]: Start difference. First operand 786 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-12 15:59:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:56,479 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2024-10-12 15:59:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 108 [2024-10-12 15:59:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:56,484 INFO L225 Difference]: With dead ends: 1941 [2024-10-12 15:59:56,484 INFO L226 Difference]: Without dead ends: 1156 [2024-10-12 15:59:56,485 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-12 15:59:56,488 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:56,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:59:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-12 15:59:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2024-10-12 15:59:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2772963604852687) internal successors, (1474), 1154 states have internal predecessors, (1474), 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-12 15:59:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1474 transitions. [2024-10-12 15:59:56,515 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1474 transitions. Word has length 108 [2024-10-12 15:59:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:56,516 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1474 transitions. [2024-10-12 15:59:56,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-12 15:59:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1474 transitions. [2024-10-12 15:59:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 15:59:56,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:56,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:59:56,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:59:56,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:56,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2107943791, now seen corresponding path program 1 times [2024-10-12 15:59:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152076586] [2024-10-12 15:59:56,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 15:59:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152076586] [2024-10-12 15:59:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152076586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:56,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824536000] [2024-10-12 15:59:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:56,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:56,669 INFO L87 Difference]: Start difference. First operand 1155 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-12 15:59:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:57,276 INFO L93 Difference]: Finished difference Result 2501 states and 3335 transitions. [2024-10-12 15:59:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:57,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 150 [2024-10-12 15:59:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:57,283 INFO L225 Difference]: With dead ends: 2501 [2024-10-12 15:59:57,284 INFO L226 Difference]: Without dead ends: 1531 [2024-10-12 15:59:57,285 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-12 15:59:57,286 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:57,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 154 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-10-12 15:59:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-10-12 15:59:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.261437908496732) internal successors, (1930), 1530 states have internal predecessors, (1930), 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-12 15:59:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1930 transitions. [2024-10-12 15:59:57,308 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1930 transitions. Word has length 150 [2024-10-12 15:59:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:57,309 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1930 transitions. [2024-10-12 15:59:57,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-12 15:59:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1930 transitions. [2024-10-12 15:59:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-12 15:59:57,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:57,314 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:59:57,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:59:57,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:57,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash 458459296, now seen corresponding path program 1 times [2024-10-12 15:59:57,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:57,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278384916] [2024-10-12 15:59:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:57,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:57,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278384916] [2024-10-12 15:59:57,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278384916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:57,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:57,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34408519] [2024-10-12 15:59:57,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:57,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:57,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:57,480 INFO L87 Difference]: Start difference. First operand 1531 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-12 15:59:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:58,073 INFO L93 Difference]: Finished difference Result 3643 states and 4734 transitions. [2024-10-12 15:59:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:58,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 165 [2024-10-12 15:59:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:58,082 INFO L225 Difference]: With dead ends: 3643 [2024-10-12 15:59:58,082 INFO L226 Difference]: Without dead ends: 2297 [2024-10-12 15:59:58,084 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-12 15:59:58,086 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 196 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:58,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-10-12 15:59:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2294. [2024-10-12 15:59:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.2651548190143915) internal successors, (2901), 2293 states have internal predecessors, (2901), 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-12 15:59:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 2901 transitions. [2024-10-12 15:59:58,119 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 2901 transitions. Word has length 165 [2024-10-12 15:59:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:58,120 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 2901 transitions. [2024-10-12 15:59:58,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-12 15:59:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2901 transitions. [2024-10-12 15:59:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-12 15:59:58,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:58,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:59:58,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:59:58,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:58,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:58,123 INFO L85 PathProgramCache]: Analyzing trace with hash 36648381, now seen corresponding path program 1 times [2024-10-12 15:59:58,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:58,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945000363] [2024-10-12 15:59:58,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:58,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 15:59:58,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:58,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945000363] [2024-10-12 15:59:58,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945000363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:58,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:58,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582308042] [2024-10-12 15:59:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:58,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:58,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:58,346 INFO L87 Difference]: Start difference. First operand 2294 states and 2901 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 15:59:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:58,953 INFO L93 Difference]: Finished difference Result 5508 states and 7125 transitions. [2024-10-12 15:59:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 220 [2024-10-12 15:59:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:58,961 INFO L225 Difference]: With dead ends: 5508 [2024-10-12 15:59:58,961 INFO L226 Difference]: Without dead ends: 3399 [2024-10-12 15:59:58,963 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-12 15:59:58,964 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 168 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:58,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 344 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2024-10-12 15:59:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3399. [2024-10-12 15:59:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3398 states have (on average 1.235138316656857) internal successors, (4197), 3398 states have internal predecessors, (4197), 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-12 15:59:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4197 transitions. [2024-10-12 15:59:59,007 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4197 transitions. Word has length 220 [2024-10-12 15:59:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:59,008 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4197 transitions. [2024-10-12 15:59:59,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 15:59:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4197 transitions. [2024-10-12 15:59:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-12 15:59:59,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:59,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:59,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:59:59,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:59,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash -333697396, now seen corresponding path program 1 times [2024-10-12 15:59:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993068639] [2024-10-12 15:59:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 15:59:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993068639] [2024-10-12 15:59:59,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993068639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:59,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325934078] [2024-10-12 15:59:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:59,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:59,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:59,256 INFO L87 Difference]: Start difference. First operand 3399 states and 4197 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 15:59:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:59,876 INFO L93 Difference]: Finished difference Result 7912 states and 9908 transitions. [2024-10-12 15:59:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 226 [2024-10-12 15:59:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:59,887 INFO L225 Difference]: With dead ends: 7912 [2024-10-12 15:59:59,888 INFO L226 Difference]: Without dead ends: 4698 [2024-10-12 15:59:59,892 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-12 15:59:59,893 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:59,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 381 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2024-10-12 15:59:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 4688. [2024-10-12 15:59:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4687 states have (on average 1.2137828034990399) internal successors, (5689), 4687 states have internal predecessors, (5689), 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-12 15:59:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 5689 transitions. [2024-10-12 15:59:59,945 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 5689 transitions. Word has length 226 [2024-10-12 15:59:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:59,945 INFO L471 AbstractCegarLoop]: Abstraction has 4688 states and 5689 transitions. [2024-10-12 15:59:59,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-12 15:59:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 5689 transitions. [2024-10-12 15:59:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-12 15:59:59,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:59,950 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:59:59,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:59:59,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:59,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1743295370, now seen corresponding path program 1 times [2024-10-12 15:59:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661381270] [2024-10-12 15:59:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-12 16:00:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661381270] [2024-10-12 16:00:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661381270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310245202] [2024-10-12 16:00:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:00,180 INFO L87 Difference]: Start difference. First operand 4688 states and 5689 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-12 16:00:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:00,791 INFO L93 Difference]: Finished difference Result 10681 states and 13135 transitions. [2024-10-12 16:00:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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 297 [2024-10-12 16:00:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:00,808 INFO L225 Difference]: With dead ends: 10681 [2024-10-12 16:00:00,808 INFO L226 Difference]: Without dead ends: 6178 [2024-10-12 16:00:00,813 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-12 16:00:00,815 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 135 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:00,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 341 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2024-10-12 16:00:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 5977. [2024-10-12 16:00:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5976 states have (on average 1.2008032128514057) internal successors, (7176), 5976 states have internal predecessors, (7176), 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-12 16:00:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 7176 transitions. [2024-10-12 16:00:00,886 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 7176 transitions. Word has length 297 [2024-10-12 16:00:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:00,914 INFO L471 AbstractCegarLoop]: Abstraction has 5977 states and 7176 transitions. [2024-10-12 16:00:00,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-12 16:00:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 7176 transitions. [2024-10-12 16:00:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-10-12 16:00:00,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:00,923 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:00:00,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:00:00,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash -845415217, now seen corresponding path program 1 times [2024-10-12 16:00:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:00,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032865689] [2024-10-12 16:00:00,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 16:00:01,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:01,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032865689] [2024-10-12 16:00:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032865689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:01,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943511668] [2024-10-12 16:00:01,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:01,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:01,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:01,048 INFO L87 Difference]: Start difference. First operand 5977 states and 7176 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-12 16:00:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:01,601 INFO L93 Difference]: Finished difference Result 11738 states and 14075 transitions. [2024-10-12 16:00:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 300 [2024-10-12 16:00:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:01,614 INFO L225 Difference]: With dead ends: 11738 [2024-10-12 16:00:01,614 INFO L226 Difference]: Without dead ends: 5762 [2024-10-12 16:00:01,620 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-12 16:00:01,621 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 158 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:01,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 149 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:00:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2024-10-12 16:00:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5577. [2024-10-12 16:00:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5577 states, 5576 states have (on average 1.1468794835007174) internal successors, (6395), 5576 states have internal predecessors, (6395), 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-12 16:00:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5577 states to 5577 states and 6395 transitions. [2024-10-12 16:00:01,688 INFO L78 Accepts]: Start accepts. Automaton has 5577 states and 6395 transitions. Word has length 300 [2024-10-12 16:00:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:01,688 INFO L471 AbstractCegarLoop]: Abstraction has 5577 states and 6395 transitions. [2024-10-12 16:00:01,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-12 16:00:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5577 states and 6395 transitions. [2024-10-12 16:00:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-12 16:00:01,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:01,696 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:01,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:00:01,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:01,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1531645548, now seen corresponding path program 1 times [2024-10-12 16:00:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322426233] [2024-10-12 16:00:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-12 16:00:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322426233] [2024-10-12 16:00:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322426233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:00:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138102101] [2024-10-12 16:00:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:01,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:01,912 INFO L87 Difference]: Start difference. First operand 5577 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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-12 16:00:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:02,213 INFO L93 Difference]: Finished difference Result 11149 states and 12785 transitions. [2024-10-12 16:00:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 378 [2024-10-12 16:00:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:02,232 INFO L225 Difference]: With dead ends: 11149 [2024-10-12 16:00:02,233 INFO L226 Difference]: Without dead ends: 5573 [2024-10-12 16:00:02,242 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-12 16:00:02,242 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:02,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 37 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 16:00:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2024-10-12 16:00:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 5573. [2024-10-12 16:00:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 5572 states have (on average 1.146267049533381) internal successors, (6387), 5572 states have internal predecessors, (6387), 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-12 16:00:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 6387 transitions. [2024-10-12 16:00:02,351 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 6387 transitions. Word has length 378 [2024-10-12 16:00:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:02,352 INFO L471 AbstractCegarLoop]: Abstraction has 5573 states and 6387 transitions. [2024-10-12 16:00:02,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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-12 16:00:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 6387 transitions. [2024-10-12 16:00:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-10-12 16:00:02,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:02,365 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:02,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:00:02,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:02,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1924097945, now seen corresponding path program 1 times [2024-10-12 16:00:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569436238] [2024-10-12 16:00:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-12 16:00:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569436238] [2024-10-12 16:00:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569436238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450912803] [2024-10-12 16:00:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:02,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:02,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:02,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:02,639 INFO L87 Difference]: Start difference. First operand 5573 states and 6387 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-12 16:00:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:03,262 INFO L93 Difference]: Finished difference Result 12631 states and 14465 transitions. [2024-10-12 16:00:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:03,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 410 [2024-10-12 16:00:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:03,274 INFO L225 Difference]: With dead ends: 12631 [2024-10-12 16:00:03,276 INFO L226 Difference]: Without dead ends: 7059 [2024-10-12 16:00:03,280 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-12 16:00:03,281 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:03,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 177 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7059 states. [2024-10-12 16:00:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7059 to 6861. [2024-10-12 16:00:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6861 states, 6860 states have (on average 1.1380466472303208) internal successors, (7807), 6860 states have internal predecessors, (7807), 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-12 16:00:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6861 states to 6861 states and 7807 transitions. [2024-10-12 16:00:03,344 INFO L78 Accepts]: Start accepts. Automaton has 6861 states and 7807 transitions. Word has length 410 [2024-10-12 16:00:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:03,345 INFO L471 AbstractCegarLoop]: Abstraction has 6861 states and 7807 transitions. [2024-10-12 16:00:03,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-12 16:00:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6861 states and 7807 transitions. [2024-10-12 16:00:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-10-12 16:00:03,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:03,358 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:00:03,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:00:03,358 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:03,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1745926069, now seen corresponding path program 1 times [2024-10-12 16:00:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137520939] [2024-10-12 16:00:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-12 16:00:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137520939] [2024-10-12 16:00:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137520939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071211539] [2024-10-12 16:00:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:03,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:03,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:03,531 INFO L87 Difference]: Start difference. First operand 6861 states and 7807 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-12 16:00:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:04,158 INFO L93 Difference]: Finished difference Result 15928 states and 18168 transitions. [2024-10-12 16:00:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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 462 [2024-10-12 16:00:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:04,167 INFO L225 Difference]: With dead ends: 15928 [2024-10-12 16:00:04,167 INFO L226 Difference]: Without dead ends: 8516 [2024-10-12 16:00:04,173 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-12 16:00:04,173 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 64 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:04,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 348 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8516 states. [2024-10-12 16:00:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8516 to 8332. [2024-10-12 16:00:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8332 states, 8331 states have (on average 1.1331172728363943) internal successors, (9440), 8331 states have internal predecessors, (9440), 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-12 16:00:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8332 states to 8332 states and 9440 transitions. [2024-10-12 16:00:04,263 INFO L78 Accepts]: Start accepts. Automaton has 8332 states and 9440 transitions. Word has length 462 [2024-10-12 16:00:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:04,264 INFO L471 AbstractCegarLoop]: Abstraction has 8332 states and 9440 transitions. [2024-10-12 16:00:04,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-12 16:00:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 8332 states and 9440 transitions. [2024-10-12 16:00:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-12 16:00:04,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:04,275 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:00:04,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:00:04,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:04,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1644975805, now seen corresponding path program 1 times [2024-10-12 16:00:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512848674] [2024-10-12 16:00:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-12 16:00:04,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:04,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512848674] [2024-10-12 16:00:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512848674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:04,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:04,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:04,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568809306] [2024-10-12 16:00:04,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:04,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:04,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:04,586 INFO L87 Difference]: Start difference. First operand 8332 states and 9440 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-12 16:00:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:05,139 INFO L93 Difference]: Finished difference Result 19071 states and 21664 transitions. [2024-10-12 16:00:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 498 [2024-10-12 16:00:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:05,153 INFO L225 Difference]: With dead ends: 19071 [2024-10-12 16:00:05,153 INFO L226 Difference]: Without dead ends: 10740 [2024-10-12 16:00:05,161 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-12 16:00:05,161 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:05,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 132 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:00:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2024-10-12 16:00:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10552. [2024-10-12 16:00:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10552 states, 10551 states have (on average 1.1254857359491992) internal successors, (11875), 10551 states have internal predecessors, (11875), 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-12 16:00:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10552 states to 10552 states and 11875 transitions. [2024-10-12 16:00:05,263 INFO L78 Accepts]: Start accepts. Automaton has 10552 states and 11875 transitions. Word has length 498 [2024-10-12 16:00:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 10552 states and 11875 transitions. [2024-10-12 16:00:05,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-12 16:00:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 10552 states and 11875 transitions. [2024-10-12 16:00:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-10-12 16:00:05,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:05,276 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:05,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:00:05,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:05,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1805185773, now seen corresponding path program 1 times [2024-10-12 16:00:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:05,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762247309] [2024-10-12 16:00:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-12 16:00:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762247309] [2024-10-12 16:00:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762247309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:05,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552643671] [2024-10-12 16:00:05,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:05,719 INFO L87 Difference]: Start difference. First operand 10552 states and 11875 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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-12 16:00:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:06,367 INFO L93 Difference]: Finished difference Result 24418 states and 27483 transitions. [2024-10-12 16:00:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:06,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 502 [2024-10-12 16:00:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:06,383 INFO L225 Difference]: With dead ends: 24418 [2024-10-12 16:00:06,383 INFO L226 Difference]: Without dead ends: 13867 [2024-10-12 16:00:06,389 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-12 16:00:06,390 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 124 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:06,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 77 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13867 states. [2024-10-12 16:00:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13867 to 13120. [2024-10-12 16:00:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13120 states, 13119 states have (on average 1.1182254745026299) internal successors, (14670), 13119 states have internal predecessors, (14670), 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-12 16:00:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13120 states to 13120 states and 14670 transitions. [2024-10-12 16:00:06,503 INFO L78 Accepts]: Start accepts. Automaton has 13120 states and 14670 transitions. Word has length 502 [2024-10-12 16:00:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:06,503 INFO L471 AbstractCegarLoop]: Abstraction has 13120 states and 14670 transitions. [2024-10-12 16:00:06,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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-12 16:00:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13120 states and 14670 transitions. [2024-10-12 16:00:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2024-10-12 16:00:06,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:06,517 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:00:06,517 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1813583140, now seen corresponding path program 1 times [2024-10-12 16:00:06,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450648471] [2024-10-12 16:00:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 228 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-12 16:00:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450648471] [2024-10-12 16:00:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450648471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:00:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541307878] [2024-10-12 16:00:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:07,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:00:07,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:00:07,464 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-12 16:00:07,465 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-12 16:00:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:07,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:00:07,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:00:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-12 16:00:07,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:00:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541307878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:00:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:00:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789249904] [2024-10-12 16:00:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:07,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:00:07,794 INFO L87 Difference]: Start difference. First operand 13120 states and 14670 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:00:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:08,387 INFO L93 Difference]: Finished difference Result 15146 states and 16896 transitions. [2024-10-12 16:00:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 508 [2024-10-12 16:00:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:08,404 INFO L225 Difference]: With dead ends: 15146 [2024-10-12 16:00:08,405 INFO L226 Difference]: Without dead ends: 15144 [2024-10-12 16:00:08,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:00:08,411 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 181 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:08,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 135 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:00:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15144 states. [2024-10-12 16:00:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15144 to 13120. [2024-10-12 16:00:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13120 states, 13119 states have (on average 1.1181492491805778) internal successors, (14669), 13119 states have internal predecessors, (14669), 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-12 16:00:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13120 states to 13120 states and 14669 transitions. [2024-10-12 16:00:08,590 INFO L78 Accepts]: Start accepts. Automaton has 13120 states and 14669 transitions. Word has length 508 [2024-10-12 16:00:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:08,590 INFO L471 AbstractCegarLoop]: Abstraction has 13120 states and 14669 transitions. [2024-10-12 16:00:08,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:00:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13120 states and 14669 transitions. [2024-10-12 16:00:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2024-10-12 16:00:08,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:08,606 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:08,619 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-12 16:00:08,806 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,SelfDestructingSolverStorable15 [2024-10-12 16:00:08,807 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash 70382273, now seen corresponding path program 1 times [2024-10-12 16:00:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165929215] [2024-10-12 16:00:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-12 16:00:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165929215] [2024-10-12 16:00:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165929215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:09,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308535320] [2024-10-12 16:00:09,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:09,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:00:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:09,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:00:09,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:00:09,145 INFO L87 Difference]: Start difference. First operand 13120 states and 14669 transitions. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 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-12 16:00:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:10,085 INFO L93 Difference]: Finished difference Result 34168 states and 37972 transitions. [2024-10-12 16:00:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:00:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 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 574 [2024-10-12 16:00:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:10,109 INFO L225 Difference]: With dead ends: 34168 [2024-10-12 16:00:10,109 INFO L226 Difference]: Without dead ends: 21049 [2024-10-12 16:00:10,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:00:10,122 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 160 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:10,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 64 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:00:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21049 states. [2024-10-12 16:00:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21049 to 19570. [2024-10-12 16:00:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19570 states, 19569 states have (on average 1.1077724973171854) internal successors, (21678), 19569 states have internal predecessors, (21678), 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-12 16:00:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 21678 transitions. [2024-10-12 16:00:10,320 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 21678 transitions. Word has length 574 [2024-10-12 16:00:10,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:10,321 INFO L471 AbstractCegarLoop]: Abstraction has 19570 states and 21678 transitions. [2024-10-12 16:00:10,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 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-12 16:00:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 21678 transitions. [2024-10-12 16:00:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-10-12 16:00:10,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:10,336 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:00:10,337 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -380937973, now seen corresponding path program 1 times [2024-10-12 16:00:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967466488] [2024-10-12 16:00:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-10-12 16:00:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967466488] [2024-10-12 16:00:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967466488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:10,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70145040] [2024-10-12 16:00:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:10,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:10,600 INFO L87 Difference]: Start difference. First operand 19570 states and 21678 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-12 16:00:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:11,149 INFO L93 Difference]: Finished difference Result 39319 states and 43586 transitions. [2024-10-12 16:00:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 625 [2024-10-12 16:00:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:11,171 INFO L225 Difference]: With dead ends: 39319 [2024-10-12 16:00:11,171 INFO L226 Difference]: Without dead ends: 22330 [2024-10-12 16:00:11,183 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-12 16:00:11,184 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 145 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:11,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 110 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:00:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22330 states. [2024-10-12 16:00:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22330 to 19938. [2024-10-12 16:00:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19938 states, 19937 states have (on average 1.1019712093093244) internal successors, (21970), 19937 states have internal predecessors, (21970), 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-12 16:00:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19938 states to 19938 states and 21970 transitions. [2024-10-12 16:00:11,377 INFO L78 Accepts]: Start accepts. Automaton has 19938 states and 21970 transitions. Word has length 625 [2024-10-12 16:00:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:11,378 INFO L471 AbstractCegarLoop]: Abstraction has 19938 states and 21970 transitions. [2024-10-12 16:00:11,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-12 16:00:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19938 states and 21970 transitions. [2024-10-12 16:00:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2024-10-12 16:00:11,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:11,395 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:00:11,395 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:11,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash 998891673, now seen corresponding path program 1 times [2024-10-12 16:00:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881993559] [2024-10-12 16:00:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-10-12 16:00:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881993559] [2024-10-12 16:00:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881993559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225553183] [2024-10-12 16:00:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:11,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:11,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:11,693 INFO L87 Difference]: Start difference. First operand 19938 states and 21970 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-12 16:00:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:12,222 INFO L93 Difference]: Finished difference Result 40794 states and 44945 transitions. [2024-10-12 16:00:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 658 [2024-10-12 16:00:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:12,242 INFO L225 Difference]: With dead ends: 40794 [2024-10-12 16:00:12,243 INFO L226 Difference]: Without dead ends: 21225 [2024-10-12 16:00:12,256 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-12 16:00:12,257 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:12,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 135 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:00:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21225 states. [2024-10-12 16:00:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21225 to 19192. [2024-10-12 16:00:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19192 states, 19191 states have (on average 1.0982231254233756) internal successors, (21076), 19191 states have internal predecessors, (21076), 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-12 16:00:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19192 states to 19192 states and 21076 transitions. [2024-10-12 16:00:12,515 INFO L78 Accepts]: Start accepts. Automaton has 19192 states and 21076 transitions. Word has length 658 [2024-10-12 16:00:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:12,516 INFO L471 AbstractCegarLoop]: Abstraction has 19192 states and 21076 transitions. [2024-10-12 16:00:12,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-12 16:00:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 19192 states and 21076 transitions. [2024-10-12 16:00:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-10-12 16:00:12,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:12,532 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:00:12,532 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:12,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1710080404, now seen corresponding path program 1 times [2024-10-12 16:00:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839130439] [2024-10-12 16:00:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 1039 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-10-12 16:00:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839130439] [2024-10-12 16:00:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839130439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:13,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:13,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:13,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177752452] [2024-10-12 16:00:13,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:13,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:13,051 INFO L87 Difference]: Start difference. First operand 19192 states and 21076 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-12 16:00:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:13,616 INFO L93 Difference]: Finished difference Result 36908 states and 40476 transitions. [2024-10-12 16:00:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 707 [2024-10-12 16:00:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:13,618 INFO L225 Difference]: With dead ends: 36908 [2024-10-12 16:00:13,618 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:00:13,633 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-12 16:00:13,634 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 46 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:13,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 335 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:00:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:00:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:00:13,635 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-12 16:00:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:00:13,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 707 [2024-10-12 16:00:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:13,636 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:00:13,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-12 16:00:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:00:13,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:00:13,639 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:00:13,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:00:13,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:13,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:00:15,933 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:00:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:00:15 BoogieIcfgContainer [2024-10-12 16:00:15,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:00:15,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:00:15,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:00:15,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:00:15,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:59:53" (3/4) ... [2024-10-12 16:00:15,952 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:00:15,970 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 16:00:15,971 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:00:15,972 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:00:15,973 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:00:16,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:00:16,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:00:16,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:00:16,109 INFO L158 Benchmark]: Toolchain (without parser) took 24706.92ms. Allocated memory was 159.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 86.2MB in the beginning and 1.1GB in the end (delta: -967.9MB). Peak memory consumption was 152.9MB. Max. memory is 16.1GB. [2024-10-12 16:00:16,109 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 123.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:00:16,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.71ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 92.5MB in the end (delta: -6.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-12 16:00:16,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.66ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 74.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 16:00:16,112 INFO L158 Benchmark]: Boogie Preprocessor took 209.13ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 74.9MB in the beginning and 156.6MB in the end (delta: -81.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-12 16:00:16,113 INFO L158 Benchmark]: RCFGBuilder took 1314.09ms. Allocated memory is still 218.1MB. Free memory was 156.6MB in the beginning and 81.9MB in the end (delta: 74.7MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2024-10-12 16:00:16,113 INFO L158 Benchmark]: TraceAbstraction took 22385.70ms. Allocated memory was 218.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 80.9MB in the beginning and 1.1GB in the end (delta: -990.1MB). Peak memory consumption was 770.5MB. Max. memory is 16.1GB. [2024-10-12 16:00:16,113 INFO L158 Benchmark]: Witness Printer took 159.28ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 16:00:16,114 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.11ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 123.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.71ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 92.5MB in the end (delta: -6.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.66ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 74.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 209.13ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 74.9MB in the beginning and 156.6MB in the end (delta: -81.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1314.09ms. Allocated memory is still 218.1MB. Free memory was 156.6MB in the beginning and 81.9MB in the end (delta: 74.7MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22385.70ms. Allocated memory was 218.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 80.9MB in the beginning and 1.1GB in the end (delta: -990.1MB). Peak memory consumption was 770.5MB. Max. memory is 16.1GB. * Witness Printer took 159.28ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 133]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2606 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2606 mSDsluCounter, 4045 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381 mSDsCounter, 1658 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10542 IncrementalHoareTripleChecker+Invalid, 12200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1658 mSolverCounterUnsat, 3664 mSDtfsCounter, 10542 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19938occurred in iteration=18, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 9660 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 7478 NumberOfCodeBlocks, 7478 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7457 ConstructedInterpolants, 0 QuantifiedInterpolants, 14331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 10110/10516 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a25 == 11) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29)) && (0 <= ((long long) a23 + 42))) || (((a25 == 12) && (a4 == 0)) && (a8 <= 15))) || (((((a25 == 11) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 13) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1))) || ((((a25 == 12) && (a8 <= 15)) && (a4 == 1)) && (a29 <= 130))) || ((((a25 == 12) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1))) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312))) || (((((a25 == 11) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1)) && (a23 <= 312))) || (((a25 <= 10) && (a8 <= 15)) && (a4 == 1))) || (((((a25 == 13) && (a4 == 0)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a8 <= 15)) && (a25 == 10)) && (a29 <= 130))) || (((((a25 == 11) && (a8 <= 15)) && (a29 <= 220)) && (a4 == 1)) && (312 <= a23))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (246 <= a29))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a29 <= 130))) || ((((a25 == 13) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1))) || (((((a4 == 0) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312)) && (246 <= a29))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:00:16,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE