./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfcc0c3466e0ad99a1193d0083cedd3fc450234fcd184acb12bef00501b42460 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 17:19:28,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:19:28,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:19:28,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:19:28,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:19:28,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:19:28,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:19:28,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:19:28,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:19:28,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:19:28,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:19:28,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:19:28,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:19:28,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:19:28,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:19:28,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:19:28,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:19:28,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:19:28,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:19:28,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:19:28,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:19:28,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:19:28,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:19:28,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:19:28,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:19:28,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:19:28,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:19:28,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:19:28,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:19:28,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:19:28,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:19:28,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:19:28,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:19:28,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:19:28,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:19:28,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:19:28,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:19:28,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:19:28,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:19:28,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:19:28,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:19:28,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:19:28,562 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 -> dfcc0c3466e0ad99a1193d0083cedd3fc450234fcd184acb12bef00501b42460 [2024-11-19 17:19:28,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:19:28,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:19:28,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:19:28,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:19:28,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:19:28,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c [2024-11-19 17:19:29,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:19:30,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:19:30,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c [2024-11-19 17:19:30,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/450631f6c/24dabeb9b78644ad909d58813d8d78f6/FLAG640ea0ea5 [2024-11-19 17:19:30,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/450631f6c/24dabeb9b78644ad909d58813d8d78f6 [2024-11-19 17:19:30,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:19:30,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:19:30,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:19:30,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:19:30,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:19:30,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf052c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30, skipping insertion in model container [2024-11-19 17:19:30,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:19:30,483 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/Problem02_label32.c[17811,17824] [2024-11-19 17:19:30,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:19:30,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:19:30,577 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/Problem02_label32.c[17811,17824] [2024-11-19 17:19:30,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:19:30,606 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:19:30,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30 WrapperNode [2024-11-19 17:19:30,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:19:30,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:19:30,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:19:30,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:19:30,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,666 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-19 17:19:30,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:19:30,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:19:30,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:19:30,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:19:30,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,703 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-19 17:19:30,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:19:30,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:19:30,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:19:30,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:19:30,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (1/1) ... [2024-11-19 17:19:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:19:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:19:30,790 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-19 17:19:30,796 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-19 17:19:30,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:19:30,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 17:19:30,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:19:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:19:30,888 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:19:30,890 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:19:31,659 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-19 17:19:31,659 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:19:31,675 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:19:31,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 17:19:31,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:31 BoogieIcfgContainer [2024-11-19 17:19:31,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:19:31,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:19:31,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:19:31,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:19:31,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:19:30" (1/3) ... [2024-11-19 17:19:31,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b63a08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:31, skipping insertion in model container [2024-11-19 17:19:31,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:30" (2/3) ... [2024-11-19 17:19:31,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b63a08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:31, skipping insertion in model container [2024-11-19 17:19:31,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:31" (3/3) ... [2024-11-19 17:19:31,683 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label32.c [2024-11-19 17:19:31,695 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:19:31,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:19:31,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:19:31,756 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;@76ccde25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:19:31,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:19:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-19 17:19:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 17:19:31,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:31,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:19:31,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:31,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -725830373, now seen corresponding path program 1 times [2024-11-19 17:19:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810997610] [2024-11-19 17:19:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:31,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:32,209 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-19 17:19:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810997610] [2024-11-19 17:19:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810997610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 17:19:32,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495845455] [2024-11-19 17:19:32,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:32,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:32,236 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-19 17:19:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:32,841 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-19 17:19:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:32,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-19 17:19:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:32,851 INFO L225 Difference]: With dead ends: 600 [2024-11-19 17:19:32,852 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 17:19:32,855 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-19 17:19:32,858 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 57 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:32,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 17:19:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 17:19:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-19 17:19:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-19 17:19:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-19 17:19:32,901 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 109 [2024-11-19 17:19:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:32,902 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-19 17:19:32,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-19 17:19:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-19 17:19:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 17:19:32,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:32,905 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:19:32,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 17:19:32,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash 762704880, now seen corresponding path program 1 times [2024-11-19 17:19:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721054319] [2024-11-19 17:19:32,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:32,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:19:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721054319] [2024-11-19 17:19:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721054319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:19:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064991672] [2024-11-19 17:19:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:33,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:33,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:33,118 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:19:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:33,521 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2024-11-19 17:19:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:33,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 17:19:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:33,523 INFO L225 Difference]: With dead ends: 758 [2024-11-19 17:19:33,524 INFO L226 Difference]: Without dead ends: 453 [2024-11-19 17:19:33,524 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-19 17:19:33,525 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 55 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:33,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 17:19:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-19 17:19:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-19 17:19:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 0 states have call successors, (0), 0 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-19 17:19:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2024-11-19 17:19:33,549 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 114 [2024-11-19 17:19:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:33,550 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2024-11-19 17:19:33,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:19:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2024-11-19 17:19:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 17:19:33,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:33,556 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 17:19:33,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 17:19:33,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:33,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1213017781, now seen corresponding path program 1 times [2024-11-19 17:19:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:33,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546910094] [2024-11-19 17:19:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:33,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:19:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546910094] [2024-11-19 17:19:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546910094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:33,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:33,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 17:19:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026777911] [2024-11-19 17:19:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:33,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:33,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:33,637 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-19 17:19:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:33,978 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2024-11-19 17:19:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:33,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-19 17:19:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:33,983 INFO L225 Difference]: With dead ends: 1325 [2024-11-19 17:19:33,983 INFO L226 Difference]: Without dead ends: 874 [2024-11-19 17:19:33,983 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-19 17:19:33,984 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:33,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 81 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:19:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-19 17:19:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-19 17:19:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2290950744558993) internal successors, (1073), 873 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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-19 17:19:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1073 transitions. [2024-11-19 17:19:34,006 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1073 transitions. Word has length 126 [2024-11-19 17:19:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:34,006 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1073 transitions. [2024-11-19 17:19:34,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-19 17:19:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1073 transitions. [2024-11-19 17:19:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 17:19:34,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:34,010 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:19:34,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 17:19:34,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:34,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash -339335512, now seen corresponding path program 1 times [2024-11-19 17:19:34,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:34,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96467923] [2024-11-19 17:19:34,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:34,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 17:19:34,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96467923] [2024-11-19 17:19:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96467923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:19:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152689155] [2024-11-19 17:19:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:34,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:34,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:34,121 INFO L87 Difference]: Start difference. First operand 874 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-19 17:19:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:34,455 INFO L93 Difference]: Finished difference Result 2028 states and 2468 transitions. [2024-11-19 17:19:34,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:34,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 155 [2024-11-19 17:19:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:34,458 INFO L225 Difference]: With dead ends: 2028 [2024-11-19 17:19:34,458 INFO L226 Difference]: Without dead ends: 1014 [2024-11-19 17:19:34,459 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-19 17:19:34,460 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 158 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:34,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 66 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:19:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-19 17:19:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012. [2024-11-19 17:19:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.142433234421365) internal successors, (1155), 1011 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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-19 17:19:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1155 transitions. [2024-11-19 17:19:34,479 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1155 transitions. Word has length 155 [2024-11-19 17:19:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:34,479 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1155 transitions. [2024-11-19 17:19:34,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-19 17:19:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1155 transitions. [2024-11-19 17:19:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 17:19:34,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:34,483 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:19:34,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 17:19:34,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:34,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1274446750, now seen corresponding path program 1 times [2024-11-19 17:19:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:34,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708785481] [2024-11-19 17:19:34,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 17:19:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:34,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708785481] [2024-11-19 17:19:34,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708785481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:34,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:19:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693603095] [2024-11-19 17:19:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:34,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:34,578 INFO L87 Difference]: Start difference. First operand 1012 states and 1155 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-19 17:19:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:34,884 INFO L93 Difference]: Finished difference Result 2870 states and 3282 transitions. [2024-11-19 17:19:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:34,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 159 [2024-11-19 17:19:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:34,889 INFO L225 Difference]: With dead ends: 2870 [2024-11-19 17:19:34,889 INFO L226 Difference]: Without dead ends: 1860 [2024-11-19 17:19:34,890 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-19 17:19:34,891 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 136 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:34,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 264 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:19:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-19 17:19:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1854. [2024-11-19 17:19:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.1192660550458715) internal successors, (2074), 1853 states have internal predecessors, (2074), 0 states have call successors, (0), 0 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-19 17:19:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2074 transitions. [2024-11-19 17:19:34,912 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2074 transitions. Word has length 159 [2024-11-19 17:19:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:34,913 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2074 transitions. [2024-11-19 17:19:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-19 17:19:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2074 transitions. [2024-11-19 17:19:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-19 17:19:34,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:34,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:19:34,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 17:19:34,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:34,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:34,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1975655905, now seen corresponding path program 1 times [2024-11-19 17:19:34,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:34,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891575408] [2024-11-19 17:19:34,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:34,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:19:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891575408] [2024-11-19 17:19:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891575408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:35,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 17:19:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579593247] [2024-11-19 17:19:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:35,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:35,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:35,034 INFO L87 Difference]: Start difference. First operand 1854 states and 2074 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:19:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:35,215 INFO L93 Difference]: Finished difference Result 3411 states and 3824 transitions. [2024-11-19 17:19:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:35,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-19 17:19:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:35,221 INFO L225 Difference]: With dead ends: 3411 [2024-11-19 17:19:35,221 INFO L226 Difference]: Without dead ends: 1417 [2024-11-19 17:19:35,222 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-19 17:19:35,224 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:35,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 19 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:19:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-19 17:19:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1417. [2024-11-19 17:19:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 1.0741525423728813) internal successors, (1521), 1416 states have internal predecessors, (1521), 0 states have call successors, (0), 0 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-19 17:19:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1521 transitions. [2024-11-19 17:19:35,241 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1521 transitions. Word has length 163 [2024-11-19 17:19:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:35,241 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 1521 transitions. [2024-11-19 17:19:35,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:19:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1521 transitions. [2024-11-19 17:19:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 17:19:35,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:35,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:19:35,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 17:19:35,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:35,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash -534775054, now seen corresponding path program 1 times [2024-11-19 17:19:35,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:35,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847117674] [2024-11-19 17:19:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:19:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847117674] [2024-11-19 17:19:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847117674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:35,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:35,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:19:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076958605] [2024-11-19 17:19:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:35,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:35,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:35,318 INFO L87 Difference]: Start difference. First operand 1417 states and 1521 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:19:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:35,571 INFO L93 Difference]: Finished difference Result 3111 states and 3344 transitions. [2024-11-19 17:19:35,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:35,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-11-19 17:19:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:35,577 INFO L225 Difference]: With dead ends: 3111 [2024-11-19 17:19:35,577 INFO L226 Difference]: Without dead ends: 1836 [2024-11-19 17:19:35,578 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-19 17:19:35,579 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 131 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:35,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 29 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:19:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-19 17:19:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1416. [2024-11-19 17:19:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.0734982332155476) internal successors, (1519), 1415 states have internal predecessors, (1519), 0 states have call successors, (0), 0 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-19 17:19:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1519 transitions. [2024-11-19 17:19:35,603 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1519 transitions. Word has length 181 [2024-11-19 17:19:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:35,603 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1519 transitions. [2024-11-19 17:19:35,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:19:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1519 transitions. [2024-11-19 17:19:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-19 17:19:35,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:35,606 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 17:19:35,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 17:19:35,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:35,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1036459708, now seen corresponding path program 1 times [2024-11-19 17:19:35,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:35,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576625806] [2024-11-19 17:19:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 17:19:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576625806] [2024-11-19 17:19:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576625806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:35,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:35,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:19:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300874821] [2024-11-19 17:19:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:35,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:35,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:35,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:35,729 INFO L87 Difference]: Start difference. First operand 1416 states and 1519 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-19 17:19:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:35,986 INFO L93 Difference]: Finished difference Result 2830 states and 3064 transitions. [2024-11-19 17:19:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 202 [2024-11-19 17:19:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:35,990 INFO L225 Difference]: With dead ends: 2830 [2024-11-19 17:19:35,990 INFO L226 Difference]: Without dead ends: 1276 [2024-11-19 17:19:35,991 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-19 17:19:35,992 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 80 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:35,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 206 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:19:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-19 17:19:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2024-11-19 17:19:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.0580392156862746) internal successors, (1349), 1275 states have internal predecessors, (1349), 0 states have call successors, (0), 0 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-19 17:19:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1349 transitions. [2024-11-19 17:19:36,006 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1349 transitions. Word has length 202 [2024-11-19 17:19:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:36,007 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1349 transitions. [2024-11-19 17:19:36,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-19 17:19:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1349 transitions. [2024-11-19 17:19:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-19 17:19:36,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:36,009 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, 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] [2024-11-19 17:19:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 17:19:36,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2028142587, now seen corresponding path program 1 times [2024-11-19 17:19:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539514972] [2024-11-19 17:19:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 17:19:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539514972] [2024-11-19 17:19:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539514972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:19:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794975252] [2024-11-19 17:19:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:36,120 INFO L87 Difference]: Start difference. First operand 1276 states and 1349 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-19 17:19:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:36,409 INFO L93 Difference]: Finished difference Result 2691 states and 2869 transitions. [2024-11-19 17:19:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 237 [2024-11-19 17:19:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:36,412 INFO L225 Difference]: With dead ends: 2691 [2024-11-19 17:19:36,412 INFO L226 Difference]: Without dead ends: 1272 [2024-11-19 17:19:36,413 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-19 17:19:36,414 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 121 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:36,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 182 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:19:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-11-19 17:19:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1272. [2024-11-19 17:19:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 1.053501180173092) internal successors, (1339), 1271 states have internal predecessors, (1339), 0 states have call successors, (0), 0 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-19 17:19:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1339 transitions. [2024-11-19 17:19:36,427 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1339 transitions. Word has length 237 [2024-11-19 17:19:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:36,427 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1339 transitions. [2024-11-19 17:19:36,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-19 17:19:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1339 transitions. [2024-11-19 17:19:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-19 17:19:36,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:19:36,430 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:19:36,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 17:19:36,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:19:36,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:19:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1878415406, now seen corresponding path program 1 times [2024-11-19 17:19:36,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:19:36,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775790579] [2024-11-19 17:19:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:19:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:19:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:19:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-19 17:19:36,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:19:36,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775790579] [2024-11-19 17:19:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775790579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:19:36,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:19:36,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 17:19:36,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302977348] [2024-11-19 17:19:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:19:36,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:19:36,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:19:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:19:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:19:36,572 INFO L87 Difference]: Start difference. First operand 1272 states and 1339 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-19 17:19:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:19:36,699 INFO L93 Difference]: Finished difference Result 1272 states and 1339 transitions. [2024-11-19 17:19:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:19:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2024-11-19 17:19:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:19:36,700 INFO L225 Difference]: With dead ends: 1272 [2024-11-19 17:19:36,700 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 17:19:36,701 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-19 17:19:36,702 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:19:36,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 13 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:19:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 17:19:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 17:19:36,703 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-19 17:19:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 17:19:36,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2024-11-19 17:19:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:19:36,704 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 17:19:36,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-19 17:19:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 17:19:36,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 17:19:36,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 17:19:36,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 17:19:36,709 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:19:36,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 17:19:36,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 17:19:36,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:19:36 BoogieIcfgContainer [2024-11-19 17:19:36,879 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 17:19:36,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 17:19:36,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 17:19:36,880 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 17:19:36,880 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:31" (3/4) ... [2024-11-19 17:19:36,882 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 17:19:36,901 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 17:19:36,902 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 17:19:36,903 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 17:19:36,903 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 17:19:37,025 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 17:19:37,025 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 17:19:37,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 17:19:37,026 INFO L158 Benchmark]: Toolchain (without parser) took 6814.58ms. Allocated memory was 222.3MB in the beginning and 306.2MB in the end (delta: 83.9MB). Free memory was 148.6MB in the beginning and 105.7MB in the end (delta: 42.9MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. [2024-11-19 17:19:37,026 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:19:37,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.43ms. Allocated memory is still 222.3MB. Free memory was 148.6MB in the beginning and 119.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 17:19:37,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.51ms. Allocated memory is still 222.3MB. Free memory was 119.9MB in the beginning and 114.4MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 17:19:37,026 INFO L158 Benchmark]: Boogie Preprocessor took 87.24ms. Allocated memory is still 222.3MB. Free memory was 114.4MB in the beginning and 109.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 17:19:37,026 INFO L158 Benchmark]: RCFGBuilder took 921.97ms. Allocated memory is still 222.3MB. Free memory was 109.4MB in the beginning and 143.2MB in the end (delta: -33.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-19 17:19:37,027 INFO L158 Benchmark]: TraceAbstraction took 5201.09ms. Allocated memory was 222.3MB in the beginning and 306.2MB in the end (delta: 83.9MB). Free memory was 143.2MB in the beginning and 118.3MB in the end (delta: 24.8MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2024-11-19 17:19:37,027 INFO L158 Benchmark]: Witness Printer took 145.69ms. Allocated memory is still 306.2MB. Free memory was 118.3MB in the beginning and 105.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 17:19:37,028 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.13ms. Allocated memory is still 134.2MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.43ms. Allocated memory is still 222.3MB. Free memory was 148.6MB in the beginning and 119.9MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.51ms. Allocated memory is still 222.3MB. Free memory was 119.9MB in the beginning and 114.4MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.24ms. Allocated memory is still 222.3MB. Free memory was 114.4MB in the beginning and 109.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 921.97ms. Allocated memory is still 222.3MB. Free memory was 109.4MB in the beginning and 143.2MB in the end (delta: -33.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5201.09ms. Allocated memory was 222.3MB in the beginning and 306.2MB in the end (delta: 83.9MB). Free memory was 143.2MB in the beginning and 118.3MB in the end (delta: 24.8MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 145.69ms. Allocated memory is still 306.2MB. Free memory was 118.3MB in the beginning and 105.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 509]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1121 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3077 IncrementalHoareTripleChecker+Invalid, 3645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 568 mSolverCounterUnsat, 1163 mSDtfsCounter, 3077 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1854occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 430 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1692 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 3143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 859/859 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: 616]: Loop Invariant Derived loop invariant: ((((((((((a17 <= 7) && (a28 == 10)) || ((((a17 == 8) && (9 <= a28)) && (a28 <= 10)) && (a19 == 1))) || (((a25 == 1) && (a17 <= 7)) && (a28 <= 10))) || ((a17 == 8) && (a28 <= 7))) || ((((a17 == 8) && (a25 == 1)) && (a19 == 1)) && (a11 != 1))) || ((a28 == 10) && (a19 == 1))) || ((((a17 == 8) && (a25 == 1)) && (a28 <= 10)) && (a19 == 1))) || (((a17 == 8) && (a28 <= 10)) && (a11 != 1))) || ((((9 <= a28) && (a17 <= 7)) && (a28 <= 10)) && (a11 != 1))) RESULT: Ultimate proved your program to be correct! [2024-11-19 17:19:37,049 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