./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_label33.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_label33.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 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:22:05,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:22:05,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:22:05,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:22:05,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:22:05,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:22:05,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:22:05,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:22:05,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:22:05,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:22:05,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:22:05,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:22:05,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:22:05,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:22:05,198 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:22:05,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:22:05,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:22:05,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:22:05,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:22:05,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:22:05,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:22:05,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:22:05,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:22:05,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:22:05,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:22:05,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:22:05,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:22:05,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:22:05,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:22:05,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:22:05,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:22:05,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:22:05,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:22:05,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:22:05,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:22:05,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:22:05,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:22:05,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:22:05,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:22:05,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:22:05,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:22:05,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:22:05,207 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 -> 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 [2024-10-23 20:22:05,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:22:05,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:22:05,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:22:05,452 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:22:05,453 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:22:05,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2024-10-23 20:22:06,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:22:06,998 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:22:06,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2024-10-23 20:22:07,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f32b467/d1f54ea3aa4249229a4ec595728326fc/FLAG93fdbfbc1 [2024-10-23 20:22:07,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f32b467/d1f54ea3aa4249229a4ec595728326fc [2024-10-23 20:22:07,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:22:07,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:22:07,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:22:07,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:22:07,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:22:07,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b515ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07, skipping insertion in model container [2024-10-23 20:22:07,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:22:07,513 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_label33.c[55678,55691] [2024-10-23 20:22:07,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:22:07,564 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:22:07,684 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_label33.c[55678,55691] [2024-10-23 20:22:07,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:22:07,715 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:22:07,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07 WrapperNode [2024-10-23 20:22:07,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:22:07,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:22:07,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:22:07,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:22:07,722 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:22:07" (1/1) ... [2024-10-23 20:22:07,750 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:22:07" (1/1) ... [2024-10-23 20:22:07,808 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-23 20:22:07,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:22:07,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:22:07,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:22:07,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:22:07,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,852 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:22:07,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:22:07,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:22:07,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:22:07,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:22:07,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (1/1) ... [2024-10-23 20:22:07,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:22:07,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:22:07,969 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:22:07,977 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:22:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:22:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:22:08,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:22:08,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:22:08,158 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:22:08,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:22:09,600 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-23 20:22:09,600 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:22:09,644 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:22:09,645 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:22:09,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:22:09 BoogieIcfgContainer [2024-10-23 20:22:09,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:22:09,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:22:09,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:22:09,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:22:09,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:22:07" (1/3) ... [2024-10-23 20:22:09,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca9a504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:22:09, skipping insertion in model container [2024-10-23 20:22:09,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:22:07" (2/3) ... [2024-10-23 20:22:09,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca9a504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:22:09, skipping insertion in model container [2024-10-23 20:22:09,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:22:09" (3/3) ... [2024-10-23 20:22:09,655 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label33.c [2024-10-23 20:22:09,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:22:09,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:22:09,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:22:09,747 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;@4ecbb792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:22:09,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:22:09,753 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:22:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-23 20:22:09,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:09,768 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, 1, 1] [2024-10-23 20:22:09,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash 96374244, now seen corresponding path program 1 times [2024-10-23 20:22:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690170726] [2024-10-23 20:22:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:10,325 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:22:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:10,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690170726] [2024-10-23 20:22:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690170726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595364972] [2024-10-23 20:22:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:10,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:22:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:10,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:22:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:22:10,367 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 79.0) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:22:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:10,411 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-23 20:22:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:22:10,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-23 20:22:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:10,424 INFO L225 Difference]: With dead ends: 479 [2024-10-23 20:22:10,424 INFO L226 Difference]: Without dead ends: 238 [2024-10-23 20:22:10,427 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:22:10,430 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:22:10,430 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:22:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-23 20:22:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-23 20:22:10,464 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:22:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-23 20:22:10,467 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 158 [2024-10-23 20:22:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:10,469 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-23 20:22:10,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:22:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-23 20:22:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-23 20:22:10,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:10,471 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, 1, 1] [2024-10-23 20:22:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:22:10,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:10,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1117834165, now seen corresponding path program 1 times [2024-10-23 20:22:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:10,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92675437] [2024-10-23 20:22:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:10,818 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:22:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92675437] [2024-10-23 20:22:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92675437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:10,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790280800] [2024-10-23 20:22:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:10,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:10,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:10,826 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:22:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:11,645 INFO L93 Difference]: Finished difference Result 699 states and 1160 transitions. [2024-10-23 20:22:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-23 20:22:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:11,650 INFO L225 Difference]: With dead ends: 699 [2024-10-23 20:22:11,650 INFO L226 Difference]: Without dead ends: 462 [2024-10-23 20:22:11,652 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:22:11,653 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 98 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 90 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.8s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:11,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 20:22:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-23 20:22:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 448. [2024-10-23 20:22:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.6196868008948546) internal successors, (724), 447 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:22:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 724 transitions. [2024-10-23 20:22:11,671 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 724 transitions. Word has length 158 [2024-10-23 20:22:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:11,672 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 724 transitions. [2024-10-23 20:22:11,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:22:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 724 transitions. [2024-10-23 20:22:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-23 20:22:11,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:11,675 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, 1, 1] [2024-10-23 20:22:11,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:22:11,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:11,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2125527009, now seen corresponding path program 1 times [2024-10-23 20:22:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:11,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496269677] [2024-10-23 20:22:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:11,904 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:22:11,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:11,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496269677] [2024-10-23 20:22:11,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496269677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:11,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:11,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365283975] [2024-10-23 20:22:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:11,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:11,906 INFO L87 Difference]: Start difference. First operand 448 states and 724 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:22:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:12,526 INFO L93 Difference]: Finished difference Result 1318 states and 2137 transitions. [2024-10-23 20:22:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-10-23 20:22:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:12,533 INFO L225 Difference]: With dead ends: 1318 [2024-10-23 20:22:12,533 INFO L226 Difference]: Without dead ends: 871 [2024-10-23 20:22:12,538 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:22:12,539 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:12,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 148 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-23 20:22:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2024-10-23 20:22:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.512672811059908) internal successors, (1313), 868 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states 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:22:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1313 transitions. [2024-10-23 20:22:12,569 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1313 transitions. Word has length 163 [2024-10-23 20:22:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:12,569 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1313 transitions. [2024-10-23 20:22:12,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:22:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1313 transitions. [2024-10-23 20:22:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-23 20:22:12,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:12,576 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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:22:12,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:22:12,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:12,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 807680047, now seen corresponding path program 1 times [2024-10-23 20:22:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:12,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218424448] [2024-10-23 20:22:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:22:12,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:12,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218424448] [2024-10-23 20:22:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218424448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:12,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:12,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:22:12,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528034743] [2024-10-23 20:22:12,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:12,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:12,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:12,842 INFO L87 Difference]: Start difference. First operand 869 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:22:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:13,546 INFO L93 Difference]: Finished difference Result 2553 states and 3868 transitions. [2024-10-23 20:22:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:13,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 178 [2024-10-23 20:22:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:13,551 INFO L225 Difference]: With dead ends: 2553 [2024-10-23 20:22:13,552 INFO L226 Difference]: Without dead ends: 1685 [2024-10-23 20:22:13,553 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:22:13,554 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 232 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:13,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 414 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:22:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-23 20:22:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2024-10-23 20:22:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.3365041617122473) internal successors, (2248), 1682 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:22:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2248 transitions. [2024-10-23 20:22:13,582 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2248 transitions. Word has length 178 [2024-10-23 20:22:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:13,583 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2248 transitions. [2024-10-23 20:22:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:22:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2248 transitions. [2024-10-23 20:22:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-23 20:22:13,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:13,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:22:13,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:13,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1336781806, now seen corresponding path program 1 times [2024-10-23 20:22:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:13,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939024695] [2024-10-23 20:22:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:13,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:22:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939024695] [2024-10-23 20:22:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939024695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:13,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:13,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:13,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627880879] [2024-10-23 20:22:13,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:13,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:13,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:13,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:13,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:13,834 INFO L87 Difference]: Start difference. First operand 1683 states and 2248 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:22:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:14,489 INFO L93 Difference]: Finished difference Result 5016 states and 6706 transitions. [2024-10-23 20:22:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:14,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2024-10-23 20:22:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:14,500 INFO L225 Difference]: With dead ends: 5016 [2024-10-23 20:22:14,501 INFO L226 Difference]: Without dead ends: 3334 [2024-10-23 20:22:14,503 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:22:14,504 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 259 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:14,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 121 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2024-10-23 20:22:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3325. [2024-10-23 20:22:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3324 states have (on average 1.3231046931407942) internal successors, (4398), 3324 states have internal predecessors, (4398), 0 states have call successors, (0), 0 states 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:22:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4398 transitions. [2024-10-23 20:22:14,558 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4398 transitions. Word has length 181 [2024-10-23 20:22:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:14,558 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 4398 transitions. [2024-10-23 20:22:14,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:22:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4398 transitions. [2024-10-23 20:22:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-23 20:22:14,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:14,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:22:14,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2122533494, now seen corresponding path program 1 times [2024-10-23 20:22:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:14,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939615170] [2024-10-23 20:22:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:22:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:14,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939615170] [2024-10-23 20:22:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939615170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:14,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:14,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:14,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457271446] [2024-10-23 20:22:14,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:14,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:14,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:14,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:14,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:14,755 INFO L87 Difference]: Start difference. First operand 3325 states and 4398 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:22:15,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:15,382 INFO L93 Difference]: Finished difference Result 9925 states and 13143 transitions. [2024-10-23 20:22:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:15,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2024-10-23 20:22:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:15,403 INFO L225 Difference]: With dead ends: 9925 [2024-10-23 20:22:15,404 INFO L226 Difference]: Without dead ends: 6601 [2024-10-23 20:22:15,409 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:22:15,411 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 217 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:15,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 166 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6601 states. [2024-10-23 20:22:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6601 to 5767. [2024-10-23 20:22:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 5766 states have (on average 1.336801942421089) internal successors, (7708), 5766 states have internal predecessors, (7708), 0 states have call successors, (0), 0 states 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:22:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7708 transitions. [2024-10-23 20:22:15,547 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7708 transitions. Word has length 184 [2024-10-23 20:22:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:15,547 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 7708 transitions. [2024-10-23 20:22:15,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:22:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7708 transitions. [2024-10-23 20:22:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-23 20:22:15,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:15,556 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:22:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:22:15,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 441309107, now seen corresponding path program 1 times [2024-10-23 20:22:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004106485] [2024-10-23 20:22:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-23 20:22:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004106485] [2024-10-23 20:22:15,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004106485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:15,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:15,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:15,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288536034] [2024-10-23 20:22:15,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:15,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:15,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:15,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:15,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:15,893 INFO L87 Difference]: Start difference. First operand 5767 states and 7708 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:22:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:16,646 INFO L93 Difference]: Finished difference Result 15633 states and 21100 transitions. [2024-10-23 20:22:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:16,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2024-10-23 20:22:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:16,674 INFO L225 Difference]: With dead ends: 15633 [2024-10-23 20:22:16,675 INFO L226 Difference]: Without dead ends: 9867 [2024-10-23 20:22:16,682 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:22:16,683 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:16,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 186 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:22:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2024-10-23 20:22:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9642. [2024-10-23 20:22:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9642 states, 9641 states have (on average 1.356498288559278) internal successors, (13078), 9641 states have internal predecessors, (13078), 0 states have call successors, (0), 0 states 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:22:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9642 states to 9642 states and 13078 transitions. [2024-10-23 20:22:16,843 INFO L78 Accepts]: Start accepts. Automaton has 9642 states and 13078 transitions. Word has length 201 [2024-10-23 20:22:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 9642 states and 13078 transitions. [2024-10-23 20:22:16,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:22:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9642 states and 13078 transitions. [2024-10-23 20:22:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-23 20:22:16,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:16,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:16,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:22:16,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1860750151, now seen corresponding path program 1 times [2024-10-23 20:22:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:16,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703929611] [2024-10-23 20:22:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-23 20:22:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703929611] [2024-10-23 20:22:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703929611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790370018] [2024-10-23 20:22:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:17,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:17,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:17,173 INFO L87 Difference]: Start difference. First operand 9642 states and 13078 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 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:22:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:17,893 INFO L93 Difference]: Finished difference Result 22543 states and 30609 transitions. [2024-10-23 20:22:17,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 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 203 [2024-10-23 20:22:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:17,928 INFO L225 Difference]: With dead ends: 22543 [2024-10-23 20:22:17,928 INFO L226 Difference]: Without dead ends: 12902 [2024-10-23 20:22:17,936 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:22:17,937 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 204 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:17,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 171 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2024-10-23 20:22:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 12890. [2024-10-23 20:22:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12890 states, 12889 states have (on average 1.332454030568702) internal successors, (17174), 12889 states have internal predecessors, (17174), 0 states have call successors, (0), 0 states 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:22:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12890 states to 12890 states and 17174 transitions. [2024-10-23 20:22:18,128 INFO L78 Accepts]: Start accepts. Automaton has 12890 states and 17174 transitions. Word has length 203 [2024-10-23 20:22:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:18,128 INFO L471 AbstractCegarLoop]: Abstraction has 12890 states and 17174 transitions. [2024-10-23 20:22:18,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 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:22:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 12890 states and 17174 transitions. [2024-10-23 20:22:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-23 20:22:18,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:18,141 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:18,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:22:18,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:18,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1435855960, now seen corresponding path program 1 times [2024-10-23 20:22:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:18,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092169238] [2024-10-23 20:22:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-23 20:22:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092169238] [2024-10-23 20:22:18,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092169238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:18,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:18,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:18,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123471485] [2024-10-23 20:22:18,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:18,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:18,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:18,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:18,493 INFO L87 Difference]: Start difference. First operand 12890 states and 17174 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:22:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:19,139 INFO L93 Difference]: Finished difference Result 28631 states and 37900 transitions. [2024-10-23 20:22:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:19,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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 204 [2024-10-23 20:22:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:19,171 INFO L225 Difference]: With dead ends: 28631 [2024-10-23 20:22:19,172 INFO L226 Difference]: Without dead ends: 16352 [2024-10-23 20:22:19,184 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:22:19,185 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 205 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:19,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 157 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16352 states. [2024-10-23 20:22:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16352 to 16349. [2024-10-23 20:22:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16349 states, 16348 states have (on average 1.3137386836310252) internal successors, (21477), 16348 states have internal predecessors, (21477), 0 states have call successors, (0), 0 states 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:22:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16349 states to 16349 states and 21477 transitions. [2024-10-23 20:22:19,475 INFO L78 Accepts]: Start accepts. Automaton has 16349 states and 21477 transitions. Word has length 204 [2024-10-23 20:22:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:19,476 INFO L471 AbstractCegarLoop]: Abstraction has 16349 states and 21477 transitions. [2024-10-23 20:22:19,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:22:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 16349 states and 21477 transitions. [2024-10-23 20:22:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-23 20:22:19,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:19,494 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:19,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 20:22:19,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:19,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2089782948, now seen corresponding path program 1 times [2024-10-23 20:22:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:19,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981808661] [2024-10-23 20:22:19,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:19,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-23 20:22:19,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:19,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981808661] [2024-10-23 20:22:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981808661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:19,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:22:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597729765] [2024-10-23 20:22:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:19,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:19,709 INFO L87 Difference]: Start difference. First operand 16349 states and 21477 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:22:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:20,474 INFO L93 Difference]: Finished difference Result 37379 states and 48885 transitions. [2024-10-23 20:22:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:20,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 206 [2024-10-23 20:22:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:20,509 INFO L225 Difference]: With dead ends: 37379 [2024-10-23 20:22:20,510 INFO L226 Difference]: Without dead ends: 21641 [2024-10-23 20:22:20,525 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:22:20,526 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 203 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:20,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 420 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21641 states. [2024-10-23 20:22:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21641 to 21637. [2024-10-23 20:22:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21637 states, 21636 states have (on average 1.271630615640599) internal successors, (27513), 21636 states have internal predecessors, (27513), 0 states have call successors, (0), 0 states 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:22:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21637 states to 21637 states and 27513 transitions. [2024-10-23 20:22:20,770 INFO L78 Accepts]: Start accepts. Automaton has 21637 states and 27513 transitions. Word has length 206 [2024-10-23 20:22:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:20,770 INFO L471 AbstractCegarLoop]: Abstraction has 21637 states and 27513 transitions. [2024-10-23 20:22:20,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:22:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 21637 states and 27513 transitions. [2024-10-23 20:22:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-23 20:22:20,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:20,790 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:20,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 20:22:20,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:20,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash -313899800, now seen corresponding path program 1 times [2024-10-23 20:22:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:20,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185014681] [2024-10-23 20:22:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-23 20:22:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185014681] [2024-10-23 20:22:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185014681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:22:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369875995] [2024-10-23 20:22:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:21,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:22:21,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:22:21,189 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:22:21,190 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:22:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:21,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:22:21,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:22:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-23 20:22:21,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:22:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369875995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:22:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-23 20:22:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769592383] [2024-10-23 20:22:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:21,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:21,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:22:21,415 INFO L87 Difference]: Start difference. First operand 21637 states and 27513 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:22:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:22,214 INFO L93 Difference]: Finished difference Result 54469 states and 69462 transitions. [2024-10-23 20:22:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:22,215 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 210 [2024-10-23 20:22:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:22,259 INFO L225 Difference]: With dead ends: 54469 [2024-10-23 20:22:22,259 INFO L226 Difference]: Without dead ends: 33036 [2024-10-23 20:22:22,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:22:22,273 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 233 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:22,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 166 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33036 states. [2024-10-23 20:22:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33036 to 30799. [2024-10-23 20:22:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30799 states, 30798 states have (on average 1.2555036041301384) internal successors, (38667), 30798 states have internal predecessors, (38667), 0 states have call successors, (0), 0 states 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:22:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30799 states to 30799 states and 38667 transitions. [2024-10-23 20:22:22,627 INFO L78 Accepts]: Start accepts. Automaton has 30799 states and 38667 transitions. Word has length 210 [2024-10-23 20:22:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:22,627 INFO L471 AbstractCegarLoop]: Abstraction has 30799 states and 38667 transitions. [2024-10-23 20:22:22,627 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:22:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30799 states and 38667 transitions. [2024-10-23 20:22:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-23 20:22:22,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:22,652 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:22:22,670 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:22:22,853 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:22:22,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -419154697, now seen corresponding path program 1 times [2024-10-23 20:22:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:22,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523751455] [2024-10-23 20:22:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-23 20:22:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523751455] [2024-10-23 20:22:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523751455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:22:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068719930] [2024-10-23 20:22:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:23,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:23,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:23,308 INFO L87 Difference]: Start difference. First operand 30799 states and 38667 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 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:22:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:24,140 INFO L93 Difference]: Finished difference Result 63039 states and 78983 transitions. [2024-10-23 20:22:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 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 218 [2024-10-23 20:22:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:24,193 INFO L225 Difference]: With dead ends: 63039 [2024-10-23 20:22:24,193 INFO L226 Difference]: Without dead ends: 37532 [2024-10-23 20:22:24,218 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:22:24,219 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:24,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 209 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37532 states. [2024-10-23 20:22:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37532 to 37518. [2024-10-23 20:22:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37518 states, 37517 states have (on average 1.2423701255430872) internal successors, (46610), 37517 states have internal predecessors, (46610), 0 states have call successors, (0), 0 states 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:22:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37518 states to 37518 states and 46610 transitions. [2024-10-23 20:22:24,694 INFO L78 Accepts]: Start accepts. Automaton has 37518 states and 46610 transitions. Word has length 218 [2024-10-23 20:22:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:24,694 INFO L471 AbstractCegarLoop]: Abstraction has 37518 states and 46610 transitions. [2024-10-23 20:22:24,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 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:22:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 37518 states and 46610 transitions. [2024-10-23 20:22:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-23 20:22:24,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:24,715 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:24,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 20:22:24,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -971579160, now seen corresponding path program 1 times [2024-10-23 20:22:24,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:24,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347556261] [2024-10-23 20:22:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-23 20:22:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347556261] [2024-10-23 20:22:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347556261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:22:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027004173] [2024-10-23 20:22:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:25,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:22:25,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:22:25,086 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:22:25,088 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:22:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:25,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:22:25,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:22:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:22:25,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:22:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027004173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:22:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:22:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569807954] [2024-10-23 20:22:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:25,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:22:25,252 INFO L87 Difference]: Start difference. First operand 37518 states and 46610 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states 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:22:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:26,037 INFO L93 Difference]: Finished difference Result 87420 states and 110637 transitions. [2024-10-23 20:22:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 225 [2024-10-23 20:22:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:26,100 INFO L225 Difference]: With dead ends: 87420 [2024-10-23 20:22:26,100 INFO L226 Difference]: Without dead ends: 50716 [2024-10-23 20:22:26,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:22:26,128 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 227 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:26,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 165 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50716 states. [2024-10-23 20:22:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50716 to 50713. [2024-10-23 20:22:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50713 states, 50712 states have (on average 1.2063811326707683) internal successors, (61178), 50712 states have internal predecessors, (61178), 0 states have call successors, (0), 0 states 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:22:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50713 states to 50713 states and 61178 transitions. [2024-10-23 20:22:26,979 INFO L78 Accepts]: Start accepts. Automaton has 50713 states and 61178 transitions. Word has length 225 [2024-10-23 20:22:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:26,979 INFO L471 AbstractCegarLoop]: Abstraction has 50713 states and 61178 transitions. [2024-10-23 20:22:26,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states 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:22:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 50713 states and 61178 transitions. [2024-10-23 20:22:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-23 20:22:26,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:26,998 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:27,012 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:22:27,198 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:22:27,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:27,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1037532356, now seen corresponding path program 1 times [2024-10-23 20:22:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:27,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881194149] [2024-10-23 20:22:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:27,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-23 20:22:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881194149] [2024-10-23 20:22:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881194149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:27,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:22:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794258305] [2024-10-23 20:22:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:27,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:27,624 INFO L87 Difference]: Start difference. First operand 50713 states and 61178 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 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:22:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:28,436 INFO L93 Difference]: Finished difference Result 100828 states and 121853 transitions. [2024-10-23 20:22:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 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 229 [2024-10-23 20:22:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:28,498 INFO L225 Difference]: With dead ends: 100828 [2024-10-23 20:22:28,498 INFO L226 Difference]: Without dead ends: 51743 [2024-10-23 20:22:28,527 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:22:28,528 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:28,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 399 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51743 states. [2024-10-23 20:22:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51743 to 43999. [2024-10-23 20:22:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43999 states, 43998 states have (on average 1.2026228464930224) internal successors, (52913), 43998 states have internal predecessors, (52913), 0 states have call successors, (0), 0 states 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:22:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43999 states to 43999 states and 52913 transitions. [2024-10-23 20:22:29,238 INFO L78 Accepts]: Start accepts. Automaton has 43999 states and 52913 transitions. Word has length 229 [2024-10-23 20:22:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:29,238 INFO L471 AbstractCegarLoop]: Abstraction has 43999 states and 52913 transitions. [2024-10-23 20:22:29,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 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:22:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43999 states and 52913 transitions. [2024-10-23 20:22:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-23 20:22:29,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:29,263 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:22:29,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 20:22:29,263 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1781815820, now seen corresponding path program 1 times [2024-10-23 20:22:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505425023] [2024-10-23 20:22:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 96 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-23 20:22:29,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:29,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505425023] [2024-10-23 20:22:29,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505425023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:22:29,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551507280] [2024-10-23 20:22:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:29,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:22:29,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:22:29,749 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:22:29,749 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:22:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:29,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:22:29,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:22:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-23 20:22:29,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:22:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551507280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:29,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:22:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:22:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026859318] [2024-10-23 20:22:29,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:29,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:29,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:22:29,901 INFO L87 Difference]: Start difference. First operand 43999 states and 52913 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:22:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:30,576 INFO L93 Difference]: Finished difference Result 86982 states and 104686 transitions. [2024-10-23 20:22:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2024-10-23 20:22:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:30,629 INFO L225 Difference]: With dead ends: 86982 [2024-10-23 20:22:30,629 INFO L226 Difference]: Without dead ends: 43797 [2024-10-23 20:22:30,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:22:30,654 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 259 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:30,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 95 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:22:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43797 states. [2024-10-23 20:22:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43797 to 43794. [2024-10-23 20:22:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43794 states, 43793 states have (on average 1.1898933619528236) internal successors, (52109), 43793 states have internal predecessors, (52109), 0 states have call successors, (0), 0 states 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:22:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43794 states to 43794 states and 52109 transitions. [2024-10-23 20:22:31,139 INFO L78 Accepts]: Start accepts. Automaton has 43794 states and 52109 transitions. Word has length 245 [2024-10-23 20:22:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:31,139 INFO L471 AbstractCegarLoop]: Abstraction has 43794 states and 52109 transitions. [2024-10-23 20:22:31,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:22:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 43794 states and 52109 transitions. [2024-10-23 20:22:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-23 20:22:31,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:31,268 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:31,282 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:22:31,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:22:31,469 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:31,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash -354901601, now seen corresponding path program 1 times [2024-10-23 20:22:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516584479] [2024-10-23 20:22:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-23 20:22:31,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:31,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516584479] [2024-10-23 20:22:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516584479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:31,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:31,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:22:31,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031905040] [2024-10-23 20:22:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:31,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:22:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:31,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:22:31,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:22:31,785 INFO L87 Difference]: Start difference. First operand 43794 states and 52109 transitions. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:22:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:32,815 INFO L93 Difference]: Finished difference Result 86808 states and 103379 transitions. [2024-10-23 20:22:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:22:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 245 [2024-10-23 20:22:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:32,860 INFO L225 Difference]: With dead ends: 86808 [2024-10-23 20:22:32,860 INFO L226 Difference]: Without dead ends: 43828 [2024-10-23 20:22:32,884 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:22:32,885 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 409 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:32,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 166 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 20:22:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43828 states. [2024-10-23 20:22:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43828 to 42371. [2024-10-23 20:22:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42371 states, 42370 states have (on average 1.1922822751947133) internal successors, (50517), 42370 states have internal predecessors, (50517), 0 states have call successors, (0), 0 states 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:22:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42371 states to 42371 states and 50517 transitions. [2024-10-23 20:22:33,434 INFO L78 Accepts]: Start accepts. Automaton has 42371 states and 50517 transitions. Word has length 245 [2024-10-23 20:22:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:33,435 INFO L471 AbstractCegarLoop]: Abstraction has 42371 states and 50517 transitions. [2024-10-23 20:22:33,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:22:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 42371 states and 50517 transitions. [2024-10-23 20:22:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-23 20:22:33,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:33,452 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:33,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 20:22:33,453 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:33,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2059729138, now seen corresponding path program 1 times [2024-10-23 20:22:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:33,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634551795] [2024-10-23 20:22:33,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-23 20:22:33,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634551795] [2024-10-23 20:22:33,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634551795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:22:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160894925] [2024-10-23 20:22:33,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:33,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:22:33,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:22:33,806 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:22:33,809 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:22:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:33,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:22:33,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:22:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-23 20:22:33,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:22:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160894925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:33,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:22:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:22:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677233631] [2024-10-23 20:22:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:33,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:33,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:33,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:22:33,970 INFO L87 Difference]: Start difference. First operand 42371 states and 50517 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:22:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:34,713 INFO L93 Difference]: Finished difference Result 82333 states and 97985 transitions. [2024-10-23 20:22:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:34,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 252 [2024-10-23 20:22:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:34,757 INFO L225 Difference]: With dead ends: 82333 [2024-10-23 20:22:34,757 INFO L226 Difference]: Without dead ends: 40369 [2024-10-23 20:22:34,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 251 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:22:34,785 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:34,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 386 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:22:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40369 states. [2024-10-23 20:22:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40369 to 40341. [2024-10-23 20:22:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40341 states, 40340 states have (on average 1.1754833911750124) internal successors, (47419), 40340 states have internal predecessors, (47419), 0 states have call successors, (0), 0 states 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:22:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40341 states to 40341 states and 47419 transitions. [2024-10-23 20:22:35,412 INFO L78 Accepts]: Start accepts. Automaton has 40341 states and 47419 transitions. Word has length 252 [2024-10-23 20:22:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:35,412 INFO L471 AbstractCegarLoop]: Abstraction has 40341 states and 47419 transitions. [2024-10-23 20:22:35,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:22:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 40341 states and 47419 transitions. [2024-10-23 20:22:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-23 20:22:35,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:35,437 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:35,450 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:22:35,637 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:22:35,638 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:35,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -490432303, now seen corresponding path program 1 times [2024-10-23 20:22:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589422218] [2024-10-23 20:22:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 113 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-23 20:22:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589422218] [2024-10-23 20:22:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589422218] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:22:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316105246] [2024-10-23 20:22:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:36,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:22:36,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:22:36,682 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:22:36,683 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:22:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:36,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:22:36,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:22:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-23 20:22:36,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:22:36,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316105246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:36,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:22:36,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 20:22:36,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530790697] [2024-10-23 20:22:36,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:36,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:36,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:36,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:22:36,960 INFO L87 Difference]: Start difference. First operand 40341 states and 47419 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 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:22:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:37,679 INFO L93 Difference]: Finished difference Result 97606 states and 115387 transitions. [2024-10-23 20:22:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:37,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 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 263 [2024-10-23 20:22:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:37,746 INFO L225 Difference]: With dead ends: 97606 [2024-10-23 20:22:37,747 INFO L226 Difference]: Without dead ends: 57876 [2024-10-23 20:22:37,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:22:37,771 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 112 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:37,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 166 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:22:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57876 states. [2024-10-23 20:22:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57876 to 57862. [2024-10-23 20:22:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57862 states, 57861 states have (on average 1.1681616287309242) internal successors, (67591), 57861 states have internal predecessors, (67591), 0 states have call successors, (0), 0 states 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:22:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57862 states to 57862 states and 67591 transitions. [2024-10-23 20:22:38,554 INFO L78 Accepts]: Start accepts. Automaton has 57862 states and 67591 transitions. Word has length 263 [2024-10-23 20:22:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:38,554 INFO L471 AbstractCegarLoop]: Abstraction has 57862 states and 67591 transitions. [2024-10-23 20:22:38,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 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:22:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 57862 states and 67591 transitions. [2024-10-23 20:22:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-23 20:22:38,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:38,596 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:22:38,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-23 20:22:38,797 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,SelfDestructingSolverStorable17 [2024-10-23 20:22:38,798 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:38,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1401364925, now seen corresponding path program 1 times [2024-10-23 20:22:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811562829] [2024-10-23 20:22:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:22:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:38,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811562829] [2024-10-23 20:22:38,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811562829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:38,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:38,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:22:38,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121319699] [2024-10-23 20:22:38,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:38,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:38,946 INFO L87 Difference]: Start difference. First operand 57862 states and 67591 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:22:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:39,823 INFO L93 Difference]: Finished difference Result 108978 states and 126986 transitions. [2024-10-23 20:22:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:39,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2024-10-23 20:22:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:39,885 INFO L225 Difference]: With dead ends: 108978 [2024-10-23 20:22:39,885 INFO L226 Difference]: Without dead ends: 51727 [2024-10-23 20:22:39,901 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:22:39,902 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 255 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:39,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 373 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:22:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51727 states. [2024-10-23 20:22:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51727 to 46028. [2024-10-23 20:22:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46028 states, 46027 states have (on average 1.1303148152171552) internal successors, (52025), 46027 states have internal predecessors, (52025), 0 states have call successors, (0), 0 states 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:22:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46028 states to 46028 states and 52025 transitions. [2024-10-23 20:22:40,535 INFO L78 Accepts]: Start accepts. Automaton has 46028 states and 52025 transitions. Word has length 277 [2024-10-23 20:22:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:40,536 INFO L471 AbstractCegarLoop]: Abstraction has 46028 states and 52025 transitions. [2024-10-23 20:22:40,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:22:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 46028 states and 52025 transitions. [2024-10-23 20:22:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-10-23 20:22:40,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:40,572 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:22:40,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 20:22:40,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -861670291, now seen corresponding path program 1 times [2024-10-23 20:22:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328463692] [2024-10-23 20:22:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-23 20:22:40,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:40,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328463692] [2024-10-23 20:22:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328463692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:22:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934274225] [2024-10-23 20:22:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:40,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:40,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:40,753 INFO L87 Difference]: Start difference. First operand 46028 states and 52025 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:22:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:41,241 INFO L93 Difference]: Finished difference Result 80012 states and 90185 transitions. [2024-10-23 20:22:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:41,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 293 [2024-10-23 20:22:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:41,286 INFO L225 Difference]: With dead ends: 80012 [2024-10-23 20:22:41,286 INFO L226 Difference]: Without dead ends: 35000 [2024-10-23 20:22:41,319 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:22:41,320 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 328 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:41,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 29 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:22:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35000 states. [2024-10-23 20:22:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35000 to 30735. [2024-10-23 20:22:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30735 states, 30734 states have (on average 1.1155397930630573) internal successors, (34285), 30734 states have internal predecessors, (34285), 0 states have call successors, (0), 0 states 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:22:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30735 states to 30735 states and 34285 transitions. [2024-10-23 20:22:41,860 INFO L78 Accepts]: Start accepts. Automaton has 30735 states and 34285 transitions. Word has length 293 [2024-10-23 20:22:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:41,861 INFO L471 AbstractCegarLoop]: Abstraction has 30735 states and 34285 transitions. [2024-10-23 20:22:41,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:22:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 30735 states and 34285 transitions. [2024-10-23 20:22:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-10-23 20:22:41,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:22:41,879 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:41,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-23 20:22:41,879 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:22:41,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:22:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash -323816198, now seen corresponding path program 1 times [2024-10-23 20:22:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:22:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352336508] [2024-10-23 20:22:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:22:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:22:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:22:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-23 20:22:42,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:22:42,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352336508] [2024-10-23 20:22:42,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352336508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:22:42,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:22:42,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:22:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579065170] [2024-10-23 20:22:42,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:22:42,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:22:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:22:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:22:42,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:22:42,024 INFO L87 Difference]: Start difference. First operand 30735 states and 34285 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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:22:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:22:42,692 INFO L93 Difference]: Finished difference Result 53326 states and 59203 transitions. [2024-10-23 20:22:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:22:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 311 [2024-10-23 20:22:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:22:42,695 INFO L225 Difference]: With dead ends: 53326 [2024-10-23 20:22:42,695 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:22:42,707 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:22:42,708 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 216 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:22:42,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 341 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:22:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:22:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:22:42,708 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:22:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:22:42,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 311 [2024-10-23 20:22:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:22:42,709 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:22:42,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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:22:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:22:42,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:22:42,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:22:42,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-23 20:22:42,715 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] [2024-10-23 20:22:42,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:22:45,109 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:22:45,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:22:45 BoogieIcfgContainer [2024-10-23 20:22:45,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:22:45,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:22:45,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:22:45,141 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:22:45,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:22:09" (3/4) ... [2024-10-23 20:22:45,143 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:22:45,160 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:22:45,161 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:22:45,163 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:22:45,164 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:22:45,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:22:45,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:22:45,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:22:45,330 INFO L158 Benchmark]: Toolchain (without parser) took 38292.66ms. Allocated memory was 182.5MB in the beginning and 9.5GB in the end (delta: 9.4GB). Free memory was 145.6MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-10-23 20:22:45,331 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:22:45,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.37ms. Allocated memory is still 182.5MB. Free memory was 145.6MB in the beginning and 80.6MB in the end (delta: 65.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-10-23 20:22:45,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.11ms. Allocated memory is still 182.5MB. Free memory was 80.6MB in the beginning and 64.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 20:22:45,331 INFO L158 Benchmark]: Boogie Preprocessor took 121.49ms. Allocated memory is still 182.5MB. Free memory was 64.9MB in the beginning and 52.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:22:45,332 INFO L158 Benchmark]: RCFGBuilder took 1714.17ms. Allocated memory was 182.5MB in the beginning and 289.4MB in the end (delta: 107.0MB). Free memory was 52.3MB in the beginning and 163.1MB in the end (delta: -110.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-10-23 20:22:45,332 INFO L158 Benchmark]: TraceAbstraction took 35493.70ms. Allocated memory was 289.4MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 162.1MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-10-23 20:22:45,332 INFO L158 Benchmark]: Witness Printer took 188.62ms. Allocated memory is still 9.5GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 20:22:45,334 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.08ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.37ms. Allocated memory is still 182.5MB. Free memory was 145.6MB in the beginning and 80.6MB in the end (delta: 65.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.11ms. Allocated memory is still 182.5MB. Free memory was 80.6MB in the beginning and 64.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.49ms. Allocated memory is still 182.5MB. Free memory was 64.9MB in the beginning and 52.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1714.17ms. Allocated memory was 182.5MB in the beginning and 289.4MB in the end (delta: 107.0MB). Free memory was 52.3MB in the beginning and 163.1MB in the end (delta: -110.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * TraceAbstraction took 35493.70ms. Allocated memory was 289.4MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 162.1MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 188.62ms. Allocated memory is still 9.5GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 27.3MB). 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: 1522]: 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: 33.0s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4542 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4542 mSDsluCounter, 4760 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 1926 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12656 IncrementalHoareTripleChecker+Invalid, 14582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1926 mSolverCounterUnsat, 4265 mSDtfsCounter, 12656 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1245 GetRequests, 1213 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57862occurred in iteration=18, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 22569 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 5799 NumberOfCodeBlocks, 5799 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5773 ConstructedInterpolants, 0 QuantifiedInterpolants, 10583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2533 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 2731/2761 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 == 0) && (a5 == 1)) && (1 <= a3)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) || (((((a5 == 1) && (a12 == 1)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || (((((a5 == 1) && (a12 == 1)) && (a6 == 0)) && (a3 == 1)) && (a27 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((((a26 == 0) && (a5 == 1)) && (1 <= a3)) && (a6 == 0)) && (a12 <= 0)) && (a27 <= 0))) || (((((a5 == 1) && (1 <= a3)) && (a6 == 1)) && (a12 <= 0)) && (a27 <= 0))) || ((a5 == 1) && (((((a6 == 1) && (a12 <= 0)) && (a3 == 0)) && (a27 <= 0)) || ((((a6 == 1) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0))))) || (((((a5 == 1) && (a6 == 0)) && (a3 == 1)) && (a12 <= 0)) && (a27 <= 0))) || (((((a5 == 1) && (1 <= a3)) && (a6 == 0)) && (a12 <= 0)) && (a27 == 1))) || (((((a5 == 1) && (a12 == 1)) && (a6 == 1)) && (a3 == 0)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a6 == 0)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a6 == 0)) && (a11 <= 0)) && (a27 == 1))) || (((((a5 == 1) && (a6 == 0)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a11 == 1)) && (a6 == 0)) && (a27 == 1))) || ((((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a8 == 0)) && (a16 == 1)) && (a6 == 1)) && (a27 <= 0))) || (((((a5 == 1) && (a6 == 0)) && (a12 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 == 1))) || (((((a5 == 1) && (a12 == 1)) && (1 <= a3)) && (a6 == 1)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a5 == 1) && (1 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1))) || ((((((a26 == 0) && (a5 == 1)) && (a6 == 0)) && (a11 <= 0)) && (a12 <= 0)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1))) || ((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (a6 == 0)) && (a3 == 0)) && (a27 <= 0))) || (((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a6 == 0)) && (a11 == 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a6 == 0)) && (a3 == 0)) && (a27 <= 0))) || (((((a5 == 1) && (a3 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:22:45,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE