./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label37.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/Problem11_label37.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 06fd550ecd237ab8f8345f0996e38c68877e3b04d04ee5f9440f9cffb12d9fc8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:03:06,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:03:06,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:03:06,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:03:06,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:03:06,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:03:06,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:03:06,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:03:06,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:03:06,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:03:06,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:03:06,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:03:06,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:03:06,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:03:06,353 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:03:06,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:03:06,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:03:06,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:03:06,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:03:06,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:03:06,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:03:06,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:03:06,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:03:06,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:03:06,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:03:06,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:03:06,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:03:06,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:03:06,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:03:06,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:03:06,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:03:06,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:03:06,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:03:06,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:03:06,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:03:06,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:03:06,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:03:06,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:03:06,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:03:06,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:03:06,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:03:06,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:03:06,365 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 -> 06fd550ecd237ab8f8345f0996e38c68877e3b04d04ee5f9440f9cffb12d9fc8 [2024-10-23 21:03:06,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:03:06,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:03:06,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:03:06,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:03:06,623 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:03:06,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label37.c [2024-10-23 21:03:07,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:03:08,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:03:08,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label37.c [2024-10-23 21:03:08,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16fee1401/c73ca31340844c7a9d92fa3a09692a4f/FLAGf37be3340 [2024-10-23 21:03:08,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16fee1401/c73ca31340844c7a9d92fa3a09692a4f [2024-10-23 21:03:08,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:03:08,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:03:08,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:03:08,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:03:08,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:03:08,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:03:08" (1/1) ... [2024-10-23 21:03:08,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e68e54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:08, skipping insertion in model container [2024-10-23 21:03:08,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:03:08" (1/1) ... [2024-10-23 21:03:08,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:03:08,766 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label37.c[7136,7149] [2024-10-23 21:03:08,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:03:08,939 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:03:08,962 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label37.c[7136,7149] [2024-10-23 21:03:09,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:03:09,050 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:03:09,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09 WrapperNode [2024-10-23 21:03:09,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:03:09,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:03:09,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:03:09,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:03:09,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,158 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-23 21:03:09,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:03:09,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:03:09,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:03:09,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:03:09,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,227 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 21:03:09,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:03:09,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:03:09,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:03:09,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:03:09,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (1/1) ... [2024-10-23 21:03:09,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:03:09,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:03:09,383 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 21:03:09,386 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 21:03:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:03:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:03:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:03:09,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:03:09,478 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:03:09,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:03:10,643 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-23 21:03:10,644 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:03:10,683 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:03:10,683 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:03:10,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:03:10 BoogieIcfgContainer [2024-10-23 21:03:10,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:03:10,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:03:10,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:03:10,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:03:10,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:03:08" (1/3) ... [2024-10-23 21:03:10,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef80c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:03:10, skipping insertion in model container [2024-10-23 21:03:10,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:03:09" (2/3) ... [2024-10-23 21:03:10,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef80c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:03:10, skipping insertion in model container [2024-10-23 21:03:10,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:03:10" (3/3) ... [2024-10-23 21:03:10,690 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label37.c [2024-10-23 21:03:10,703 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:03:10,704 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:03:10,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:03:10,777 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;@6d1615a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:03:10,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:03:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:03:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-23 21:03:10,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:10,791 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] [2024-10-23 21:03:10,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:10,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -479020460, now seen corresponding path program 1 times [2024-10-23 21:03:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:10,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018377378] [2024-10-23 21:03:10,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:11,021 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 21:03:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018377378] [2024-10-23 21:03:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018377378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:11,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:03:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894153768] [2024-10-23 21:03:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:11,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:03:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:03:11,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:03:11,078 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 21:03:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:11,110 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-23 21:03:11,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:03:11,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-23 21:03:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:11,126 INFO L225 Difference]: With dead ends: 441 [2024-10-23 21:03:11,126 INFO L226 Difference]: Without dead ends: 219 [2024-10-23 21:03:11,129 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 21:03:11,131 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:11,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:03:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-23 21:03:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-23 21:03:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:03:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-23 21:03:11,165 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 48 [2024-10-23 21:03:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:11,165 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-23 21:03:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 21:03:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-23 21:03:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-23 21:03:11,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:11,167 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] [2024-10-23 21:03:11,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:03:11,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:11,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash -56292362, now seen corresponding path program 1 times [2024-10-23 21:03:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:11,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228474223] [2024-10-23 21:03:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:11,352 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 21:03:11,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:11,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228474223] [2024-10-23 21:03:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228474223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:11,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:11,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:03:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464435199] [2024-10-23 21:03:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:11,358 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 21:03:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:12,119 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2024-10-23 21:03:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-23 21:03:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:12,125 INFO L225 Difference]: With dead ends: 630 [2024-10-23 21:03:12,126 INFO L226 Difference]: Without dead ends: 412 [2024-10-23 21:03:12,126 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 21:03:12,127 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 175 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:12,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 155 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:03:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-23 21:03:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-23 21:03:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 0 states have call successors, (0), 0 states 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 21:03:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2024-10-23 21:03:12,171 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 48 [2024-10-23 21:03:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2024-10-23 21:03:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 21:03:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2024-10-23 21:03:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-23 21:03:12,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:12,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:03:12,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:03:12,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1818755325, now seen corresponding path program 1 times [2024-10-23 21:03:12,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:12,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337410658] [2024-10-23 21:03:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:03:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337410658] [2024-10-23 21:03:12,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337410658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:12,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:12,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:03:12,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366775592] [2024-10-23 21:03:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:12,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:12,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:12,337 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 21:03:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:12,976 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2024-10-23 21:03:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-23 21:03:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:12,979 INFO L225 Difference]: With dead ends: 1210 [2024-10-23 21:03:12,979 INFO L226 Difference]: Without dead ends: 799 [2024-10-23 21:03:12,980 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 21:03:12,981 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:12,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 118 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:03:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-23 21:03:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2024-10-23 21:03:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states 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 21:03:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2024-10-23 21:03:13,007 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 116 [2024-10-23 21:03:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:13,007 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2024-10-23 21:03:13,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 21:03:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2024-10-23 21:03:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-23 21:03:13,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:13,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:03:13,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:03:13,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:13,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2002074686, now seen corresponding path program 1 times [2024-10-23 21:03:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075059380] [2024-10-23 21:03:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:03:13,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075059380] [2024-10-23 21:03:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075059380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:03:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194913738] [2024-10-23 21:03:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:13,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:13,330 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 21:03:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:13,948 INFO L93 Difference]: Finished difference Result 1944 states and 2611 transitions. [2024-10-23 21:03:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:13,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-23 21:03:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:13,952 INFO L225 Difference]: With dead ends: 1944 [2024-10-23 21:03:13,952 INFO L226 Difference]: Without dead ends: 1157 [2024-10-23 21:03:13,953 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 21:03:13,954 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:13,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:03:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-23 21:03:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-23 21:03:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.270995670995671) internal successors, (1468), 1155 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states 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 21:03:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1468 transitions. [2024-10-23 21:03:13,974 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1468 transitions. Word has length 118 [2024-10-23 21:03:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:13,975 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1468 transitions. [2024-10-23 21:03:13,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 21:03:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1468 transitions. [2024-10-23 21:03:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-23 21:03:13,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:13,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:03:13,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:03:13,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:13,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash 934394696, now seen corresponding path program 1 times [2024-10-23 21:03:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226242116] [2024-10-23 21:03:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:03:14,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:14,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226242116] [2024-10-23 21:03:14,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226242116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:14,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:14,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:03:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071978566] [2024-10-23 21:03:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:14,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:03:14,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:14,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:03:14,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:03:14,208 INFO L87 Difference]: Start difference. First operand 1156 states and 1468 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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 21:03:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:15,317 INFO L93 Difference]: Finished difference Result 3444 states and 4563 transitions. [2024-10-23 21:03:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:03:15,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-10-23 21:03:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:15,324 INFO L225 Difference]: With dead ends: 3444 [2024-10-23 21:03:15,324 INFO L226 Difference]: Without dead ends: 2473 [2024-10-23 21:03:15,325 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 21:03:15,326 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 345 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:15,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 84 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-23 21:03:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-10-23 21:03:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2472. [2024-10-23 21:03:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2471 states have (on average 1.2869283690813436) internal successors, (3180), 2471 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states 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 21:03:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3180 transitions. [2024-10-23 21:03:15,359 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3180 transitions. Word has length 175 [2024-10-23 21:03:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:15,360 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 3180 transitions. [2024-10-23 21:03:15,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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 21:03:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3180 transitions. [2024-10-23 21:03:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-23 21:03:15,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:15,363 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:15,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:03:15,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1416325701, now seen corresponding path program 1 times [2024-10-23 21:03:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396398745] [2024-10-23 21:03:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:15,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-23 21:03:15,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396398745] [2024-10-23 21:03:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396398745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:15,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:15,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:03:15,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935406535] [2024-10-23 21:03:15,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:15,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:15,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:15,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:15,600 INFO L87 Difference]: Start difference. First operand 2472 states and 3180 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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 21:03:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:16,267 INFO L93 Difference]: Finished difference Result 5689 states and 7505 transitions. [2024-10-23 21:03:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 230 [2024-10-23 21:03:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:16,280 INFO L225 Difference]: With dead ends: 5689 [2024-10-23 21:03:16,281 INFO L226 Difference]: Without dead ends: 3586 [2024-10-23 21:03:16,285 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 21:03:16,286 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 148 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:16,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 390 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:03:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2024-10-23 21:03:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3577. [2024-10-23 21:03:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3576 states have (on average 1.2502796420581654) internal successors, (4471), 3576 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states 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 21:03:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4471 transitions. [2024-10-23 21:03:16,342 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4471 transitions. Word has length 230 [2024-10-23 21:03:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:16,342 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 4471 transitions. [2024-10-23 21:03:16,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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 21:03:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4471 transitions. [2024-10-23 21:03:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-23 21:03:16,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:16,347 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:16,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:03:16,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 355261524, now seen corresponding path program 1 times [2024-10-23 21:03:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10457917] [2024-10-23 21:03:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-23 21:03:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10457917] [2024-10-23 21:03:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10457917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:03:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974226471] [2024-10-23 21:03:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:03:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:03:16,846 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 21:03:16,847 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 21:03:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:16,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:03:16,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:03:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-23 21:03:17,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:03:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974226471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:17,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:03:17,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:03:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357348144] [2024-10-23 21:03:17,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:17,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:03:17,050 INFO L87 Difference]: Start difference. First operand 3577 states and 4471 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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 21:03:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:17,732 INFO L93 Difference]: Finished difference Result 9362 states and 11938 transitions. [2024-10-23 21:03:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:17,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 236 [2024-10-23 21:03:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:17,748 INFO L225 Difference]: With dead ends: 9362 [2024-10-23 21:03:17,748 INFO L226 Difference]: Without dead ends: 6154 [2024-10-23 21:03:17,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:03:17,753 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 161 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:17,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 143 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:03:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2024-10-23 21:03:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 6154. [2024-10-23 21:03:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6154 states, 6153 states have (on average 1.2351698358524297) internal successors, (7600), 6153 states have internal predecessors, (7600), 0 states have call successors, (0), 0 states 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 21:03:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 7600 transitions. [2024-10-23 21:03:17,825 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 7600 transitions. Word has length 236 [2024-10-23 21:03:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:17,826 INFO L471 AbstractCegarLoop]: Abstraction has 6154 states and 7600 transitions. [2024-10-23 21:03:17,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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 21:03:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 7600 transitions. [2024-10-23 21:03:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-23 21:03:17,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:17,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:03:17,846 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 21:03:18,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:03:18,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:18,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1494509389, now seen corresponding path program 1 times [2024-10-23 21:03:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:18,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697252036] [2024-10-23 21:03:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-23 21:03:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697252036] [2024-10-23 21:03:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697252036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:18,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:18,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:03:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252365527] [2024-10-23 21:03:18,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:18,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:18,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:18,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:18,291 INFO L87 Difference]: Start difference. First operand 6154 states and 7600 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 21:03:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:18,966 INFO L93 Difference]: Finished difference Result 14155 states and 17735 transitions. [2024-10-23 21:03:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:18,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 267 [2024-10-23 21:03:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:18,986 INFO L225 Difference]: With dead ends: 14155 [2024-10-23 21:03:18,986 INFO L226 Difference]: Without dead ends: 8186 [2024-10-23 21:03:18,994 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 21:03:18,995 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 147 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:18,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 388 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:03:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8186 states. [2024-10-23 21:03:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8186 to 8178. [2024-10-23 21:03:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8177 states have (on average 1.214870979576862) internal successors, (9934), 8177 states have internal predecessors, (9934), 0 states have call successors, (0), 0 states 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 21:03:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 9934 transitions. [2024-10-23 21:03:19,098 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 9934 transitions. Word has length 267 [2024-10-23 21:03:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:19,099 INFO L471 AbstractCegarLoop]: Abstraction has 8178 states and 9934 transitions. [2024-10-23 21:03:19,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 21:03:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 9934 transitions. [2024-10-23 21:03:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-10-23 21:03:19,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:19,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 21:03:19,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:03:19,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:19,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 633681458, now seen corresponding path program 1 times [2024-10-23 21:03:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341012707] [2024-10-23 21:03:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:03:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341012707] [2024-10-23 21:03:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341012707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:19,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:19,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 21:03:19,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031729290] [2024-10-23 21:03:19,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:19,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 21:03:19,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:19,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 21:03:19,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:03:19,684 INFO L87 Difference]: Start difference. First operand 8178 states and 9934 transitions. Second operand has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 5 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 21:03:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:21,059 INFO L93 Difference]: Finished difference Result 17503 states and 21219 transitions. [2024-10-23 21:03:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 21:03:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 5 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 289 [2024-10-23 21:03:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:21,081 INFO L225 Difference]: With dead ends: 17503 [2024-10-23 21:03:21,082 INFO L226 Difference]: Without dead ends: 9694 [2024-10-23 21:03:21,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:03:21,092 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 532 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:21,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 181 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:03:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2024-10-23 21:03:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 9651. [2024-10-23 21:03:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9651 states, 9650 states have (on average 1.194300518134715) internal successors, (11525), 9650 states have internal predecessors, (11525), 0 states have call successors, (0), 0 states 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 21:03:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9651 states to 9651 states and 11525 transitions. [2024-10-23 21:03:21,228 INFO L78 Accepts]: Start accepts. Automaton has 9651 states and 11525 transitions. Word has length 289 [2024-10-23 21:03:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:21,229 INFO L471 AbstractCegarLoop]: Abstraction has 9651 states and 11525 transitions. [2024-10-23 21:03:21,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 5 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 21:03:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9651 states and 11525 transitions. [2024-10-23 21:03:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-23 21:03:21,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:21,235 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:03:21,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:03:21,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:21,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -769825316, now seen corresponding path program 1 times [2024-10-23 21:03:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930354997] [2024-10-23 21:03:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-23 21:03:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930354997] [2024-10-23 21:03:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930354997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:03:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769747778] [2024-10-23 21:03:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:21,367 INFO L87 Difference]: Start difference. First operand 9651 states and 11525 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:03:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:21,984 INFO L93 Difference]: Finished difference Result 19848 states and 24228 transitions. [2024-10-23 21:03:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2024-10-23 21:03:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:22,012 INFO L225 Difference]: With dead ends: 19848 [2024-10-23 21:03:22,012 INFO L226 Difference]: Without dead ends: 11857 [2024-10-23 21:03:22,021 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 21:03:22,021 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 178 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:22,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 321 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:03:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2024-10-23 21:03:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 11672. [2024-10-23 21:03:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11672 states, 11671 states have (on average 1.2025533373318482) internal successors, (14035), 11671 states have internal predecessors, (14035), 0 states have call successors, (0), 0 states 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 21:03:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11672 states to 11672 states and 14035 transitions. [2024-10-23 21:03:22,166 INFO L78 Accepts]: Start accepts. Automaton has 11672 states and 14035 transitions. Word has length 294 [2024-10-23 21:03:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 11672 states and 14035 transitions. [2024-10-23 21:03:22,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:03:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 11672 states and 14035 transitions. [2024-10-23 21:03:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-23 21:03:22,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:22,173 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:22,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:03:22,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:22,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1776313961, now seen corresponding path program 1 times [2024-10-23 21:03:22,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:22,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107211104] [2024-10-23 21:03:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-23 21:03:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:22,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107211104] [2024-10-23 21:03:22,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107211104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:22,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:22,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:03:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732953220] [2024-10-23 21:03:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:22,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:22,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:22,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:22,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:22,334 INFO L87 Difference]: Start difference. First operand 11672 states and 14035 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 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 21:03:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:22,958 INFO L93 Difference]: Finished difference Result 24075 states and 29426 transitions. [2024-10-23 21:03:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 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 313 [2024-10-23 21:03:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:22,979 INFO L225 Difference]: With dead ends: 24075 [2024-10-23 21:03:22,979 INFO L226 Difference]: Without dead ends: 14063 [2024-10-23 21:03:22,989 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 21:03:22,989 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 174 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:22,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 146 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:03:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14063 states. [2024-10-23 21:03:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14063 to 12585. [2024-10-23 21:03:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12585 states, 12584 states have (on average 1.1836458995549906) internal successors, (14895), 12584 states have internal predecessors, (14895), 0 states have call successors, (0), 0 states 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 21:03:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12585 states to 12585 states and 14895 transitions. [2024-10-23 21:03:23,112 INFO L78 Accepts]: Start accepts. Automaton has 12585 states and 14895 transitions. Word has length 313 [2024-10-23 21:03:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 12585 states and 14895 transitions. [2024-10-23 21:03:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 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 21:03:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 12585 states and 14895 transitions. [2024-10-23 21:03:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-23 21:03:23,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:23,124 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-23 21:03:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:03:23,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:23,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash -567182636, now seen corresponding path program 1 times [2024-10-23 21:03:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:23,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923031312] [2024-10-23 21:03:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:03:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923031312] [2024-10-23 21:03:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923031312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:03:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444211814] [2024-10-23 21:03:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:03:23,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:03:23,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:03:23,474 INFO L87 Difference]: Start difference. First operand 12585 states and 14895 transitions. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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 21:03:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:24,578 INFO L93 Difference]: Finished difference Result 29973 states and 36005 transitions. [2024-10-23 21:03:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:03:24,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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 353 [2024-10-23 21:03:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:24,606 INFO L225 Difference]: With dead ends: 29973 [2024-10-23 21:03:24,606 INFO L226 Difference]: Without dead ends: 19048 [2024-10-23 21:03:24,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:03:24,619 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 240 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:24,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 65 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:03:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19048 states. [2024-10-23 21:03:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19048 to 17932. [2024-10-23 21:03:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17932 states, 17931 states have (on average 1.1789638056996263) internal successors, (21140), 17931 states have internal predecessors, (21140), 0 states have call successors, (0), 0 states 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 21:03:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17932 states to 17932 states and 21140 transitions. [2024-10-23 21:03:24,836 INFO L78 Accepts]: Start accepts. Automaton has 17932 states and 21140 transitions. Word has length 353 [2024-10-23 21:03:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:24,837 INFO L471 AbstractCegarLoop]: Abstraction has 17932 states and 21140 transitions. [2024-10-23 21:03:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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 21:03:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 17932 states and 21140 transitions. [2024-10-23 21:03:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-10-23 21:03:24,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:24,858 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:24,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:03:24,858 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:24,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash -225247800, now seen corresponding path program 1 times [2024-10-23 21:03:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069252117] [2024-10-23 21:03:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-23 21:03:25,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:25,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069252117] [2024-10-23 21:03:25,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069252117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:25,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:25,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:03:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027838458] [2024-10-23 21:03:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:25,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:03:25,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:25,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:03:25,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:03:25,314 INFO L87 Difference]: Start difference. First operand 17932 states and 21140 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 21:03:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:26,416 INFO L93 Difference]: Finished difference Result 37903 states and 45129 transitions. [2024-10-23 21:03:26,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:03:26,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 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 427 [2024-10-23 21:03:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:26,440 INFO L225 Difference]: With dead ends: 37903 [2024-10-23 21:03:26,441 INFO L226 Difference]: Without dead ends: 21631 [2024-10-23 21:03:26,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:03:26,457 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 240 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:26,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 65 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:03:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2024-10-23 21:03:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 17564. [2024-10-23 21:03:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17564 states, 17563 states have (on average 1.179639013835905) internal successors, (20718), 17563 states have internal predecessors, (20718), 0 states have call successors, (0), 0 states 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 21:03:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17564 states to 17564 states and 20718 transitions. [2024-10-23 21:03:26,641 INFO L78 Accepts]: Start accepts. Automaton has 17564 states and 20718 transitions. Word has length 427 [2024-10-23 21:03:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 17564 states and 20718 transitions. [2024-10-23 21:03:26,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 21:03:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17564 states and 20718 transitions. [2024-10-23 21:03:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2024-10-23 21:03:26,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:26,717 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:26,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:03:26,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:26,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1374965183, now seen corresponding path program 1 times [2024-10-23 21:03:26,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:26,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819967908] [2024-10-23 21:03:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-23 21:03:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:26,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819967908] [2024-10-23 21:03:26,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819967908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:26,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:26,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:03:26,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074030844] [2024-10-23 21:03:26,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:26,955 INFO L87 Difference]: Start difference. First operand 17564 states and 20718 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 21:03:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:27,474 INFO L93 Difference]: Finished difference Result 31990 states and 37834 transitions. [2024-10-23 21:03:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 600 [2024-10-23 21:03:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:27,495 INFO L225 Difference]: With dead ends: 31990 [2024-10-23 21:03:27,496 INFO L226 Difference]: Without dead ends: 16086 [2024-10-23 21:03:27,506 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 21:03:27,507 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 101 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:27,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 147 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:03:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16086 states. [2024-10-23 21:03:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16086 to 13692. [2024-10-23 21:03:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13692 states, 13691 states have (on average 1.1394346651084655) internal successors, (15600), 13691 states have internal predecessors, (15600), 0 states have call successors, (0), 0 states 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 21:03:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13692 states to 13692 states and 15600 transitions. [2024-10-23 21:03:27,729 INFO L78 Accepts]: Start accepts. Automaton has 13692 states and 15600 transitions. Word has length 600 [2024-10-23 21:03:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:27,733 INFO L471 AbstractCegarLoop]: Abstraction has 13692 states and 15600 transitions. [2024-10-23 21:03:27,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 21:03:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 13692 states and 15600 transitions. [2024-10-23 21:03:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2024-10-23 21:03:27,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:03:27,762 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 21:03:27,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:03:27,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:03:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:03:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2131687900, now seen corresponding path program 1 times [2024-10-23 21:03:27,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:03:27,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267854737] [2024-10-23 21:03:27,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:03:27,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:03:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:03:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2024-10-23 21:03:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:03:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267854737] [2024-10-23 21:03:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267854737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:03:28,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:03:28,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:03:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758234337] [2024-10-23 21:03:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:03:28,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:03:28,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:03:28,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:03:28,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:03:28,123 INFO L87 Difference]: Start difference. First operand 13692 states and 15600 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:03:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:28,739 INFO L93 Difference]: Finished difference Result 27378 states and 31296 transitions. [2024-10-23 21:03:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:03:28,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 691 [2024-10-23 21:03:28,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:28,740 INFO L225 Difference]: With dead ends: 27378 [2024-10-23 21:03:28,740 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:03:28,754 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 21:03:28,754 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:28,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 362 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:03:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:03:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:03:28,755 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 21:03:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:03:28,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 691 [2024-10-23 21:03:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:28,755 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:03:28,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:03:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:03:28,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:03:28,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:03:28,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:03:28,765 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:03:28,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:03:29,790 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:03:29,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:03:29 BoogieIcfgContainer [2024-10-23 21:03:29,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:03:29,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:03:29,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:03:29,803 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:03:29,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:03:10" (3/4) ... [2024-10-23 21:03:29,805 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:03:29,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 21:03:29,820 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:03:29,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:03:29,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:03:29,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:03:29,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:03:29,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:03:29,954 INFO L158 Benchmark]: Toolchain (without parser) took 21462.36ms. Allocated memory was 157.3MB in the beginning and 853.5MB in the end (delta: 696.3MB). Free memory was 83.6MB in the beginning and 528.9MB in the end (delta: -445.3MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. [2024-10-23 21:03:29,954 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 157.3MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:03:29,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.46ms. Allocated memory is still 157.3MB. Free memory was 83.3MB in the beginning and 87.1MB in the end (delta: -3.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-10-23 21:03:29,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.73ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 69.1MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-23 21:03:29,955 INFO L158 Benchmark]: Boogie Preprocessor took 195.28ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 69.1MB in the beginning and 160.8MB in the end (delta: -91.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-10-23 21:03:29,955 INFO L158 Benchmark]: RCFGBuilder took 1328.77ms. Allocated memory is still 205.5MB. Free memory was 160.8MB in the beginning and 80.2MB in the end (delta: 80.6MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2024-10-23 21:03:29,955 INFO L158 Benchmark]: TraceAbstraction took 19117.39ms. Allocated memory was 205.5MB in the beginning and 853.5MB in the end (delta: 648.0MB). Free memory was 79.1MB in the beginning and 545.7MB in the end (delta: -466.5MB). Peak memory consumption was 504.9MB. Max. memory is 16.1GB. [2024-10-23 21:03:29,955 INFO L158 Benchmark]: Witness Printer took 150.70ms. Allocated memory is still 853.5MB. Free memory was 545.7MB in the beginning and 528.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 21:03:29,956 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.10ms. Allocated memory is still 157.3MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.46ms. Allocated memory is still 157.3MB. Free memory was 83.3MB in the beginning and 87.1MB in the end (delta: -3.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.73ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 69.1MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 195.28ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 69.1MB in the beginning and 160.8MB in the end (delta: -91.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1328.77ms. Allocated memory is still 205.5MB. Free memory was 160.8MB in the beginning and 80.2MB in the end (delta: 80.6MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19117.39ms. Allocated memory was 205.5MB in the beginning and 853.5MB in the end (delta: 648.0MB). Free memory was 79.1MB in the beginning and 545.7MB in the end (delta: -466.5MB). Peak memory consumption was 504.9MB. Max. memory is 16.1GB. * Witness Printer took 150.70ms. Allocated memory is still 853.5MB. Free memory was 545.7MB in the beginning and 528.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 163]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2896 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2896 mSDsluCounter, 3108 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 1981 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10372 IncrementalHoareTripleChecker+Invalid, 12353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1981 mSolverCounterUnsat, 2720 mSDtfsCounter, 10372 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17932occurred in iteration=12, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 9313 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 4441 NumberOfCodeBlocks, 4441 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4425 ConstructedInterpolants, 0 QuantifiedInterpolants, 13451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 4681/4683 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((a29 <= 599998) && (a4 != 1)) || (((a25 <= 10) && (a29 <= 599999)) && (((long long) a23 + 599772) <= 0))) || (((long long) a29 + 21) <= 0)) || ((((307 <= a23) && (a25 == 11)) && (a29 <= 599999)) && (a4 == 1))) || ((a25 == 11) && (a29 <= 599998))) || ((a25 == 13) && (a29 <= 599998))) || ((307 <= a23) && (a29 <= 599998))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:03:29,978 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