./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/eca-rers2012/Problem12_label29.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 5b97ff5ceba251ab7fbafe0c3432eac346423cbbff0a928a797ba0e4f7876661 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:15:57,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:15:57,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:15:57,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:15:57,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:15:57,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:15:57,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:15:57,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:15:57,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:15:57,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:15:57,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:15:57,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:15:57,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:15:57,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:15:57,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:15:57,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:15:57,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:15:57,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:15:57,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:15:57,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:15:57,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:15:57,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:15:57,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:15:57,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:15:57,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:15:57,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:15:57,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:15:57,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:15:57,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:15:57,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:15:57,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:15:57,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:15:57,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:15:57,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:15:57,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:15:57,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:15:57,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:15:57,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:15:57,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:15:57,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:15:57,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:15:57,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:15:57,264 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 -> 5b97ff5ceba251ab7fbafe0c3432eac346423cbbff0a928a797ba0e4f7876661 [2024-11-08 11:15:57,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:15:57,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:15:57,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:15:57,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:15:57,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:15:57,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label29.c [2024-11-08 11:15:58,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:15:58,985 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:15:58,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label29.c [2024-11-08 11:15:59,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cc7549f/3ec9d82c5e53412aa8d6cb2d1f8ebe28/FLAG1fb8de5b2 [2024-11-08 11:15:59,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cc7549f/3ec9d82c5e53412aa8d6cb2d1f8ebe28 [2024-11-08 11:15:59,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:15:59,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:15:59,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:15:59,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:15:59,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:15:59,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:59" (1/1) ... [2024-11-08 11:15:59,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c73cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:59, skipping insertion in model container [2024-11-08 11:15:59,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:59" (1/1) ... [2024-11-08 11:15:59,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:15:59,318 WARN L250 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/Problem12_label29.c[6855,6868] [2024-11-08 11:15:59,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:15:59,833 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:15:59,849 WARN L250 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/Problem12_label29.c[6855,6868] [2024-11-08 11:16:00,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:16:00,191 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:16:00,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00 WrapperNode [2024-11-08 11:16:00,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:16:00,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:16:00,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:16:00,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:16:00,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,487 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-08 11:16:00,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:16:00,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:16:00,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:16:00,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:16:00,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,663 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-11-08 11:16:00,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:16:00,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:16:00,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:16:00,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:16:00,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (1/1) ... [2024-11-08 11:16:00,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:16:00,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:16:00,899 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-11-08 11:16:00,900 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-11-08 11:16:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:16:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:16:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:16:00,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:16:00,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:16:00,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:16:04,064 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-08 11:16:04,064 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:16:04,092 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:16:04,093 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:16:04,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:04 BoogieIcfgContainer [2024-11-08 11:16:04,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:16:04,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:16:04,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:16:04,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:16:04,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:15:59" (1/3) ... [2024-11-08 11:16:04,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7c431c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:16:04, skipping insertion in model container [2024-11-08 11:16:04,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:00" (2/3) ... [2024-11-08 11:16:04,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7c431c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:16:04, skipping insertion in model container [2024-11-08 11:16:04,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:04" (3/3) ... [2024-11-08 11:16:04,100 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label29.c [2024-11-08 11:16:04,112 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:16:04,113 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:16:04,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:16:04,187 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;@2ca9f463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:16:04,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:16:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:04,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 11:16:04,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:04,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:04,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2024-11-08 11:16:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389714599] [2024-11-08 11:16:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:16:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:04,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389714599] [2024-11-08 11:16:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389714599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:04,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:16:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712210588] [2024-11-08 11:16:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:04,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:04,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:04,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:04,503 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:07,449 INFO L93 Difference]: Finished difference Result 2404 states and 4645 transitions. [2024-11-08 11:16:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:07,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-08 11:16:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:07,477 INFO L225 Difference]: With dead ends: 2404 [2024-11-08 11:16:07,478 INFO L226 Difference]: Without dead ends: 1506 [2024-11-08 11:16:07,486 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-11-08 11:16:07,491 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 765 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:07,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:16:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-08 11:16:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-08 11:16:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions. [2024-11-08 11:16:07,596 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 55 [2024-11-08 11:16:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:07,597 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions. [2024-11-08 11:16:07,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions. [2024-11-08 11:16:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 11:16:07,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:07,604 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, 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-11-08 11:16:07,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:16:07,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:07,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1900391635, now seen corresponding path program 1 times [2024-11-08 11:16:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773540526] [2024-11-08 11:16:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:16:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773540526] [2024-11-08 11:16:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773540526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:07,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:16:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905058525] [2024-11-08 11:16:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:07,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:07,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:07,762 INFO L87 Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:10,306 INFO L93 Difference]: Finished difference Result 4512 states and 7249 transitions. [2024-11-08 11:16:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-08 11:16:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:10,315 INFO L225 Difference]: With dead ends: 4512 [2024-11-08 11:16:10,315 INFO L226 Difference]: Without dead ends: 3008 [2024-11-08 11:16:10,316 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-11-08 11:16:10,317 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:10,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 449 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:16:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2024-11-08 11:16:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2024-11-08 11:16:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4156967076820752) internal successors, (4257), 3007 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4257 transitions. [2024-11-08 11:16:10,348 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4257 transitions. Word has length 130 [2024-11-08 11:16:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:10,349 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4257 transitions. [2024-11-08 11:16:10,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4257 transitions. [2024-11-08 11:16:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 11:16:10,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:10,352 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, 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-11-08 11:16:10,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:16:10,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:10,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:10,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1783976430, now seen corresponding path program 1 times [2024-11-08 11:16:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:10,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490591886] [2024-11-08 11:16:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:10,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:16:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:10,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490591886] [2024-11-08 11:16:10,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490591886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:10,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668703369] [2024-11-08 11:16:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:10,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:16:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:16:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:16:10,596 INFO L87 Difference]: Start difference. First operand 3008 states and 4257 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:13,907 INFO L93 Difference]: Finished difference Result 9769 states and 13601 transitions. [2024-11-08 11:16:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:16:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-08 11:16:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:13,924 INFO L225 Difference]: With dead ends: 9769 [2024-11-08 11:16:13,924 INFO L226 Difference]: Without dead ends: 6763 [2024-11-08 11:16:13,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:16:13,928 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 2180 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:13,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 166 Invalid, 5459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:16:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2024-11-08 11:16:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2024-11-08 11:16:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3507837917775807) internal successors, (9134), 6762 states have internal predecessors, (9134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9134 transitions. [2024-11-08 11:16:14,001 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9134 transitions. Word has length 132 [2024-11-08 11:16:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:14,001 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9134 transitions. [2024-11-08 11:16:14,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9134 transitions. [2024-11-08 11:16:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 11:16:14,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:14,003 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:14,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:16:14,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:14,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1629734012, now seen corresponding path program 1 times [2024-11-08 11:16:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404137529] [2024-11-08 11:16:14,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 11:16:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404137529] [2024-11-08 11:16:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404137529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:16:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153272473] [2024-11-08 11:16:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:14,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:16:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:16:14,355 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-11-08 11:16:14,357 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-11-08 11:16:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:14,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:16:14,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:16:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 11:16:14,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:16:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153272473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:14,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:16:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 11:16:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012378537] [2024-11-08 11:16:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:14,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:16:14,669 INFO L87 Difference]: Start difference. First operand 6763 states and 9134 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:16,521 INFO L93 Difference]: Finished difference Result 15777 states and 21144 transitions. [2024-11-08 11:16:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:16,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 200 [2024-11-08 11:16:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:16,544 INFO L225 Difference]: With dead ends: 15777 [2024-11-08 11:16:16,544 INFO L226 Difference]: Without dead ends: 9767 [2024-11-08 11:16:16,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:16:16,552 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 712 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:16,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 156 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 11:16:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-08 11:16:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2024-11-08 11:16:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2556829817734998) internal successors, (12263), 9766 states have internal predecessors, (12263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12263 transitions. [2024-11-08 11:16:16,672 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12263 transitions. Word has length 200 [2024-11-08 11:16:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:16,673 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12263 transitions. [2024-11-08 11:16:16,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12263 transitions. [2024-11-08 11:16:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-08 11:16:16,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:16,677 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:16:16,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:16:16,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:16:16,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1026450526, now seen corresponding path program 1 times [2024-11-08 11:16:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530721858] [2024-11-08 11:16:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 11:16:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530721858] [2024-11-08 11:16:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530721858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:17,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:17,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:17,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239788429] [2024-11-08 11:16:17,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:17,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:16:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:17,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:16:17,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:16:17,293 INFO L87 Difference]: Start difference. First operand 9767 states and 12263 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:19,961 INFO L93 Difference]: Finished difference Result 27118 states and 34546 transitions. [2024-11-08 11:16:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:16:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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-11-08 11:16:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:20,000 INFO L225 Difference]: With dead ends: 27118 [2024-11-08 11:16:20,001 INFO L226 Difference]: Without dead ends: 18030 [2024-11-08 11:16:20,008 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-11-08 11:16:20,008 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 4087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:20,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 365 Invalid, 4087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:16:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18030 states. [2024-11-08 11:16:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18030 to 15775. [2024-11-08 11:16:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.1934195511601369) internal successors, (18825), 15774 states have internal predecessors, (18825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 18825 transitions. [2024-11-08 11:16:20,199 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 18825 transitions. Word has length 267 [2024-11-08 11:16:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:20,199 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 18825 transitions. [2024-11-08 11:16:20,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 18825 transitions. [2024-11-08 11:16:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-08 11:16:20,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:20,204 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:16:20,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:16:20,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:20,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1129124720, now seen corresponding path program 1 times [2024-11-08 11:16:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636873094] [2024-11-08 11:16:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:20,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 11:16:20,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:20,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636873094] [2024-11-08 11:16:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636873094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402643517] [2024-11-08 11:16:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:20,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:20,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:20,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:20,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:20,382 INFO L87 Difference]: Start difference. First operand 15775 states and 18825 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:22,645 INFO L93 Difference]: Finished difference Result 39058 states and 47478 transitions. [2024-11-08 11:16:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:22,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2024-11-08 11:16:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:22,673 INFO L225 Difference]: With dead ends: 39058 [2024-11-08 11:16:22,673 INFO L226 Difference]: Without dead ends: 24036 [2024-11-08 11:16:22,683 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-11-08 11:16:22,684 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 693 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:22,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 430 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 11:16:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2024-11-08 11:16:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 23285. [2024-11-08 11:16:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.1873389451984195) internal successors, (27646), 23284 states have internal predecessors, (27646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 27646 transitions. [2024-11-08 11:16:22,912 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 27646 transitions. Word has length 378 [2024-11-08 11:16:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:22,913 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 27646 transitions. [2024-11-08 11:16:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 27646 transitions. [2024-11-08 11:16:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-08 11:16:22,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:22,918 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:16:22,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:16:22,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:22,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash 82368042, now seen corresponding path program 1 times [2024-11-08 11:16:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771022344] [2024-11-08 11:16:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 11:16:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771022344] [2024-11-08 11:16:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771022344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:23,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679040114] [2024-11-08 11:16:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:23,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:23,116 INFO L87 Difference]: Start difference. First operand 23285 states and 27646 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:25,132 INFO L93 Difference]: Finished difference Result 54829 states and 66470 transitions. [2024-11-08 11:16:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 406 [2024-11-08 11:16:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:25,181 INFO L225 Difference]: With dead ends: 54829 [2024-11-08 11:16:25,182 INFO L226 Difference]: Without dead ends: 32297 [2024-11-08 11:16:25,203 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-11-08 11:16:25,204 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 680 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:25,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1216 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 11:16:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32297 states. [2024-11-08 11:16:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32297 to 30044. [2024-11-08 11:16:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.1742169556968345) internal successors, (35277), 30043 states have internal predecessors, (35277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 35277 transitions. [2024-11-08 11:16:25,492 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 35277 transitions. Word has length 406 [2024-11-08 11:16:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:25,492 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 35277 transitions. [2024-11-08 11:16:25,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 35277 transitions. [2024-11-08 11:16:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-08 11:16:25,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:25,499 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:16:25,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:16:25,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:25,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash -470516960, now seen corresponding path program 1 times [2024-11-08 11:16:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990170783] [2024-11-08 11:16:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-08 11:16:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:25,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990170783] [2024-11-08 11:16:25,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990170783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:25,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:25,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284396176] [2024-11-08 11:16:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:25,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:25,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:25,808 INFO L87 Difference]: Start difference. First operand 30044 states and 35277 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:27,986 INFO L93 Difference]: Finished difference Result 68347 states and 81732 transitions. [2024-11-08 11:16:27,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:27,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2024-11-08 11:16:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:28,026 INFO L225 Difference]: With dead ends: 68347 [2024-11-08 11:16:28,026 INFO L226 Difference]: Without dead ends: 39056 [2024-11-08 11:16:28,047 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-11-08 11:16:28,048 INFO L432 NwaCegarLoop]: 1277 mSDtfsCounter, 673 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:28,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1285 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 11:16:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39056 states. [2024-11-08 11:16:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 39056. [2024-11-08 11:16:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39056 states, 39055 states have (on average 1.1549609525028806) internal successors, (45107), 39055 states have internal predecessors, (45107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39056 states to 39056 states and 45107 transitions. [2024-11-08 11:16:28,446 INFO L78 Accepts]: Start accepts. Automaton has 39056 states and 45107 transitions. Word has length 410 [2024-11-08 11:16:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:28,447 INFO L471 AbstractCegarLoop]: Abstraction has 39056 states and 45107 transitions. [2024-11-08 11:16:28,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 39056 states and 45107 transitions. [2024-11-08 11:16:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-11-08 11:16:28,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:28,457 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:16:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:16:28,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:28,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1554895338, now seen corresponding path program 1 times [2024-11-08 11:16:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:28,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584342458] [2024-11-08 11:16:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-08 11:16:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584342458] [2024-11-08 11:16:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584342458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:28,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:28,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398497499] [2024-11-08 11:16:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:28,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:28,664 INFO L87 Difference]: Start difference. First operand 39056 states and 45107 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:30,961 INFO L93 Difference]: Finished difference Result 113407 states and 131432 transitions. [2024-11-08 11:16:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 414 [2024-11-08 11:16:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:31,038 INFO L225 Difference]: With dead ends: 113407 [2024-11-08 11:16:31,039 INFO L226 Difference]: Without dead ends: 75104 [2024-11-08 11:16:31,061 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-11-08 11:16:31,061 INFO L432 NwaCegarLoop]: 1340 mSDtfsCounter, 671 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:31,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1348 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:16:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75104 states. [2024-11-08 11:16:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75104 to 71349. [2024-11-08 11:16:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71349 states, 71348 states have (on average 1.116135000280316) internal successors, (79634), 71348 states have internal predecessors, (79634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71349 states to 71349 states and 79634 transitions. [2024-11-08 11:16:31,958 INFO L78 Accepts]: Start accepts. Automaton has 71349 states and 79634 transitions. Word has length 414 [2024-11-08 11:16:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:31,962 INFO L471 AbstractCegarLoop]: Abstraction has 71349 states and 79634 transitions. [2024-11-08 11:16:31,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71349 states and 79634 transitions. [2024-11-08 11:16:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-08 11:16:31,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:31,974 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:31,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:16:31,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:31,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash -212050648, now seen corresponding path program 1 times [2024-11-08 11:16:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:31,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881320609] [2024-11-08 11:16:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-08 11:16:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:32,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881320609] [2024-11-08 11:16:32,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881320609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:32,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:32,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:32,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788166339] [2024-11-08 11:16:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:32,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:32,197 INFO L87 Difference]: Start difference. First operand 71349 states and 79634 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:34,913 INFO L93 Difference]: Finished difference Result 175740 states and 198046 transitions. [2024-11-08 11:16:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2024-11-08 11:16:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:35,019 INFO L225 Difference]: With dead ends: 175740 [2024-11-08 11:16:35,020 INFO L226 Difference]: Without dead ends: 101389 [2024-11-08 11:16:35,055 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-11-08 11:16:35,056 INFO L432 NwaCegarLoop]: 1271 mSDtfsCounter, 707 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:35,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1279 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 11:16:35,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101389 states. [2024-11-08 11:16:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101389 to 87871. [2024-11-08 11:16:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87871 states, 87870 states have (on average 1.1038124502105382) internal successors, (96992), 87870 states have internal predecessors, (96992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87871 states to 87871 states and 96992 transitions. [2024-11-08 11:16:36,001 INFO L78 Accepts]: Start accepts. Automaton has 87871 states and 96992 transitions. Word has length 476 [2024-11-08 11:16:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:36,002 INFO L471 AbstractCegarLoop]: Abstraction has 87871 states and 96992 transitions. [2024-11-08 11:16:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 87871 states and 96992 transitions. [2024-11-08 11:16:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-11-08 11:16:36,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:36,016 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:36,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:16:36,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:36,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash -412162117, now seen corresponding path program 1 times [2024-11-08 11:16:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916130905] [2024-11-08 11:16:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 446 proven. 108 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-08 11:16:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916130905] [2024-11-08 11:16:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916130905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:16:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401087265] [2024-11-08 11:16:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:36,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:16:36,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:16:36,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:16:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:16:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:37,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:16:37,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:16:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-08 11:16:37,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:16:37,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401087265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:16:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:16:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320548900] [2024-11-08 11:16:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:37,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:37,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:16:37,240 INFO L87 Difference]: Start difference. First operand 87871 states and 96992 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:39,453 INFO L93 Difference]: Finished difference Result 174989 states and 193226 transitions. [2024-11-08 11:16:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 547 [2024-11-08 11:16:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:39,536 INFO L225 Difference]: With dead ends: 174989 [2024-11-08 11:16:39,537 INFO L226 Difference]: Without dead ends: 87871 [2024-11-08 11:16:39,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:16:39,565 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 684 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:39,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1302 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 11:16:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87871 states. [2024-11-08 11:16:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87871 to 80361. [2024-11-08 11:16:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80361 states, 80360 states have (on average 1.0673096067695371) internal successors, (85769), 80360 states have internal predecessors, (85769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80361 states to 80361 states and 85769 transitions. [2024-11-08 11:16:40,463 INFO L78 Accepts]: Start accepts. Automaton has 80361 states and 85769 transitions. Word has length 547 [2024-11-08 11:16:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:40,463 INFO L471 AbstractCegarLoop]: Abstraction has 80361 states and 85769 transitions. [2024-11-08 11:16:40,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 80361 states and 85769 transitions. [2024-11-08 11:16:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2024-11-08 11:16:40,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:40,480 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:16:40,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:16:40,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 11:16:40,681 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:40,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1101864650, now seen corresponding path program 1 times [2024-11-08 11:16:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368080278] [2024-11-08 11:16:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 11:16:41,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:41,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368080278] [2024-11-08 11:16:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368080278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:41,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:41,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57432693] [2024-11-08 11:16:41,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:41,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:41,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:41,154 INFO L87 Difference]: Start difference. First operand 80361 states and 85769 transitions. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:43,600 INFO L93 Difference]: Finished difference Result 185501 states and 198498 transitions. [2024-11-08 11:16:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 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 641 [2024-11-08 11:16:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:43,602 INFO L225 Difference]: With dead ends: 185501 [2024-11-08 11:16:43,602 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:16:43,639 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-11-08 11:16:43,640 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 441 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:43,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1231 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 11:16:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:16:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:16:43,640 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-11-08 11:16:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:16:43,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 641 [2024-11-08 11:16:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:43,641 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:16:43,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:16:43,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:16:43,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:16:43,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:16:43,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:43,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:16:44,623 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:16:44,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:16:44 BoogieIcfgContainer [2024-11-08 11:16:44,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:16:44,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:16:44,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:16:44,638 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:16:44,639 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:04" (3/4) ... [2024-11-08 11:16:44,640 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:16:44,671 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 11:16:44,675 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:16:44,679 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:16:44,682 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:16:44,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:16:44,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:16:44,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:16:44,915 INFO L158 Benchmark]: Toolchain (without parser) took 45895.08ms. Allocated memory was 172.0MB in the beginning and 6.7GB in the end (delta: 6.6GB). Free memory was 102.0MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-08 11:16:44,915 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:16:44,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1171.10ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 101.6MB in the beginning and 165.8MB in the end (delta: -64.2MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2024-11-08 11:16:44,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 295.00ms. Allocated memory is still 255.9MB. Free memory was 165.8MB in the beginning and 155.2MB in the end (delta: 10.6MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2024-11-08 11:16:44,916 INFO L158 Benchmark]: Boogie Preprocessor took 379.89ms. Allocated memory is still 255.9MB. Free memory was 155.2MB in the beginning and 113.2MB in the end (delta: 41.9MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-11-08 11:16:44,916 INFO L158 Benchmark]: RCFGBuilder took 3224.26ms. Allocated memory was 255.9MB in the beginning and 497.0MB in the end (delta: 241.2MB). Free memory was 113.2MB in the beginning and 252.1MB in the end (delta: -138.9MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. [2024-11-08 11:16:44,917 INFO L158 Benchmark]: TraceAbstraction took 40542.74ms. Allocated memory was 497.0MB in the beginning and 6.7GB in the end (delta: 6.2GB). Free memory was 251.1MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-08 11:16:44,917 INFO L158 Benchmark]: Witness Printer took 276.72ms. Allocated memory is still 6.7GB. Free memory was 5.4GB in the beginning and 5.4GB in the end (delta: 69.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-08 11:16:44,918 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.17ms. Allocated memory is still 172.0MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1171.10ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 101.6MB in the beginning and 165.8MB in the end (delta: -64.2MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 295.00ms. Allocated memory is still 255.9MB. Free memory was 165.8MB in the beginning and 155.2MB in the end (delta: 10.6MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 379.89ms. Allocated memory is still 255.9MB. Free memory was 155.2MB in the beginning and 113.2MB in the end (delta: 41.9MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3224.26ms. Allocated memory was 255.9MB in the beginning and 497.0MB in the end (delta: 241.2MB). Free memory was 113.2MB in the beginning and 252.1MB in the end (delta: -138.9MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. * TraceAbstraction took 40542.74ms. Allocated memory was 497.0MB in the beginning and 6.7GB in the end (delta: 6.2GB). Free memory was 251.1MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 276.72ms. Allocated memory is still 6.7GB. Free memory was 5.4GB in the beginning and 5.4GB in the end (delta: 69.2MB). Peak memory consumption was 67.1MB. 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: 187]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.5s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9830 SdHoareTripleChecker+Valid, 26.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9830 mSDsluCounter, 9752 SdHoareTripleChecker+Invalid, 22.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 7395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30288 IncrementalHoareTripleChecker+Invalid, 37683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7395 mSolverCounterUnsat, 9641 mSDtfsCounter, 30288 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87871occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 30042 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 4803 NumberOfCodeBlocks, 4803 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4789 ConstructedInterpolants, 0 QuantifiedInterpolants, 13836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 977 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 4871/5022 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: 4828]: Loop Invariant Derived loop invariant: (((((((((a5 == 4) || (a24 == 14)) || (6 < a5)) || (256 <= a17)) || (a24 == 13)) || (a17 <= 111)) || (5 == a5)) || (6 == a5)) || (a7 != 12)) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:16:44,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE