./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/Problem17_label32.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/Problem17_label32.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 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:29:03,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:29:03,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:29:03,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:29:03,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:29:03,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:29:03,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:29:03,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:29:03,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:29:03,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:29:03,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:29:03,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:29:03,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:29:03,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:29:03,301 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:29:03,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:29:03,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:29:03,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:29:03,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:29:03,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:29:03,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:29:03,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:29:03,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:29:03,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:29:03,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:29:03,305 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:29:03,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:29:03,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:29:03,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:29:03,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:29:03,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:29:03,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:29:03,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:29:03,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:29:03,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:29:03,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:29:03,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:29:03,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:29:03,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:29:03,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:29:03,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:29:03,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:29:03,311 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 -> 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 [2024-10-12 16:29:03,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:29:03,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:29:03,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:29:03,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:29:03,616 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:29:03,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2024-10-12 16:29:05,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:29:05,516 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:29:05,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2024-10-12 16:29:05,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34631bffc/7eaa5cb36a074d5cb6f7fa1d718cac6b/FLAG427f6fb9e [2024-10-12 16:29:05,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34631bffc/7eaa5cb36a074d5cb6f7fa1d718cac6b [2024-10-12 16:29:05,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:29:05,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:29:05,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:29:05,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:29:05,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:29:05,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:29:05" (1/1) ... [2024-10-12 16:29:05,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f0d0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:05, skipping insertion in model container [2024-10-12 16:29:05,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:29:05" (1/1) ... [2024-10-12 16:29:05,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:29:06,060 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/Problem17_label32.c[7145,7158] [2024-10-12 16:29:06,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:29:06,638 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:29:06,664 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/Problem17_label32.c[7145,7158] [2024-10-12 16:29:06,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:29:06,928 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:29:06,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06 WrapperNode [2024-10-12 16:29:06,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:29:06,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:29:06,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:29:06,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:29:06,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:06,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,233 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-12 16:29:07,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:29:07,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:29:07,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:29:07,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:29:07,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,592 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 16:29:07,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:29:07,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:29:07,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:29:07,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:29:07,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (1/1) ... [2024-10-12 16:29:07,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:29:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:29:07,926 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 16:29:07,933 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 16:29:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:29:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:29:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:29:07,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:29:08,044 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:29:08,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:29:11,279 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-12 16:29:11,279 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:29:11,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:29:11,347 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:29:11,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:29:11 BoogieIcfgContainer [2024-10-12 16:29:11,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:29:11,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:29:11,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:29:11,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:29:11,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:29:05" (1/3) ... [2024-10-12 16:29:11,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df6b944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:29:11, skipping insertion in model container [2024-10-12 16:29:11,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:29:06" (2/3) ... [2024-10-12 16:29:11,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df6b944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:29:11, skipping insertion in model container [2024-10-12 16:29:11,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:29:11" (3/3) ... [2024-10-12 16:29:11,359 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label32.c [2024-10-12 16:29:11,377 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:29:11,378 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:29:11,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:29:11,467 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;@600d8873, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:29:11,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:29:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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:29:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 16:29:11,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:11,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:29:11,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1972493708, now seen corresponding path program 1 times [2024-10-12 16:29:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:11,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131872471] [2024-10-12 16:29:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:11,702 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 16:29:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131872471] [2024-10-12 16:29:11,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131872471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:11,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:29:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935762470] [2024-10-12 16:29:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:11,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:29:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:29:11,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:29:11,741 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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:29:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:11,845 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-12 16:29:11,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:29:11,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-12 16:29:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:11,867 INFO L225 Difference]: With dead ends: 1055 [2024-10-12 16:29:11,867 INFO L226 Difference]: Without dead ends: 526 [2024-10-12 16:29:11,872 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 16:29:11,875 INFO L432 NwaCegarLoop]: 935 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, 935 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 16:29:11,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:29:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-12 16:29:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-12 16:29:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 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:29:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-12 16:29:11,994 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 47 [2024-10-12 16:29:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:11,994 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-12 16:29:11,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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:29:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-12 16:29:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 16:29:11,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:11,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:29:11,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:29:11,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -974117734, now seen corresponding path program 1 times [2024-10-12 16:29:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361309328] [2024-10-12 16:29:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:12,210 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 16:29:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361309328] [2024-10-12 16:29:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361309328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:29:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343615891] [2024-10-12 16:29:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:12,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:12,218 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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:29:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:14,455 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-12 16:29:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-12 16:29:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:14,463 INFO L225 Difference]: With dead ends: 1501 [2024-10-12 16:29:14,464 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 16:29:14,468 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:29:14,469 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 424 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:14,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:29:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 16:29:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-12 16:29:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 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:29:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-12 16:29:14,503 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 47 [2024-10-12 16:29:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-12 16:29:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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:29:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-12 16:29:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 16:29:14,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:14,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:29:14,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:29:14,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:14,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1660719070, now seen corresponding path program 1 times [2024-10-12 16:29:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:14,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773342178] [2024-10-12 16:29:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:29:14,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773342178] [2024-10-12 16:29:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773342178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:29:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779402013] [2024-10-12 16:29:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:14,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:14,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:14,815 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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:29:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:17,267 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2024-10-12 16:29:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-10-12 16:29:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:17,276 INFO L225 Difference]: With dead ends: 2812 [2024-10-12 16:29:17,276 INFO L226 Difference]: Without dead ends: 1843 [2024-10-12 16:29:17,280 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:29:17,281 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:17,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 577 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:29:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-12 16:29:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-10-12 16:29:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 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:29:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2024-10-12 16:29:17,332 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 114 [2024-10-12 16:29:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:17,335 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2024-10-12 16:29:17,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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:29:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2024-10-12 16:29:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 16:29:17,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:17,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:29:17,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:29:17,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:17,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1630598586, now seen corresponding path program 1 times [2024-10-12 16:29:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:17,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404672573] [2024-10-12 16:29:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:29:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404672573] [2024-10-12 16:29:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404672573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902856148] [2024-10-12 16:29:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:17,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:29:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:17,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:29:17,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:29:17,745 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:21,228 INFO L93 Difference]: Finished difference Result 6766 states and 9258 transitions. [2024-10-12 16:29:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:29:21,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-10-12 16:29:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:21,248 INFO L225 Difference]: With dead ends: 6766 [2024-10-12 16:29:21,248 INFO L226 Difference]: Without dead ends: 4927 [2024-10-12 16:29:21,255 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:29:21,257 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 866 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:21,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 325 Invalid, 3384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 16:29:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2024-10-12 16:29:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4874. [2024-10-12 16:29:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.2866817155756207) internal successors, (6270), 4873 states have internal predecessors, (6270), 0 states have call successors, (0), 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:29:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6270 transitions. [2024-10-12 16:29:21,348 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6270 transitions. Word has length 117 [2024-10-12 16:29:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:21,350 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 6270 transitions. [2024-10-12 16:29:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6270 transitions. [2024-10-12 16:29:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-12 16:29:21,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:21,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:29:21,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:29:21,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:21,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2142769265, now seen corresponding path program 1 times [2024-10-12 16:29:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617349469] [2024-10-12 16:29:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:21,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 16:29:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:21,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617349469] [2024-10-12 16:29:21,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617349469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:21,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:21,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:29:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800711909] [2024-10-12 16:29:21,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:21,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:21,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:21,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:21,600 INFO L87 Difference]: Start difference. First operand 4874 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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:29:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:23,259 INFO L93 Difference]: Finished difference Result 14435 states and 18543 transitions. [2024-10-12 16:29:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:23,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 186 [2024-10-12 16:29:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:23,284 INFO L225 Difference]: With dead ends: 14435 [2024-10-12 16:29:23,285 INFO L226 Difference]: Without dead ends: 8276 [2024-10-12 16:29:23,293 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:29:23,294 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:23,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:29:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2024-10-12 16:29:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6575. [2024-10-12 16:29:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6575 states, 6574 states have (on average 1.179342865835108) internal successors, (7753), 6574 states have internal predecessors, (7753), 0 states have call successors, (0), 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:29:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6575 states to 6575 states and 7753 transitions. [2024-10-12 16:29:23,418 INFO L78 Accepts]: Start accepts. Automaton has 6575 states and 7753 transitions. Word has length 186 [2024-10-12 16:29:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:23,420 INFO L471 AbstractCegarLoop]: Abstraction has 6575 states and 7753 transitions. [2024-10-12 16:29:23,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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:29:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6575 states and 7753 transitions. [2024-10-12 16:29:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-12 16:29:23,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:23,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:29:23,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:29:23,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:23,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 543451837, now seen corresponding path program 1 times [2024-10-12 16:29:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:23,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347626821] [2024-10-12 16:29:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:29:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347626821] [2024-10-12 16:29:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347626821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:23,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:23,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87975820] [2024-10-12 16:29:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:23,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:23,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:23,627 INFO L87 Difference]: Start difference. First operand 6575 states and 7753 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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:29:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:25,237 INFO L93 Difference]: Finished difference Result 16559 states and 19930 transitions. [2024-10-12 16:29:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:25,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2024-10-12 16:29:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:25,268 INFO L225 Difference]: With dead ends: 16559 [2024-10-12 16:29:25,269 INFO L226 Difference]: Without dead ends: 9985 [2024-10-12 16:29:25,277 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:29:25,278 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:25,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 798 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:29:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9985 states. [2024-10-12 16:29:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9985 to 9985. [2024-10-12 16:29:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9985 states, 9984 states have (on average 1.1696714743589745) internal successors, (11678), 9984 states have internal predecessors, (11678), 0 states have call successors, (0), 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:29:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9985 states to 9985 states and 11678 transitions. [2024-10-12 16:29:25,445 INFO L78 Accepts]: Start accepts. Automaton has 9985 states and 11678 transitions. Word has length 199 [2024-10-12 16:29:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:25,446 INFO L471 AbstractCegarLoop]: Abstraction has 9985 states and 11678 transitions. [2024-10-12 16:29:25,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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:29:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9985 states and 11678 transitions. [2024-10-12 16:29:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 16:29:25,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:25,453 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:29:25,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:29:25,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:25,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash 217973048, now seen corresponding path program 1 times [2024-10-12 16:29:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074534936] [2024-10-12 16:29:25,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:25,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:29:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:25,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074534936] [2024-10-12 16:29:25,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074534936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:25,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:25,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572065128] [2024-10-12 16:29:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:25,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:25,636 INFO L87 Difference]: Start difference. First operand 9985 states and 11678 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:29:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:27,364 INFO L93 Difference]: Finished difference Result 25066 states and 29586 transitions. [2024-10-12 16:29:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:27,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 201 [2024-10-12 16:29:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:27,395 INFO L225 Difference]: With dead ends: 25066 [2024-10-12 16:29:27,395 INFO L226 Difference]: Without dead ends: 15082 [2024-10-12 16:29:27,405 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:29:27,406 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 405 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:27,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 484 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:29:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15082 states. [2024-10-12 16:29:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15082 to 10383. [2024-10-12 16:29:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10383 states, 10382 states have (on average 1.1651897514929686) internal successors, (12097), 10382 states have internal predecessors, (12097), 0 states have call successors, (0), 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:29:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10383 states to 10383 states and 12097 transitions. [2024-10-12 16:29:27,578 INFO L78 Accepts]: Start accepts. Automaton has 10383 states and 12097 transitions. Word has length 201 [2024-10-12 16:29:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:27,578 INFO L471 AbstractCegarLoop]: Abstraction has 10383 states and 12097 transitions. [2024-10-12 16:29:27,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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:29:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 10383 states and 12097 transitions. [2024-10-12 16:29:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 16:29:27,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:27,582 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:29:27,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:29:27,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:27,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 46238716, now seen corresponding path program 1 times [2024-10-12 16:29:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:27,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257358953] [2024-10-12 16:29:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:29:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:27,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257358953] [2024-10-12 16:29:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257358953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:27,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:27,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:27,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137576149] [2024-10-12 16:29:27,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:27,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:27,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:27,766 INFO L87 Difference]: Start difference. First operand 10383 states and 12097 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:29:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:30,100 INFO L93 Difference]: Finished difference Result 25873 states and 30416 transitions. [2024-10-12 16:29:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2024-10-12 16:29:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:30,131 INFO L225 Difference]: With dead ends: 25873 [2024-10-12 16:29:30,131 INFO L226 Difference]: Without dead ends: 15491 [2024-10-12 16:29:30,144 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:29:30,145 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 429 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:30,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 446 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:29:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15491 states. [2024-10-12 16:29:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15491 to 13777. [2024-10-12 16:29:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13777 states, 13776 states have (on average 1.166521486643438) internal successors, (16070), 13776 states have internal predecessors, (16070), 0 states have call successors, (0), 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:29:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13777 states to 13777 states and 16070 transitions. [2024-10-12 16:29:30,334 INFO L78 Accepts]: Start accepts. Automaton has 13777 states and 16070 transitions. Word has length 214 [2024-10-12 16:29:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:30,335 INFO L471 AbstractCegarLoop]: Abstraction has 13777 states and 16070 transitions. [2024-10-12 16:29:30,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:29:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13777 states and 16070 transitions. [2024-10-12 16:29:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-12 16:29:30,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:30,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 16:29:30,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:29:30,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:30,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1785549950, now seen corresponding path program 1 times [2024-10-12 16:29:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135786854] [2024-10-12 16:29:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:29:30,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:30,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135786854] [2024-10-12 16:29:30,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135786854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:30,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:30,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568288264] [2024-10-12 16:29:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:30,497 INFO L87 Difference]: Start difference. First operand 13777 states and 16070 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 16:29:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:32,528 INFO L93 Difference]: Finished difference Result 32233 states and 37931 transitions. [2024-10-12 16:29:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:32,529 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 246 [2024-10-12 16:29:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:32,563 INFO L225 Difference]: With dead ends: 32233 [2024-10-12 16:29:32,563 INFO L226 Difference]: Without dead ends: 18457 [2024-10-12 16:29:32,576 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:29:32,577 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 443 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:32,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 414 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 16:29:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18457 states. [2024-10-12 16:29:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18457 to 17175. [2024-10-12 16:29:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17175 states, 17174 states have (on average 1.1833585652730871) internal successors, (20323), 17174 states have internal predecessors, (20323), 0 states have call successors, (0), 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:29:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17175 states to 17175 states and 20323 transitions. [2024-10-12 16:29:32,786 INFO L78 Accepts]: Start accepts. Automaton has 17175 states and 20323 transitions. Word has length 246 [2024-10-12 16:29:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:32,787 INFO L471 AbstractCegarLoop]: Abstraction has 17175 states and 20323 transitions. [2024-10-12 16:29:32,788 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 16:29:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17175 states and 20323 transitions. [2024-10-12 16:29:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-12 16:29:32,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:32,792 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:29:32,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:29:32,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:32,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1627999608, now seen corresponding path program 1 times [2024-10-12 16:29:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:32,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190982196] [2024-10-12 16:29:32,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:32,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:29:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190982196] [2024-10-12 16:29:33,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190982196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:33,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:33,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:33,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108183851] [2024-10-12 16:29:33,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:33,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:33,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:33,074 INFO L87 Difference]: Start difference. First operand 17175 states and 20323 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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:29:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:34,798 INFO L93 Difference]: Finished difference Result 39056 states and 46414 transitions. [2024-10-12 16:29:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2024-10-12 16:29:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:34,832 INFO L225 Difference]: With dead ends: 39056 [2024-10-12 16:29:34,832 INFO L226 Difference]: Without dead ends: 21457 [2024-10-12 16:29:34,844 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:29:34,845 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 356 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:34,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 861 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:29:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2024-10-12 16:29:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 21024. [2024-10-12 16:29:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21024 states, 21023 states have (on average 1.1667221614422298) internal successors, (24528), 21023 states have internal predecessors, (24528), 0 states have call successors, (0), 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:29:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21024 states to 21024 states and 24528 transitions. [2024-10-12 16:29:35,087 INFO L78 Accepts]: Start accepts. Automaton has 21024 states and 24528 transitions. Word has length 263 [2024-10-12 16:29:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:35,088 INFO L471 AbstractCegarLoop]: Abstraction has 21024 states and 24528 transitions. [2024-10-12 16:29:35,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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:29:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 21024 states and 24528 transitions. [2024-10-12 16:29:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-12 16:29:35,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:35,093 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:29:35,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:29:35,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:35,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2095019932, now seen corresponding path program 1 times [2024-10-12 16:29:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:35,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753850502] [2024-10-12 16:29:35,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:35,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-12 16:29:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753850502] [2024-10-12 16:29:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753850502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:29:35,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994810218] [2024-10-12 16:29:35,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:35,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:29:35,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:29:35,421 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:29:35,422 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:29:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:35,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:29:35,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:29:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-12 16:29:35,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:29:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-12 16:29:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994810218] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:29:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:29:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-12 16:29:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630572426] [2024-10-12 16:29:36,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:36,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:29:36,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:36,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:29:36,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:29:36,173 INFO L87 Difference]: Start difference. First operand 21024 states and 24528 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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:29:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:39,078 INFO L93 Difference]: Finished difference Result 59099 states and 69387 transitions. [2024-10-12 16:29:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:29:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 271 [2024-10-12 16:29:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:39,136 INFO L225 Difference]: With dead ends: 59099 [2024-10-12 16:29:39,137 INFO L226 Difference]: Without dead ends: 37212 [2024-10-12 16:29:39,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:29:39,161 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 878 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:39,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 155 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:29:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37212 states. [2024-10-12 16:29:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37212 to 35505. [2024-10-12 16:29:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35505 states, 35504 states have (on average 1.159108832807571) internal successors, (41153), 35504 states have internal predecessors, (41153), 0 states have call successors, (0), 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:29:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35505 states to 35505 states and 41153 transitions. [2024-10-12 16:29:39,799 INFO L78 Accepts]: Start accepts. Automaton has 35505 states and 41153 transitions. Word has length 271 [2024-10-12 16:29:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:39,803 INFO L471 AbstractCegarLoop]: Abstraction has 35505 states and 41153 transitions. [2024-10-12 16:29:39,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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:29:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 35505 states and 41153 transitions. [2024-10-12 16:29:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-12 16:29:39,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:39,811 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-12 16:29:39,850 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:29:40,012 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,SelfDestructingSolverStorable10 [2024-10-12 16:29:40,014 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:40,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash -656748581, now seen corresponding path program 1 times [2024-10-12 16:29:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:40,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861028666] [2024-10-12 16:29:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-12 16:29:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:40,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861028666] [2024-10-12 16:29:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861028666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:40,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:40,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631376271] [2024-10-12 16:29:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:40,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:40,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:40,372 INFO L87 Difference]: Start difference. First operand 35505 states and 41153 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:29:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:42,200 INFO L93 Difference]: Finished difference Result 78653 states and 91328 transitions. [2024-10-12 16:29:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 279 [2024-10-12 16:29:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:42,268 INFO L225 Difference]: With dead ends: 78653 [2024-10-12 16:29:42,268 INFO L226 Difference]: Without dead ends: 42722 [2024-10-12 16:29:42,301 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:29:42,303 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 380 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:42,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 847 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:29:42,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42722 states. [2024-10-12 16:29:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42722 to 42722. [2024-10-12 16:29:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42722 states, 42721 states have (on average 1.117085274221109) internal successors, (47723), 42721 states have internal predecessors, (47723), 0 states have call successors, (0), 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:29:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42722 states to 42722 states and 47723 transitions. [2024-10-12 16:29:43,111 INFO L78 Accepts]: Start accepts. Automaton has 42722 states and 47723 transitions. Word has length 279 [2024-10-12 16:29:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:43,112 INFO L471 AbstractCegarLoop]: Abstraction has 42722 states and 47723 transitions. [2024-10-12 16:29:43,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:29:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 42722 states and 47723 transitions. [2024-10-12 16:29:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-12 16:29:43,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:43,124 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:29:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:29:43,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:43,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1666856642, now seen corresponding path program 1 times [2024-10-12 16:29:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857726691] [2024-10-12 16:29:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:43,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-12 16:29:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857726691] [2024-10-12 16:29:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857726691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:29:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891968840] [2024-10-12 16:29:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:29:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:29:43,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:29:43,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:29:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:43,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:29:43,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:29:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-12 16:29:44,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:29:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-12 16:29:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891968840] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:29:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:29:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-12 16:29:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228775216] [2024-10-12 16:29:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:44,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:29:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:29:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:29:44,307 INFO L87 Difference]: Start difference. First operand 42722 states and 47723 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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:29:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:47,071 INFO L93 Difference]: Finished difference Result 101642 states and 113663 transitions. [2024-10-12 16:29:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:29:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 345 [2024-10-12 16:29:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:47,132 INFO L225 Difference]: With dead ends: 101642 [2024-10-12 16:29:47,132 INFO L226 Difference]: Without dead ends: 58492 [2024-10-12 16:29:47,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:29:47,162 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 879 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:47,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 169 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:29:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58492 states. [2024-10-12 16:29:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58492 to 55939. [2024-10-12 16:29:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55939 states, 55938 states have (on average 1.121062605026994) internal successors, (62710), 55938 states have internal predecessors, (62710), 0 states have call successors, (0), 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:29:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55939 states to 55939 states and 62710 transitions. [2024-10-12 16:29:48,030 INFO L78 Accepts]: Start accepts. Automaton has 55939 states and 62710 transitions. Word has length 345 [2024-10-12 16:29:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:48,030 INFO L471 AbstractCegarLoop]: Abstraction has 55939 states and 62710 transitions. [2024-10-12 16:29:48,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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:29:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 55939 states and 62710 transitions. [2024-10-12 16:29:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2024-10-12 16:29:48,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:48,042 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:29:48,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 16:29:48,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 16:29:48,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:48,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash -252621212, now seen corresponding path program 1 times [2024-10-12 16:29:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052832279] [2024-10-12 16:29:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:48,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-12 16:29:48,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:48,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052832279] [2024-10-12 16:29:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052832279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:48,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:48,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:48,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196287243] [2024-10-12 16:29:48,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:48,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:48,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:48,749 INFO L87 Difference]: Start difference. First operand 55939 states and 62710 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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:29:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:50,465 INFO L93 Difference]: Finished difference Result 121240 states and 135986 transitions. [2024-10-12 16:29:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:50,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 442 [2024-10-12 16:29:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:50,664 INFO L225 Difference]: With dead ends: 121240 [2024-10-12 16:29:50,664 INFO L226 Difference]: Without dead ends: 64877 [2024-10-12 16:29:50,691 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:29:50,692 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 339 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:50,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 771 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:29:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64877 states. [2024-10-12 16:29:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64877 to 53349. [2024-10-12 16:29:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53349 states, 53348 states have (on average 1.107689135487741) internal successors, (59093), 53348 states have internal predecessors, (59093), 0 states have call successors, (0), 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:29:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53349 states to 53349 states and 59093 transitions. [2024-10-12 16:29:51,416 INFO L78 Accepts]: Start accepts. Automaton has 53349 states and 59093 transitions. Word has length 442 [2024-10-12 16:29:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:51,417 INFO L471 AbstractCegarLoop]: Abstraction has 53349 states and 59093 transitions. [2024-10-12 16:29:51,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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:29:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 53349 states and 59093 transitions. [2024-10-12 16:29:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-12 16:29:51,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:51,567 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:29:51,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:29:51,567 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:51,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -51080471, now seen corresponding path program 1 times [2024-10-12 16:29:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649051654] [2024-10-12 16:29:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-12 16:29:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649051654] [2024-10-12 16:29:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649051654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:29:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498549808] [2024-10-12 16:29:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:29:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:51,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:29:51,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:29:51,999 INFO L87 Difference]: Start difference. First operand 53349 states and 59093 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:29:53,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:53,864 INFO L93 Difference]: Finished difference Result 119900 states and 132833 transitions. [2024-10-12 16:29:53,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:29:53,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2024-10-12 16:29:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:53,973 INFO L225 Difference]: With dead ends: 119900 [2024-10-12 16:29:53,973 INFO L226 Difference]: Without dead ends: 63989 [2024-10-12 16:29:54,006 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:29:54,007 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 437 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:54,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 656 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:29:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63989 states. [2024-10-12 16:29:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63989 to 61850. [2024-10-12 16:29:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61850 states, 61849 states have (on average 1.0961211984025612) internal successors, (67794), 61849 states have internal predecessors, (67794), 0 states have call successors, (0), 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:29:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61850 states to 61850 states and 67794 transitions. [2024-10-12 16:29:54,842 INFO L78 Accepts]: Start accepts. Automaton has 61850 states and 67794 transitions. Word has length 443 [2024-10-12 16:29:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:54,842 INFO L471 AbstractCegarLoop]: Abstraction has 61850 states and 67794 transitions. [2024-10-12 16:29:54,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:29:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 61850 states and 67794 transitions. [2024-10-12 16:29:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-10-12 16:29:54,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:54,852 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-12 16:29:54,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:29:54,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:54,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash -974654688, now seen corresponding path program 1 times [2024-10-12 16:29:54,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045560822] [2024-10-12 16:29:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:29:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-12 16:29:55,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:29:55,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045560822] [2024-10-12 16:29:55,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045560822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:29:55,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:29:55,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:29:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570824897] [2024-10-12 16:29:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:29:55,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:29:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:29:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:29:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:29:55,575 INFO L87 Difference]: Start difference. First operand 61850 states and 67794 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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:29:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:29:58,190 INFO L93 Difference]: Finished difference Result 145470 states and 159570 transitions. [2024-10-12 16:29:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:29:58,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 447 [2024-10-12 16:29:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:29:58,285 INFO L225 Difference]: With dead ends: 145470 [2024-10-12 16:29:58,285 INFO L226 Difference]: Without dead ends: 83621 [2024-10-12 16:29:58,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:29:58,306 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 827 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:29:58,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 204 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:29:58,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83621 states. [2024-10-12 16:29:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83621 to 78924. [2024-10-12 16:29:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78924 states, 78923 states have (on average 1.097968906402443) internal successors, (86655), 78923 states have internal predecessors, (86655), 0 states have call successors, (0), 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:29:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78924 states to 78924 states and 86655 transitions. [2024-10-12 16:29:59,456 INFO L78 Accepts]: Start accepts. Automaton has 78924 states and 86655 transitions. Word has length 447 [2024-10-12 16:29:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:29:59,457 INFO L471 AbstractCegarLoop]: Abstraction has 78924 states and 86655 transitions. [2024-10-12 16:29:59,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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:29:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 78924 states and 86655 transitions. [2024-10-12 16:29:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-10-12 16:29:59,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:29:59,466 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:59,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:29:59,466 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:29:59,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:29:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash -801670834, now seen corresponding path program 1 times [2024-10-12 16:29:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:29:59,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545860255] [2024-10-12 16:29:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:29:59,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:29:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-12 16:30:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545860255] [2024-10-12 16:30:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545860255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498711262] [2024-10-12 16:30:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:00,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:00,167 INFO L87 Difference]: Start difference. First operand 78924 states and 86655 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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:30:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:02,085 INFO L93 Difference]: Finished difference Result 167640 states and 184226 transitions. [2024-10-12 16:30:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:02,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 466 [2024-10-12 16:30:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:02,181 INFO L225 Difference]: With dead ends: 167640 [2024-10-12 16:30:02,181 INFO L226 Difference]: Without dead ends: 88717 [2024-10-12 16:30:02,208 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:30:02,208 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 385 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:02,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 324 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:30:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88717 states. [2024-10-12 16:30:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88717 to 88285. [2024-10-12 16:30:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88285 states, 88284 states have (on average 1.095340038965158) internal successors, (96701), 88284 states have internal predecessors, (96701), 0 states have call successors, (0), 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:30:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88285 states to 88285 states and 96701 transitions. [2024-10-12 16:30:03,369 INFO L78 Accepts]: Start accepts. Automaton has 88285 states and 96701 transitions. Word has length 466 [2024-10-12 16:30:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:03,369 INFO L471 AbstractCegarLoop]: Abstraction has 88285 states and 96701 transitions. [2024-10-12 16:30:03,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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:30:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 88285 states and 96701 transitions. [2024-10-12 16:30:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-12 16:30:03,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:03,380 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:30:03,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:30:03,380 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:03,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:03,381 INFO L85 PathProgramCache]: Analyzing trace with hash -231922372, now seen corresponding path program 1 times [2024-10-12 16:30:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:03,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604227192] [2024-10-12 16:30:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2024-10-12 16:30:04,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604227192] [2024-10-12 16:30:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604227192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:04,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:04,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:04,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529785430] [2024-10-12 16:30:04,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:04,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:04,124 INFO L87 Difference]: Start difference. First operand 88285 states and 96701 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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:30:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:06,281 INFO L93 Difference]: Finished difference Result 190189 states and 208576 transitions. [2024-10-12 16:30:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:06,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 490 [2024-10-12 16:30:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:06,404 INFO L225 Difference]: With dead ends: 190189 [2024-10-12 16:30:06,404 INFO L226 Difference]: Without dead ends: 101905 [2024-10-12 16:30:06,421 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:30:06,421 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 474 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:06,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 262 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:30:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101905 states. [2024-10-12 16:30:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101905 to 101448. [2024-10-12 16:30:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101448 states, 101447 states have (on average 1.0927972241663135) internal successors, (110861), 101447 states have internal predecessors, (110861), 0 states have call successors, (0), 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:30:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101448 states to 101448 states and 110861 transitions. [2024-10-12 16:30:07,649 INFO L78 Accepts]: Start accepts. Automaton has 101448 states and 110861 transitions. Word has length 490 [2024-10-12 16:30:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:07,650 INFO L471 AbstractCegarLoop]: Abstraction has 101448 states and 110861 transitions. [2024-10-12 16:30:07,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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:30:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 101448 states and 110861 transitions. [2024-10-12 16:30:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-10-12 16:30:07,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:07,658 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:30:07,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:07,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash 5549529, now seen corresponding path program 1 times [2024-10-12 16:30:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891971859] [2024-10-12 16:30:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-12 16:30:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891971859] [2024-10-12 16:30:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891971859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:08,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:08,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:30:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798147418] [2024-10-12 16:30:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:08,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:30:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:30:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:30:08,292 INFO L87 Difference]: Start difference. First operand 101448 states and 110861 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:30:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:10,278 INFO L93 Difference]: Finished difference Result 208446 states and 227580 transitions. [2024-10-12 16:30:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:30:10,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 493 [2024-10-12 16:30:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:10,420 INFO L225 Difference]: With dead ends: 208446 [2024-10-12 16:30:10,421 INFO L226 Difference]: Without dead ends: 105292 [2024-10-12 16:30:10,490 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:30:10,491 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 401 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:10,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 804 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:30:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105292 states. [2024-10-12 16:30:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105292 to 102291. [2024-10-12 16:30:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102291 states, 102290 states have (on average 1.0912112620979568) internal successors, (111620), 102290 states have internal predecessors, (111620), 0 states have call successors, (0), 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:30:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102291 states to 102291 states and 111620 transitions. [2024-10-12 16:30:12,117 INFO L78 Accepts]: Start accepts. Automaton has 102291 states and 111620 transitions. Word has length 493 [2024-10-12 16:30:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:12,117 INFO L471 AbstractCegarLoop]: Abstraction has 102291 states and 111620 transitions. [2024-10-12 16:30:12,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:30:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 102291 states and 111620 transitions. [2024-10-12 16:30:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-10-12 16:30:12,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:12,128 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:30:12,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:30:12,128 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1829229037, now seen corresponding path program 1 times [2024-10-12 16:30:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306421268] [2024-10-12 16:30:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:30:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-10-12 16:30:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:30:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306421268] [2024-10-12 16:30:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306421268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:30:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:30:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:30:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138968238] [2024-10-12 16:30:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:30:12,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:30:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:30:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:30:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:30:12,954 INFO L87 Difference]: Start difference. First operand 102291 states and 111620 transitions. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:30:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:30:15,963 INFO L93 Difference]: Finished difference Result 212666 states and 231694 transitions. [2024-10-12 16:30:15,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:30:15,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 531 [2024-10-12 16:30:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:30:16,100 INFO L225 Difference]: With dead ends: 212666 [2024-10-12 16:30:16,100 INFO L226 Difference]: Without dead ends: 110800 [2024-10-12 16:30:16,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:30:16,149 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 792 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 3203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:30:16,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 378 Invalid, 3203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:30:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110800 states. [2024-10-12 16:30:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110800 to 106120. [2024-10-12 16:30:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106120 states, 106119 states have (on average 1.0823980625524177) internal successors, (114863), 106119 states have internal predecessors, (114863), 0 states have call successors, (0), 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:30:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106120 states to 106120 states and 114863 transitions. [2024-10-12 16:30:17,720 INFO L78 Accepts]: Start accepts. Automaton has 106120 states and 114863 transitions. Word has length 531 [2024-10-12 16:30:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:30:17,721 INFO L471 AbstractCegarLoop]: Abstraction has 106120 states and 114863 transitions. [2024-10-12 16:30:17,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:30:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 106120 states and 114863 transitions. [2024-10-12 16:30:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2024-10-12 16:30:17,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:30:17,734 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:17,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:30:17,734 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:30:17,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:30:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 741137153, now seen corresponding path program 1 times [2024-10-12 16:30:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:30:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169387431] [2024-10-12 16:30:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:30:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:30:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat