./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/Problem03_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/Problem03_label08.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 cfb40cb555a14fd95bceea51ff65e6513c4cf2d7cc92f4af25db414fd945afd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:19:58,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:19:58,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:19:58,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:19:58,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:19:58,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:19:58,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:19:58,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:19:58,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:19:58,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:19:58,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:19:58,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:19:58,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:19:58,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:19:58,286 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:19:58,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:19:58,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:19:58,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:19:58,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:19:58,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:19:58,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:19:58,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:19:58,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:19:58,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:19:58,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:19:58,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:19:58,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:19:58,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:19:58,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:19:58,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:19:58,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:19:58,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:19:58,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:19:58,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:19:58,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:19:58,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:19:58,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:19:58,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:19:58,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:19:58,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:19:58,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:19:58,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:19:58,295 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 -> cfb40cb555a14fd95bceea51ff65e6513c4cf2d7cc92f4af25db414fd945afd5 [2024-10-23 20:19:58,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:19:58,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:19:58,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:19:58,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:19:58,518 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:19:58,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2024-10-23 20:19:59,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:19:59,998 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:19:59,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2024-10-23 20:20:00,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5cc4e8b/41d9b9d0650d4c5f81220e85959250e8/FLAG1440be346 [2024-10-23 20:20:00,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5cc4e8b/41d9b9d0650d4c5f81220e85959250e8 [2024-10-23 20:20:00,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:20:00,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:20:00,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:20:00,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:20:00,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:20:00,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:00,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6198a6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00, skipping insertion in model container [2024-10-23 20:20:00,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:00,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:20:00,747 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/Problem03_label08.c[55410,55423] [2024-10-23 20:20:00,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:20:00,792 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:20:00,895 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/Problem03_label08.c[55410,55423] [2024-10-23 20:20:00,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:20:00,919 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:20:00,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00 WrapperNode [2024-10-23 20:20:00,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:20:00,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:20:00,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:20:00,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:20:00,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:00,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,022 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-23 20:20:01,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:20:01,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:20:01,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:20:01,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:20:01,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,079 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-23 20:20:01,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:20:01,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:20:01,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:20:01,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:20:01,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (1/1) ... [2024-10-23 20:20:01,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:20:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:01,177 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-23 20:20:01,181 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-23 20:20:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:20:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:20:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:20:01,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:20:01,279 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:20:01,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:20:02,583 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-23 20:20:02,583 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:20:02,625 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:20:02,626 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:20:02,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:20:02 BoogieIcfgContainer [2024-10-23 20:20:02,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:20:02,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:20:02,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:20:02,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:20:02,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:20:00" (1/3) ... [2024-10-23 20:20:02,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f175f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:20:02, skipping insertion in model container [2024-10-23 20:20:02,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:00" (2/3) ... [2024-10-23 20:20:02,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f175f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:20:02, skipping insertion in model container [2024-10-23 20:20:02,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:20:02" (3/3) ... [2024-10-23 20:20:02,635 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label08.c [2024-10-23 20:20:02,647 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:20:02,647 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:20:02,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:20:02,717 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;@18b39a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:20:02,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:20:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-23 20:20:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-23 20:20:02,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:02,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:02,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:02,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash 508503873, now seen corresponding path program 1 times [2024-10-23 20:20:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146287532] [2024-10-23 20:20:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:03,183 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-23 20:20:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146287532] [2024-10-23 20:20:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146287532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:03,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866245169] [2024-10-23 20:20:03,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:20:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:20:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:20:03,215 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-23 20:20:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:03,259 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-23 20:20:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:20:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-23 20:20:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:03,269 INFO L225 Difference]: With dead ends: 479 [2024-10-23 20:20:03,270 INFO L226 Difference]: Without dead ends: 238 [2024-10-23 20:20:03,272 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-23 20:20:03,274 INFO L432 NwaCegarLoop]: 392 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, 392 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-23 20:20:03,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:20:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-23 20:20:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-23 20:20:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-23 20:20:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-23 20:20:03,307 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 156 [2024-10-23 20:20:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:03,308 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-23 20:20:03,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-23 20:20:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-23 20:20:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-23 20:20:03,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:03,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:03,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:20:03,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:03,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2020038930, now seen corresponding path program 1 times [2024-10-23 20:20:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:03,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196251058] [2024-10-23 20:20:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:03,635 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-23 20:20:03,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196251058] [2024-10-23 20:20:03,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196251058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542395410] [2024-10-23 20:20:03,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:03,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:03,639 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-23 20:20:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:04,386 INFO L93 Difference]: Finished difference Result 686 states and 1135 transitions. [2024-10-23 20:20:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-23 20:20:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:04,390 INFO L225 Difference]: With dead ends: 686 [2024-10-23 20:20:04,390 INFO L226 Difference]: Without dead ends: 449 [2024-10-23 20:20:04,392 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-23 20:20:04,393 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 121 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:04,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 90 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-23 20:20:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-23 20:20:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 446 states have internal predecessors, (724), 0 states have call successors, (0), 0 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-23 20:20:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 724 transitions. [2024-10-23 20:20:04,417 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 724 transitions. Word has length 156 [2024-10-23 20:20:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:04,417 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 724 transitions. [2024-10-23 20:20:04,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-23 20:20:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 724 transitions. [2024-10-23 20:20:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-23 20:20:04,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:04,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:04,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:20:04,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:04,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash 860051832, now seen corresponding path program 1 times [2024-10-23 20:20:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062812880] [2024-10-23 20:20:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:04,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:04,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062812880] [2024-10-23 20:20:04,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062812880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:04,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:04,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25139840] [2024-10-23 20:20:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:04,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:04,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:04,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:04,615 INFO L87 Difference]: Start difference. First operand 447 states and 724 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-23 20:20:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:05,188 INFO L93 Difference]: Finished difference Result 1317 states and 2138 transitions. [2024-10-23 20:20:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:05,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-23 20:20:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:05,192 INFO L225 Difference]: With dead ends: 1317 [2024-10-23 20:20:05,192 INFO L226 Difference]: Without dead ends: 871 [2024-10-23 20:20:05,193 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-23 20:20:05,194 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:05,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 156 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-23 20:20:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 867. [2024-10-23 20:20:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5277136258660509) internal successors, (1323), 866 states have internal predecessors, (1323), 0 states have call successors, (0), 0 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-23 20:20:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1323 transitions. [2024-10-23 20:20:05,216 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1323 transitions. Word has length 161 [2024-10-23 20:20:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:05,216 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1323 transitions. [2024-10-23 20:20:05,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-23 20:20:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1323 transitions. [2024-10-23 20:20:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-23 20:20:05,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:05,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:05,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:20:05,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:05,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:05,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1284347567, now seen corresponding path program 1 times [2024-10-23 20:20:05,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122412571] [2024-10-23 20:20:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:05,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122412571] [2024-10-23 20:20:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122412571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:05,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:05,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:05,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427126580] [2024-10-23 20:20:05,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:05,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:05,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:05,343 INFO L87 Difference]: Start difference. First operand 867 states and 1323 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-23 20:20:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:06,059 INFO L93 Difference]: Finished difference Result 2565 states and 3930 transitions. [2024-10-23 20:20:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2024-10-23 20:20:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:06,065 INFO L225 Difference]: With dead ends: 2565 [2024-10-23 20:20:06,065 INFO L226 Difference]: Without dead ends: 1699 [2024-10-23 20:20:06,066 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-23 20:20:06,067 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:06,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-23 20:20:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1683. [2024-10-23 20:20:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.4982164090368608) internal successors, (2520), 1682 states have internal predecessors, (2520), 0 states have call successors, (0), 0 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-23 20:20:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2520 transitions. [2024-10-23 20:20:06,091 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2520 transitions. Word has length 164 [2024-10-23 20:20:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:06,091 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2520 transitions. [2024-10-23 20:20:06,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-23 20:20:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2520 transitions. [2024-10-23 20:20:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-23 20:20:06,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:06,094 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:06,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:20:06,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:06,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:06,095 INFO L85 PathProgramCache]: Analyzing trace with hash -679164012, now seen corresponding path program 1 times [2024-10-23 20:20:06,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:06,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344566550] [2024-10-23 20:20:06,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:06,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:06,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344566550] [2024-10-23 20:20:06,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344566550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:06,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:06,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:06,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553821074] [2024-10-23 20:20:06,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:06,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:06,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:06,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:06,303 INFO L87 Difference]: Start difference. First operand 1683 states and 2520 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-23 20:20:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:06,930 INFO L93 Difference]: Finished difference Result 4187 states and 6246 transitions. [2024-10-23 20:20:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:06,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-10-23 20:20:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:06,936 INFO L225 Difference]: With dead ends: 4187 [2024-10-23 20:20:06,937 INFO L226 Difference]: Without dead ends: 2505 [2024-10-23 20:20:06,938 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-23 20:20:06,940 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:06,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 111 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-10-23 20:20:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2504. [2024-10-23 20:20:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 1.4702357171394327) internal successors, (3680), 2503 states have internal predecessors, (3680), 0 states have call successors, (0), 0 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-23 20:20:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3680 transitions. [2024-10-23 20:20:06,974 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3680 transitions. Word has length 166 [2024-10-23 20:20:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:06,974 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3680 transitions. [2024-10-23 20:20:06,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-23 20:20:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3680 transitions. [2024-10-23 20:20:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-23 20:20:06,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:06,978 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:06,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:20:06,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:06,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash 445037310, now seen corresponding path program 1 times [2024-10-23 20:20:06,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:06,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527386503] [2024-10-23 20:20:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:06,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:07,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527386503] [2024-10-23 20:20:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527386503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796855370] [2024-10-23 20:20:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:07,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:07,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:07,158 INFO L87 Difference]: Start difference. First operand 2504 states and 3680 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-23 20:20:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:07,734 INFO L93 Difference]: Finished difference Result 5006 states and 7358 transitions. [2024-10-23 20:20:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:07,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 171 [2024-10-23 20:20:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:07,745 INFO L225 Difference]: With dead ends: 5006 [2024-10-23 20:20:07,745 INFO L226 Difference]: Without dead ends: 2503 [2024-10-23 20:20:07,747 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-23 20:20:07,748 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 121 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:07,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 376 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-10-23 20:20:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2024-10-23 20:20:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.3664) internal successors, (3416), 2500 states have internal predecessors, (3416), 0 states have call successors, (0), 0 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-23 20:20:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3416 transitions. [2024-10-23 20:20:07,773 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3416 transitions. Word has length 171 [2024-10-23 20:20:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:07,773 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3416 transitions. [2024-10-23 20:20:07,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-23 20:20:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3416 transitions. [2024-10-23 20:20:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-23 20:20:07,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:07,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:07,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:20:07,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash 197530659, now seen corresponding path program 1 times [2024-10-23 20:20:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768935480] [2024-10-23 20:20:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:07,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:07,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768935480] [2024-10-23 20:20:07,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768935480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:07,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:07,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:07,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151515311] [2024-10-23 20:20:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:07,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:07,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:07,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:07,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:07,997 INFO L87 Difference]: Start difference. First operand 2501 states and 3416 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-23 20:20:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:08,626 INFO L93 Difference]: Finished difference Result 7438 states and 10164 transitions. [2024-10-23 20:20:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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 173 [2024-10-23 20:20:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:08,638 INFO L225 Difference]: With dead ends: 7438 [2024-10-23 20:20:08,638 INFO L226 Difference]: Without dead ends: 4938 [2024-10-23 20:20:08,642 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-23 20:20:08,642 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 210 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:08,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 185 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2024-10-23 20:20:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4125. [2024-10-23 20:20:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4125 states, 4124 states have (on average 1.2580019398642095) internal successors, (5188), 4124 states have internal predecessors, (5188), 0 states have call successors, (0), 0 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-23 20:20:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5188 transitions. [2024-10-23 20:20:08,696 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5188 transitions. Word has length 173 [2024-10-23 20:20:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 4125 states and 5188 transitions. [2024-10-23 20:20:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-23 20:20:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5188 transitions. [2024-10-23 20:20:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-23 20:20:08,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:08,701 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:08,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:20:08,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:08,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash 480080009, now seen corresponding path program 1 times [2024-10-23 20:20:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:08,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904180335] [2024-10-23 20:20:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:08,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904180335] [2024-10-23 20:20:08,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904180335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:08,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:08,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346013684] [2024-10-23 20:20:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:08,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:20:08,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:08,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:20:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:08,967 INFO L87 Difference]: Start difference. First operand 4125 states and 5188 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-23 20:20:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:10,016 INFO L93 Difference]: Finished difference Result 16224 states and 20442 transitions. [2024-10-23 20:20:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:20:10,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 183 [2024-10-23 20:20:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:10,041 INFO L225 Difference]: With dead ends: 16224 [2024-10-23 20:20:10,041 INFO L226 Difference]: Without dead ends: 12100 [2024-10-23 20:20:10,045 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-23 20:20:10,046 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 888 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:10,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 111 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 20:20:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12100 states. [2024-10-23 20:20:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12100 to 12096. [2024-10-23 20:20:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 12095 states have (on average 1.2502687060768913) internal successors, (15122), 12095 states have internal predecessors, (15122), 0 states have call successors, (0), 0 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-23 20:20:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 15122 transitions. [2024-10-23 20:20:10,197 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 15122 transitions. Word has length 183 [2024-10-23 20:20:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:10,197 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 15122 transitions. [2024-10-23 20:20:10,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-23 20:20:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 15122 transitions. [2024-10-23 20:20:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-23 20:20:10,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:10,202 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:10,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:20:10,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:10,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 856437479, now seen corresponding path program 1 times [2024-10-23 20:20:10,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:10,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836570272] [2024-10-23 20:20:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:10,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836570272] [2024-10-23 20:20:10,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836570272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:10,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:10,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:10,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223058479] [2024-10-23 20:20:10,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:10,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:10,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:10,469 INFO L87 Difference]: Start difference. First operand 12096 states and 15122 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:11,110 INFO L93 Difference]: Finished difference Result 31524 states and 39382 transitions. [2024-10-23 20:20:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-10-23 20:20:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:11,140 INFO L225 Difference]: With dead ends: 31524 [2024-10-23 20:20:11,140 INFO L226 Difference]: Without dead ends: 19429 [2024-10-23 20:20:11,154 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-23 20:20:11,155 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 193 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:11,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 379 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19429 states. [2024-10-23 20:20:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19429 to 18186. [2024-10-23 20:20:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18186 states, 18185 states have (on average 1.2152323343414901) internal successors, (22099), 18185 states have internal predecessors, (22099), 0 states have call successors, (0), 0 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-23 20:20:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18186 states to 18186 states and 22099 transitions. [2024-10-23 20:20:11,405 INFO L78 Accepts]: Start accepts. Automaton has 18186 states and 22099 transitions. Word has length 205 [2024-10-23 20:20:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:11,405 INFO L471 AbstractCegarLoop]: Abstraction has 18186 states and 22099 transitions. [2024-10-23 20:20:11,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18186 states and 22099 transitions. [2024-10-23 20:20:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-23 20:20:11,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:11,412 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:11,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 20:20:11,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:11,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:11,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1996331714, now seen corresponding path program 1 times [2024-10-23 20:20:11,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:11,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542316084] [2024-10-23 20:20:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542316084] [2024-10-23 20:20:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542316084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:11,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953531393] [2024-10-23 20:20:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:11,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:20:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:20:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:11,706 INFO L87 Difference]: Start difference. First operand 18186 states and 22099 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 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-23 20:20:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:12,718 INFO L93 Difference]: Finished difference Result 38844 states and 47350 transitions. [2024-10-23 20:20:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:20:12,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-10-23 20:20:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:12,744 INFO L225 Difference]: With dead ends: 38844 [2024-10-23 20:20:12,744 INFO L226 Difference]: Without dead ends: 20659 [2024-10-23 20:20:12,770 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-23 20:20:12,770 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 391 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:12,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 172 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 20:20:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20659 states. [2024-10-23 20:20:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20659 to 17780. [2024-10-23 20:20:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17780 states, 17779 states have (on average 1.2131728443669498) internal successors, (21569), 17779 states have internal predecessors, (21569), 0 states have call successors, (0), 0 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-23 20:20:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17780 states to 17780 states and 21569 transitions. [2024-10-23 20:20:13,002 INFO L78 Accepts]: Start accepts. Automaton has 17780 states and 21569 transitions. Word has length 221 [2024-10-23 20:20:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:13,003 INFO L471 AbstractCegarLoop]: Abstraction has 17780 states and 21569 transitions. [2024-10-23 20:20:13,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 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-23 20:20:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 17780 states and 21569 transitions. [2024-10-23 20:20:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-23 20:20:13,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:13,009 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:13,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 20:20:13,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1685120685, now seen corresponding path program 1 times [2024-10-23 20:20:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098921641] [2024-10-23 20:20:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-23 20:20:13,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:13,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098921641] [2024-10-23 20:20:13,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098921641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166145105] [2024-10-23 20:20:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:13,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:13,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:13,316 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-23 20:20:13,317 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-23 20:20:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:13,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 20:20:13,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:13,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166145105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:13,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:20:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621602093] [2024-10-23 20:20:13,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:13,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:13,514 INFO L87 Difference]: Start difference. First operand 17780 states and 21569 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-23 20:20:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:14,167 INFO L93 Difference]: Finished difference Result 47360 states and 57199 transitions. [2024-10-23 20:20:14,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:14,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 228 [2024-10-23 20:20:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:14,213 INFO L225 Difference]: With dead ends: 47360 [2024-10-23 20:20:14,214 INFO L226 Difference]: Without dead ends: 29581 [2024-10-23 20:20:14,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:14,235 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 208 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:14,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 408 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29581 states. [2024-10-23 20:20:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29581 to 28551. [2024-10-23 20:20:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28551 states, 28550 states have (on average 1.1869352014010508) internal successors, (33887), 28550 states have internal predecessors, (33887), 0 states have call successors, (0), 0 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-23 20:20:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28551 states to 28551 states and 33887 transitions. [2024-10-23 20:20:14,653 INFO L78 Accepts]: Start accepts. Automaton has 28551 states and 33887 transitions. Word has length 228 [2024-10-23 20:20:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:14,653 INFO L471 AbstractCegarLoop]: Abstraction has 28551 states and 33887 transitions. [2024-10-23 20:20:14,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-23 20:20:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 28551 states and 33887 transitions. [2024-10-23 20:20:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-23 20:20:14,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:14,661 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:14,675 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-23 20:20:14,861 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-23 20:20:14,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:14,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1635143633, now seen corresponding path program 1 times [2024-10-23 20:20:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283004599] [2024-10-23 20:20:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 20:20:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283004599] [2024-10-23 20:20:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283004599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475538732] [2024-10-23 20:20:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:15,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:15,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:15,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:15,287 INFO L87 Difference]: Start difference. First operand 28551 states and 33887 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:16,039 INFO L93 Difference]: Finished difference Result 62600 states and 74144 transitions. [2024-10-23 20:20:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:16,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2024-10-23 20:20:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:16,083 INFO L225 Difference]: With dead ends: 62600 [2024-10-23 20:20:16,083 INFO L226 Difference]: Without dead ends: 34050 [2024-10-23 20:20:16,100 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-23 20:20:16,101 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 200 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:16,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 186 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34050 states. [2024-10-23 20:20:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34050 to 34034. [2024-10-23 20:20:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34034 states, 34033 states have (on average 1.1810301765933064) internal successors, (40194), 34033 states have internal predecessors, (40194), 0 states have call successors, (0), 0 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-23 20:20:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34034 states to 34034 states and 40194 transitions. [2024-10-23 20:20:16,409 INFO L78 Accepts]: Start accepts. Automaton has 34034 states and 40194 transitions. Word has length 240 [2024-10-23 20:20:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:16,409 INFO L471 AbstractCegarLoop]: Abstraction has 34034 states and 40194 transitions. [2024-10-23 20:20:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 34034 states and 40194 transitions. [2024-10-23 20:20:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-23 20:20:16,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:16,423 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-23 20:20:16,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 20:20:16,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:16,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1899808268, now seen corresponding path program 1 times [2024-10-23 20:20:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:16,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788027191] [2024-10-23 20:20:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:16,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 20:20:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788027191] [2024-10-23 20:20:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788027191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926295017] [2024-10-23 20:20:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:16,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:16,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:16,819 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-23 20:20:16,820 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-23 20:20:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:16,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:16,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-23 20:20:17,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926295017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:20:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744814271] [2024-10-23 20:20:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:17,099 INFO L87 Difference]: Start difference. First operand 34034 states and 40194 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-23 20:20:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:17,729 INFO L93 Difference]: Finished difference Result 69097 states and 81461 transitions. [2024-10-23 20:20:17,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:17,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 248 [2024-10-23 20:20:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:17,767 INFO L225 Difference]: With dead ends: 69097 [2024-10-23 20:20:17,767 INFO L226 Difference]: Without dead ends: 35064 [2024-10-23 20:20:17,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:17,790 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:17,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 125 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35064 states. [2024-10-23 20:20:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35064 to 32613. [2024-10-23 20:20:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32613 states, 32612 states have (on average 1.1466944682938796) internal successors, (37396), 32612 states have internal predecessors, (37396), 0 states have call successors, (0), 0 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-23 20:20:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32613 states to 32613 states and 37396 transitions. [2024-10-23 20:20:18,109 INFO L78 Accepts]: Start accepts. Automaton has 32613 states and 37396 transitions. Word has length 248 [2024-10-23 20:20:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:18,109 INFO L471 AbstractCegarLoop]: Abstraction has 32613 states and 37396 transitions. [2024-10-23 20:20:18,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-23 20:20:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 32613 states and 37396 transitions. [2024-10-23 20:20:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-23 20:20:18,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:18,119 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:18,134 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-23 20:20:18,319 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-23 20:20:18,320 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:18,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:18,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1009129412, now seen corresponding path program 1 times [2024-10-23 20:20:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916281657] [2024-10-23 20:20:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916281657] [2024-10-23 20:20:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916281657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:18,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:18,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345049006] [2024-10-23 20:20:18,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:18,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:18,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:18,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:18,678 INFO L87 Difference]: Start difference. First operand 32613 states and 37396 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-23 20:20:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:19,393 INFO L93 Difference]: Finished difference Result 70933 states and 81424 transitions. [2024-10-23 20:20:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 249 [2024-10-23 20:20:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:19,436 INFO L225 Difference]: With dead ends: 70933 [2024-10-23 20:20:19,436 INFO L226 Difference]: Without dead ends: 36900 [2024-10-23 20:20:19,461 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-23 20:20:19,462 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 142 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:19,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 403 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36900 states. [2024-10-23 20:20:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36900 to 30191. [2024-10-23 20:20:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30191 states, 30190 states have (on average 1.1096389532957933) internal successors, (33500), 30190 states have internal predecessors, (33500), 0 states have call successors, (0), 0 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-23 20:20:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30191 states to 30191 states and 33500 transitions. [2024-10-23 20:20:19,881 INFO L78 Accepts]: Start accepts. Automaton has 30191 states and 33500 transitions. Word has length 249 [2024-10-23 20:20:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:19,882 INFO L471 AbstractCegarLoop]: Abstraction has 30191 states and 33500 transitions. [2024-10-23 20:20:19,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-23 20:20:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30191 states and 33500 transitions. [2024-10-23 20:20:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-23 20:20:19,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:19,894 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:19,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 20:20:19,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:19,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:19,895 INFO L85 PathProgramCache]: Analyzing trace with hash -375318906, now seen corresponding path program 1 times [2024-10-23 20:20:19,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:19,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536722217] [2024-10-23 20:20:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-23 20:20:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536722217] [2024-10-23 20:20:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536722217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:20,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768987849] [2024-10-23 20:20:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:20,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:20,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:20,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:20,162 INFO L87 Difference]: Start difference. First operand 30191 states and 33500 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-23 20:20:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:20,829 INFO L93 Difference]: Finished difference Result 78740 states and 87458 transitions. [2024-10-23 20:20:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:20,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 262 [2024-10-23 20:20:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:20,875 INFO L225 Difference]: With dead ends: 78740 [2024-10-23 20:20:20,875 INFO L226 Difference]: Without dead ends: 48550 [2024-10-23 20:20:20,898 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-23 20:20:20,898 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 211 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:20,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 140 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48550 states. [2024-10-23 20:20:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48550 to 48139. [2024-10-23 20:20:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48139 states, 48138 states have (on average 1.1111180356475134) internal successors, (53487), 48138 states have internal predecessors, (53487), 0 states have call successors, (0), 0 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-23 20:20:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48139 states to 48139 states and 53487 transitions. [2024-10-23 20:20:21,422 INFO L78 Accepts]: Start accepts. Automaton has 48139 states and 53487 transitions. Word has length 262 [2024-10-23 20:20:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:21,422 INFO L471 AbstractCegarLoop]: Abstraction has 48139 states and 53487 transitions. [2024-10-23 20:20:21,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-23 20:20:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 48139 states and 53487 transitions. [2024-10-23 20:20:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-23 20:20:21,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:21,435 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:21,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 20:20:21,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:21,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1554542357, now seen corresponding path program 1 times [2024-10-23 20:20:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272411003] [2024-10-23 20:20:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-23 20:20:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272411003] [2024-10-23 20:20:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272411003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587259292] [2024-10-23 20:20:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:21,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:21,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 20:20:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:21,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:21,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-23 20:20:21,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587259292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:20:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420083833] [2024-10-23 20:20:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:21,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:21,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:21,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:21,949 INFO L87 Difference]: Start difference. First operand 48139 states and 53487 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-23 20:20:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:22,723 INFO L93 Difference]: Finished difference Result 128435 states and 142721 transitions. [2024-10-23 20:20:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 269 [2024-10-23 20:20:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:22,905 INFO L225 Difference]: With dead ends: 128435 [2024-10-23 20:20:22,905 INFO L226 Difference]: Without dead ends: 80297 [2024-10-23 20:20:22,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:22,936 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 104 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:22,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 186 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:20:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80297 states. [2024-10-23 20:20:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80297 to 71764. [2024-10-23 20:20:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71764 states, 71763 states have (on average 1.1076878056937418) internal successors, (79491), 71763 states have internal predecessors, (79491), 0 states have call successors, (0), 0 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-23 20:20:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71764 states to 71764 states and 79491 transitions. [2024-10-23 20:20:23,730 INFO L78 Accepts]: Start accepts. Automaton has 71764 states and 79491 transitions. Word has length 269 [2024-10-23 20:20:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:23,731 INFO L471 AbstractCegarLoop]: Abstraction has 71764 states and 79491 transitions. [2024-10-23 20:20:23,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-23 20:20:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 71764 states and 79491 transitions. [2024-10-23 20:20:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-23 20:20:23,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:23,756 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:23,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 20:20:23,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:23,957 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:23,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash -144983928, now seen corresponding path program 1 times [2024-10-23 20:20:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:23,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083739637] [2024-10-23 20:20:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 189 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-23 20:20:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083739637] [2024-10-23 20:20:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083739637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266495912] [2024-10-23 20:20:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:24,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:24,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 20:20:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:24,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:24,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-23 20:20:24,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:24,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266495912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:24,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:24,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-23 20:20:24,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148219478] [2024-10-23 20:20:24,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:24,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:24,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:24,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:24,708 INFO L87 Difference]: Start difference. First operand 71764 states and 79491 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-23 20:20:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:25,380 INFO L93 Difference]: Finished difference Result 212440 states and 235408 transitions. [2024-10-23 20:20:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:25,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 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 334 [2024-10-23 20:20:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:25,544 INFO L225 Difference]: With dead ends: 212440 [2024-10-23 20:20:25,544 INFO L226 Difference]: Without dead ends: 141083 [2024-10-23 20:20:25,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:25,589 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 244 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:25,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 574 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 20:20:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141083 states. [2024-10-23 20:20:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141083 to 141081. [2024-10-23 20:20:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141081 states, 141080 states have (on average 1.1075418202438332) internal successors, (156252), 141080 states have internal predecessors, (156252), 0 states have call successors, (0), 0 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-23 20:20:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141081 states to 141081 states and 156252 transitions. [2024-10-23 20:20:27,461 INFO L78 Accepts]: Start accepts. Automaton has 141081 states and 156252 transitions. Word has length 334 [2024-10-23 20:20:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:27,462 INFO L471 AbstractCegarLoop]: Abstraction has 141081 states and 156252 transitions. [2024-10-23 20:20:27,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-23 20:20:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 141081 states and 156252 transitions. [2024-10-23 20:20:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-23 20:20:27,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:27,511 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:27,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-23 20:20:27,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-23 20:20:27,711 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:27,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash -552380248, now seen corresponding path program 1 times [2024-10-23 20:20:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374309285] [2024-10-23 20:20:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-10-23 20:20:28,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374309285] [2024-10-23 20:20:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374309285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855497822] [2024-10-23 20:20:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:28,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:28,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:28,275 INFO L87 Difference]: Start difference. First operand 141081 states and 156252 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-23 20:20:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:29,591 INFO L93 Difference]: Finished difference Result 317068 states and 351788 transitions. [2024-10-23 20:20:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:29,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 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-23 20:20:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:29,776 INFO L225 Difference]: With dead ends: 317068 [2024-10-23 20:20:29,777 INFO L226 Difference]: Without dead ends: 175176 [2024-10-23 20:20:29,813 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-23 20:20:29,814 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 162 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:29,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 173 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175176 states. [2024-10-23 20:20:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175176 to 158551. [2024-10-23 20:20:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158551 states, 158550 states have (on average 1.1077956480605486) internal successors, (175641), 158550 states have internal predecessors, (175641), 0 states have call successors, (0), 0 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-23 20:20:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158551 states to 158551 states and 175641 transitions. [2024-10-23 20:20:32,240 INFO L78 Accepts]: Start accepts. Automaton has 158551 states and 175641 transitions. Word has length 443 [2024-10-23 20:20:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:32,240 INFO L471 AbstractCegarLoop]: Abstraction has 158551 states and 175641 transitions. [2024-10-23 20:20:32,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-23 20:20:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 158551 states and 175641 transitions. [2024-10-23 20:20:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-10-23 20:20:32,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:32,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:32,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 20:20:32,275 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:32,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1866485920, now seen corresponding path program 1 times [2024-10-23 20:20:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:32,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713560422] [2024-10-23 20:20:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:32,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-23 20:20:32,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713560422] [2024-10-23 20:20:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713560422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:32,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016022214] [2024-10-23 20:20:32,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:32,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:32,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:32,496 INFO L87 Difference]: Start difference. First operand 158551 states and 175641 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-23 20:20:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:33,671 INFO L93 Difference]: Finished difference Result 300710 states and 332585 transitions. [2024-10-23 20:20:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:33,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 444 [2024-10-23 20:20:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:33,841 INFO L225 Difference]: With dead ends: 300710 [2024-10-23 20:20:33,841 INFO L226 Difference]: Without dead ends: 139724 [2024-10-23 20:20:33,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:33,939 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 130 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:33,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 325 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139724 states. [2024-10-23 20:20:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139724 to 124263. [2024-10-23 20:20:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124263 states, 124262 states have (on average 1.0864785694741754) internal successors, (135008), 124262 states have internal predecessors, (135008), 0 states have call successors, (0), 0 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-23 20:20:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124263 states to 124263 states and 135008 transitions. [2024-10-23 20:20:35,968 INFO L78 Accepts]: Start accepts. Automaton has 124263 states and 135008 transitions. Word has length 444 [2024-10-23 20:20:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:35,968 INFO L471 AbstractCegarLoop]: Abstraction has 124263 states and 135008 transitions. [2024-10-23 20:20:35,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-23 20:20:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 124263 states and 135008 transitions. [2024-10-23 20:20:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-10-23 20:20:36,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:36,031 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:36,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 20:20:36,031 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:36,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash -800983689, now seen corresponding path program 1 times [2024-10-23 20:20:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:36,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469505798] [2024-10-23 20:20:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-10-23 20:20:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469505798] [2024-10-23 20:20:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469505798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:36,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:36,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135634313] [2024-10-23 20:20:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:36,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:20:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:20:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:36,825 INFO L87 Difference]: Start difference. First operand 124263 states and 135008 transitions. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-23 20:20:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:38,055 INFO L93 Difference]: Finished difference Result 266467 states and 289413 transitions. [2024-10-23 20:20:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:20:38,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 671 [2024-10-23 20:20:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:38,203 INFO L225 Difference]: With dead ends: 266467 [2024-10-23 20:20:38,204 INFO L226 Difference]: Without dead ends: 142611 [2024-10-23 20:20:38,273 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-23 20:20:38,274 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 360 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:38,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 116 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142611 states. [2024-10-23 20:20:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142611 to 124466. [2024-10-23 20:20:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124466 states, 124465 states have (on average 1.0863937653155507) internal successors, (135218), 124465 states have internal predecessors, (135218), 0 states have call successors, (0), 0 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-23 20:20:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124466 states to 124466 states and 135218 transitions. [2024-10-23 20:20:40,364 INFO L78 Accepts]: Start accepts. Automaton has 124466 states and 135218 transitions. Word has length 671 [2024-10-23 20:20:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:40,364 INFO L471 AbstractCegarLoop]: Abstraction has 124466 states and 135218 transitions. [2024-10-23 20:20:40,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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-23 20:20:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 124466 states and 135218 transitions. [2024-10-23 20:20:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2024-10-23 20:20:40,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:40,436 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-23 20:20:40,437 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2010415943, now seen corresponding path program 1 times [2024-10-23 20:20:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492296062] [2024-10-23 20:20:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-23 20:20:41,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:41,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492296062] [2024-10-23 20:20:41,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492296062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:41,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:41,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 20:20:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696832775] [2024-10-23 20:20:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:41,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:20:41,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:20:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:41,187 INFO L87 Difference]: Start difference. First operand 124466 states and 135218 transitions. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-23 20:20:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:42,524 INFO L93 Difference]: Finished difference Result 252004 states and 273784 transitions. [2024-10-23 20:20:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:20:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 673 [2024-10-23 20:20:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:42,677 INFO L225 Difference]: With dead ends: 252004 [2024-10-23 20:20:42,678 INFO L226 Difference]: Without dead ends: 128351 [2024-10-23 20:20:42,731 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-23 20:20:42,731 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 217 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:42,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 161 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128351 states. [2024-10-23 20:20:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128351 to 127917. [2024-10-23 20:20:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127917 states, 127916 states have (on average 1.0809828324838175) internal successors, (138275), 127916 states have internal predecessors, (138275), 0 states have call successors, (0), 0 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-23 20:20:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127917 states to 127917 states and 138275 transitions. [2024-10-23 20:20:44,377 INFO L78 Accepts]: Start accepts. Automaton has 127917 states and 138275 transitions. Word has length 673 [2024-10-23 20:20:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:44,378 INFO L471 AbstractCegarLoop]: Abstraction has 127917 states and 138275 transitions. [2024-10-23 20:20:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-23 20:20:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 127917 states and 138275 transitions. [2024-10-23 20:20:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2024-10-23 20:20:44,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:44,473 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-23 20:20:44,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-23 20:20:44,473 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -869313947, now seen corresponding path program 1 times [2024-10-23 20:20:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168676469] [2024-10-23 20:20:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 839 proven. 119 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-23 20:20:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168676469] [2024-10-23 20:20:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168676469] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050296096] [2024-10-23 20:20:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:46,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:46,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:46,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:46,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 20:20:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:47,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:47,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 1069 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-10-23 20:20:47,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:47,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050296096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:47,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:47,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 20:20:47,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479097404] [2024-10-23 20:20:47,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:47,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:47,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:47,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:20:47,194 INFO L87 Difference]: Start difference. First operand 127917 states and 138275 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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-23 20:20:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:47,935 INFO L93 Difference]: Finished difference Result 182658 states and 197042 transitions. [2024-10-23 20:20:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 690 [2024-10-23 20:20:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:47,939 INFO L225 Difference]: With dead ends: 182658 [2024-10-23 20:20:47,939 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:20:48,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:20:48,002 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 140 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:48,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 329 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:20:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:20:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:20:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:20:48,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 690 [2024-10-23 20:20:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:48,004 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:20:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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-23 20:20:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:20:48,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:20:48,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:20:48,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-23 20:20:48,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-23 20:20:48,210 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:48,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:20:59,691 WARN L286 SmtUtils]: Spent 11.47s on a formula simplification. DAG size of input: 682 DAG size of output: 822 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-23 20:21:03,822 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:21:03,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:21:03 BoogieIcfgContainer [2024-10-23 20:21:03,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:21:03,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:21:03,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:21:03,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:21:03,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:20:02" (3/4) ... [2024-10-23 20:21:03,855 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:21:03,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:21:03,879 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:21:03,880 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:21:03,882 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:21:04,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:21:04,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:21:04,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:21:04,043 INFO L158 Benchmark]: Toolchain (without parser) took 63741.53ms. Allocated memory was 186.6MB in the beginning and 14.5GB in the end (delta: 14.3GB). Free memory was 113.3MB in the beginning and 11.6GB in the end (delta: -11.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-10-23 20:21:04,043 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:21:04,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.43ms. Allocated memory is still 186.6MB. Free memory was 113.1MB in the beginning and 106.3MB in the end (delta: 6.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-10-23 20:21:04,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.72ms. Allocated memory is still 186.6MB. Free memory was 106.3MB in the beginning and 90.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 20:21:04,044 INFO L158 Benchmark]: Boogie Preprocessor took 123.26ms. Allocated memory is still 186.6MB. Free memory was 90.8MB in the beginning and 78.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:21:04,044 INFO L158 Benchmark]: RCFGBuilder took 1478.80ms. Allocated memory was 186.6MB in the beginning and 295.7MB in the end (delta: 109.1MB). Free memory was 78.2MB in the beginning and 194.5MB in the end (delta: -116.3MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2024-10-23 20:21:04,044 INFO L158 Benchmark]: TraceAbstraction took 61225.08ms. Allocated memory was 295.7MB in the beginning and 14.5GB in the end (delta: 14.2GB). Free memory was 194.5MB in the beginning and 11.7GB in the end (delta: -11.5GB). Peak memory consumption was 6.0GB. Max. memory is 16.1GB. [2024-10-23 20:21:04,045 INFO L158 Benchmark]: Witness Printer took 187.51ms. Allocated memory is still 14.5GB. Free memory was 11.7GB in the beginning and 11.6GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 20:21:04,045 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.43ms. Allocated memory is still 186.6MB. Free memory was 113.1MB in the beginning and 106.3MB in the end (delta: 6.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.72ms. Allocated memory is still 186.6MB. Free memory was 106.3MB in the beginning and 90.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.26ms. Allocated memory is still 186.6MB. Free memory was 90.8MB in the beginning and 78.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1478.80ms. Allocated memory was 186.6MB in the beginning and 295.7MB in the end (delta: 109.1MB). Free memory was 78.2MB in the beginning and 194.5MB in the end (delta: -116.3MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * TraceAbstraction took 61225.08ms. Allocated memory was 295.7MB in the beginning and 14.5GB in the end (delta: 14.2GB). Free memory was 194.5MB in the beginning and 11.7GB in the end (delta: -11.5GB). Peak memory consumption was 6.0GB. Max. memory is 16.1GB. * Witness Printer took 187.51ms. Allocated memory is still 14.5GB. Free memory was 11.7GB in the beginning and 11.6GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1516]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.5s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4892 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4892 mSDsluCounter, 5186 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 808 mSDsCounter, 2419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13666 IncrementalHoareTripleChecker+Invalid, 16085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2419 mSolverCounterUnsat, 4378 mSDtfsCounter, 13666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1824 GetRequests, 1787 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158551occurred in iteration=18, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 74781 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 8276 NumberOfCodeBlocks, 8276 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 8249 ConstructedInterpolants, 0 QuantifiedInterpolants, 18986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3157 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 22 PerfectInterpolantSequences, 9205/9348 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a10 == 1)) && (a3 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a12 <= 0)) && (a6 <= 0))) || (((((((((a15 == 1) && (a26 == 1)) && (a20 <= 0)) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (a3 <= 1)) && (a10 == 1)) && (a11 == 1)) && (a12 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 1)) && (a6 == 1)) && (a27 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a16 == 1)) && (a8 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((((a5 == 1) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a11 <= 0)) && (a12 <= 0)) && (a6 <= 0))) || (((a12 == 1) && (((((a26 == 1) && (a5 == 1)) && (a27 == 1)) && (a6 <= 0)) || ((((a26 == 1) && (a5 == 1)) && (a11 <= 0)) && (a6 <= 0)))) && (a3 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a6 <= 0))) || ((((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (1 <= a3)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0))) || ((((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a16 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a26 == a8))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0))) || (((((((a20 <= 0) && (a5 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 <= 0)) && (a12 <= 0)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a11 <= 0)) && (a6 <= 0)) && (a26 == a2))) || ((a27 == 1) && (((((((((a26 == 1) && (a20 <= 0)) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a12 <= 0)) && (a6 <= 0)) || ((((((((a26 == 1) && (a20 <= 0)) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a6 <= 0))))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:21:04,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE