./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label05.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 7fb47f955ea6ba1edf33456e69e9d22d4cc1ecd78cb5e200db0c0a5026f9dd33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:19:04,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:19:04,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:19:04,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:19:04,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:19:04,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:19:04,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:19:04,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:19:04,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:19:04,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:19:04,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:19:04,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:19:04,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:19:04,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:19:04,743 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:19:04,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:19:04,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:19:04,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:19:04,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:19:04,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:19:04,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:19:04,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:19:04,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:19:04,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:19:04,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:19:04,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:19:04,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:19:04,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:19:04,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:19:04,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:19:04,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:19:04,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:19:04,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:19:04,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:19:04,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:19:04,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:19:04,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:19:04,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:19:04,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:19:04,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:19:04,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:19:04,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:19:04,756 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 -> 7fb47f955ea6ba1edf33456e69e9d22d4cc1ecd78cb5e200db0c0a5026f9dd33 [2024-11-18 10:19:05,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:19:05,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:19:05,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:19:05,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:19:05,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:19:05,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label05.c [2024-11-18 10:19:06,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:19:06,790 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:19:06,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label05.c [2024-11-18 10:19:06,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f82c6d7/5f71dfcab03c47658a368e3dc9af85f3/FLAGe80cc9c08 [2024-11-18 10:19:06,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f82c6d7/5f71dfcab03c47658a368e3dc9af85f3 [2024-11-18 10:19:06,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:19:06,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:19:06,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:19:06,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:19:06,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:19:06,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:06" (1/1) ... [2024-11-18 10:19:06,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a26ff64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:06, skipping insertion in model container [2024-11-18 10:19:06,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:06" (1/1) ... [2024-11-18 10:19:06,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:19:07,176 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/Problem10_label05.c[5981,5994] [2024-11-18 10:19:07,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:19:07,334 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:19:07,367 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/Problem10_label05.c[5981,5994] [2024-11-18 10:19:07,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:19:07,468 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:19:07,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07 WrapperNode [2024-11-18 10:19:07,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:19:07,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:19:07,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:19:07,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:19:07,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,569 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-18 10:19:07,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:19:07,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:19:07,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:19:07,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:19:07,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,625 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-18 10:19:07,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:19:07,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:19:07,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:19:07,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:19:07,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (1/1) ... [2024-11-18 10:19:07,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:19:07,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:19:07,731 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-18 10:19:07,736 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-18 10:19:07,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:19:07,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:19:07,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:19:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:19:07,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:19:07,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:19:09,025 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 10:19:09,025 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:19:09,050 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:19:09,050 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:19:09,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:09 BoogieIcfgContainer [2024-11-18 10:19:09,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:19:09,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:19:09,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:19:09,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:19:09,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:19:06" (1/3) ... [2024-11-18 10:19:09,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ffbdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:09, skipping insertion in model container [2024-11-18 10:19:09,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:07" (2/3) ... [2024-11-18 10:19:09,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ffbdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:09, skipping insertion in model container [2024-11-18 10:19:09,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:09" (3/3) ... [2024-11-18 10:19:09,064 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label05.c [2024-11-18 10:19:09,084 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:19:09,084 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:19:09,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:19:09,169 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;@4136f392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:19:09,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:19:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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-18 10:19:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 10:19:09,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:09,187 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] [2024-11-18 10:19:09,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:09,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2024-11-18 10:19:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924231093] [2024-11-18 10:19:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:09,560 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-18 10:19:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924231093] [2024-11-18 10:19:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924231093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794212316] [2024-11-18 10:19:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:09,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:09,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:09,630 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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-18 10:19:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:10,471 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-18 10:19:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:10,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-18 10:19:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:10,489 INFO L225 Difference]: With dead ends: 552 [2024-11-18 10:19:10,489 INFO L226 Difference]: Without dead ends: 282 [2024-11-18 10:19:10,494 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-18 10:19:10,498 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:10,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:19:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-18 10:19:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-18 10:19:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 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-18 10:19:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-18 10:19:10,557 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 52 [2024-11-18 10:19:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:10,557 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-18 10:19:10,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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-18 10:19:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-18 10:19:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 10:19:10,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:10,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:10,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:19:10,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:10,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1275698798, now seen corresponding path program 1 times [2024-11-18 10:19:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923286899] [2024-11-18 10:19:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:10,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:10,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923286899] [2024-11-18 10:19:10,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923286899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:10,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:10,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357369455] [2024-11-18 10:19:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:10,886 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:11,465 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2024-11-18 10:19:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:11,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-18 10:19:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:11,469 INFO L225 Difference]: With dead ends: 701 [2024-11-18 10:19:11,469 INFO L226 Difference]: Without dead ends: 421 [2024-11-18 10:19:11,470 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-18 10:19:11,471 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 94 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:11,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:19:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-18 10:19:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-18 10:19:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 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-18 10:19:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2024-11-18 10:19:11,490 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 118 [2024-11-18 10:19:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:11,491 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2024-11-18 10:19:11,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2024-11-18 10:19:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-18 10:19:11,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:11,496 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, 1, 1, 1, 1, 1, 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-18 10:19:11,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:19:11,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:11,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1924622465, now seen corresponding path program 1 times [2024-11-18 10:19:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159003231] [2024-11-18 10:19:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159003231] [2024-11-18 10:19:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159003231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:11,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:11,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954597865] [2024-11-18 10:19:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:11,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:11,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:11,837 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-18 10:19:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:12,273 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2024-11-18 10:19:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:12,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-18 10:19:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:12,276 INFO L225 Difference]: With dead ends: 979 [2024-11-18 10:19:12,276 INFO L226 Difference]: Without dead ends: 560 [2024-11-18 10:19:12,278 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-18 10:19:12,279 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:12,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-18 10:19:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-18 10:19:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 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-18 10:19:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2024-11-18 10:19:12,306 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 125 [2024-11-18 10:19:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:12,306 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2024-11-18 10:19:12,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-18 10:19:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2024-11-18 10:19:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-18 10:19:12,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:12,310 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, 1, 1, 1, 1, 1, 1, 1, 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-18 10:19:12,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:19:12,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:12,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1091712892, now seen corresponding path program 1 times [2024-11-18 10:19:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681971512] [2024-11-18 10:19:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681971512] [2024-11-18 10:19:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681971512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:12,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466482353] [2024-11-18 10:19:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:12,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:12,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:12,475 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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-18 10:19:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:12,963 INFO L93 Difference]: Finished difference Result 979 states and 1199 transitions. [2024-11-18 10:19:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-18 10:19:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:12,969 INFO L225 Difference]: With dead ends: 979 [2024-11-18 10:19:12,970 INFO L226 Difference]: Without dead ends: 977 [2024-11-18 10:19:12,971 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-18 10:19:12,972 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:12,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-18 10:19:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2024-11-18 10:19:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2736389684813754) internal successors, (889), 698 states have internal predecessors, (889), 0 states have call successors, (0), 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-18 10:19:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 889 transitions. [2024-11-18 10:19:13,001 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 889 transitions. Word has length 127 [2024-11-18 10:19:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:13,002 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 889 transitions. [2024-11-18 10:19:13,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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-18 10:19:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 889 transitions. [2024-11-18 10:19:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 10:19:13,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:13,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:19:13,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:19:13,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash -190546644, now seen corresponding path program 1 times [2024-11-18 10:19:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117913292] [2024-11-18 10:19:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117913292] [2024-11-18 10:19:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117913292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:13,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:13,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749186950] [2024-11-18 10:19:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:13,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:19:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:19:13,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:19:13,482 INFO L87 Difference]: Start difference. First operand 699 states and 889 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-18 10:19:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:14,006 INFO L93 Difference]: Finished difference Result 1257 states and 1627 transitions. [2024-11-18 10:19:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:19:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-11-18 10:19:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:14,009 INFO L225 Difference]: With dead ends: 1257 [2024-11-18 10:19:14,009 INFO L226 Difference]: Without dead ends: 699 [2024-11-18 10:19:14,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:19:14,011 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:14,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-18 10:19:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-18 10:19:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2664756446991403) internal successors, (884), 698 states have internal predecessors, (884), 0 states have call successors, (0), 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-18 10:19:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 884 transitions. [2024-11-18 10:19:14,024 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 884 transitions. Word has length 170 [2024-11-18 10:19:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:14,025 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 884 transitions. [2024-11-18 10:19:14,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-18 10:19:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 884 transitions. [2024-11-18 10:19:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-18 10:19:14,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:14,028 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-18 10:19:14,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:19:14,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:14,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:14,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1143734122, now seen corresponding path program 1 times [2024-11-18 10:19:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806669022] [2024-11-18 10:19:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:14,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:14,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806669022] [2024-11-18 10:19:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806669022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 10:19:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749301472] [2024-11-18 10:19:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:14,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 10:19:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 10:19:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:14,442 INFO L87 Difference]: Start difference. First operand 699 states and 884 transitions. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 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-18 10:19:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:14,973 INFO L93 Difference]: Finished difference Result 1312 states and 1677 transitions. [2024-11-18 10:19:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 10:19:14,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-11-18 10:19:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:14,976 INFO L225 Difference]: With dead ends: 1312 [2024-11-18 10:19:14,977 INFO L226 Difference]: Without dead ends: 699 [2024-11-18 10:19:14,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:14,979 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:14,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-18 10:19:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-18 10:19:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2607449856733524) internal successors, (880), 698 states have internal predecessors, (880), 0 states have call successors, (0), 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-18 10:19:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 880 transitions. [2024-11-18 10:19:14,993 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 880 transitions. Word has length 205 [2024-11-18 10:19:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 880 transitions. [2024-11-18 10:19:14,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 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-18 10:19:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 880 transitions. [2024-11-18 10:19:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-18 10:19:14,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:14,997 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-18 10:19:14,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:19:14,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:14,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1025274224, now seen corresponding path program 1 times [2024-11-18 10:19:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:14,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487455463] [2024-11-18 10:19:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:15,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:15,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487455463] [2024-11-18 10:19:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487455463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409248302] [2024-11-18 10:19:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:15,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:15,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:15,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:15,211 INFO L87 Difference]: Start difference. First operand 699 states and 880 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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-18 10:19:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:15,687 INFO L93 Difference]: Finished difference Result 1535 states and 2042 transitions. [2024-11-18 10:19:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2024-11-18 10:19:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:15,692 INFO L225 Difference]: With dead ends: 1535 [2024-11-18 10:19:15,692 INFO L226 Difference]: Without dead ends: 977 [2024-11-18 10:19:15,694 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-18 10:19:15,694 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:15,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 189 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-18 10:19:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-18 10:19:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2592213114754098) internal successors, (1229), 976 states have internal predecessors, (1229), 0 states have call successors, (0), 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-18 10:19:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1229 transitions. [2024-11-18 10:19:15,714 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1229 transitions. Word has length 241 [2024-11-18 10:19:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:15,714 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1229 transitions. [2024-11-18 10:19:15,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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-18 10:19:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1229 transitions. [2024-11-18 10:19:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-18 10:19:15,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:15,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:19:15,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:19:15,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -374221687, now seen corresponding path program 1 times [2024-11-18 10:19:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576430464] [2024-11-18 10:19:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 114 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576430464] [2024-11-18 10:19:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576430464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:19:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086515313] [2024-11-18 10:19:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:16,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:19:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:19:16,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:19:16,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 10:19:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:16,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:19:16,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:19:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-18 10:19:16,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:19:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086515313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:19:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-18 10:19:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215294037] [2024-11-18 10:19:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:16,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:16,680 INFO L87 Difference]: Start difference. First operand 977 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:17,123 INFO L93 Difference]: Finished difference Result 2091 states and 2645 transitions. [2024-11-18 10:19:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2024-11-18 10:19:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:17,128 INFO L225 Difference]: With dead ends: 2091 [2024-11-18 10:19:17,128 INFO L226 Difference]: Without dead ends: 1255 [2024-11-18 10:19:17,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:17,132 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:17,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-18 10:19:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-18 10:19:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 0 states have call successors, (0), 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-18 10:19:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2024-11-18 10:19:17,162 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 284 [2024-11-18 10:19:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2024-11-18 10:19:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2024-11-18 10:19:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-18 10:19:17,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:17,168 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:19:17,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 10:19:17,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:19:17,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:17,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1812017199, now seen corresponding path program 1 times [2024-11-18 10:19:17,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211914941] [2024-11-18 10:19:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-18 10:19:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211914941] [2024-11-18 10:19:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211914941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808959568] [2024-11-18 10:19:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:17,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:17,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:17,636 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-18 10:19:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:18,102 INFO L93 Difference]: Finished difference Result 2647 states and 3154 transitions. [2024-11-18 10:19:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 314 [2024-11-18 10:19:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:18,109 INFO L225 Difference]: With dead ends: 2647 [2024-11-18 10:19:18,109 INFO L226 Difference]: Without dead ends: 1533 [2024-11-18 10:19:18,111 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-18 10:19:18,112 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 63 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:18,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-11-18 10:19:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1394. [2024-11-18 10:19:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.1593682699210337) internal successors, (1615), 1393 states have internal predecessors, (1615), 0 states have call successors, (0), 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-18 10:19:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1615 transitions. [2024-11-18 10:19:18,140 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1615 transitions. Word has length 314 [2024-11-18 10:19:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:18,140 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1615 transitions. [2024-11-18 10:19:18,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-18 10:19:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1615 transitions. [2024-11-18 10:19:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-18 10:19:18,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:18,146 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:19:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 10:19:18,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:18,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1741531862, now seen corresponding path program 1 times [2024-11-18 10:19:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062599786] [2024-11-18 10:19:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-18 10:19:18,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:18,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062599786] [2024-11-18 10:19:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062599786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:18,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:18,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775137905] [2024-11-18 10:19:18,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:18,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:18,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:18,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:18,372 INFO L87 Difference]: Start difference. First operand 1394 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:18,839 INFO L93 Difference]: Finished difference Result 1674 states and 1918 transitions. [2024-11-18 10:19:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2024-11-18 10:19:18,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:18,846 INFO L225 Difference]: With dead ends: 1674 [2024-11-18 10:19:18,846 INFO L226 Difference]: Without dead ends: 1672 [2024-11-18 10:19:18,847 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-18 10:19:18,847 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:18,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 11 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2024-11-18 10:19:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1255. [2024-11-18 10:19:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.164274322169059) internal successors, (1460), 1254 states have internal predecessors, (1460), 0 states have call successors, (0), 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-18 10:19:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1460 transitions. [2024-11-18 10:19:18,873 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1460 transitions. Word has length 324 [2024-11-18 10:19:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:18,874 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1460 transitions. [2024-11-18 10:19:18,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1460 transitions. [2024-11-18 10:19:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-18 10:19:18,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:18,879 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:19:18,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 10:19:18,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:18,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2086864510, now seen corresponding path program 1 times [2024-11-18 10:19:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017164199] [2024-11-18 10:19:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 349 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017164199] [2024-11-18 10:19:19,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017164199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:19:19,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538360425] [2024-11-18 10:19:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:19,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:19:19,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:19:19,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:19:19,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 10:19:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:19,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:19:19,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:19:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-18 10:19:19,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:19:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538360425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:19,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:19:19,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-18 10:19:19,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586556614] [2024-11-18 10:19:19,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:19,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:19,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:19,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:19,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:19,685 INFO L87 Difference]: Start difference. First operand 1255 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-18 10:19:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:20,161 INFO L93 Difference]: Finished difference Result 3203 states and 3742 transitions. [2024-11-18 10:19:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 352 [2024-11-18 10:19:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:20,169 INFO L225 Difference]: With dead ends: 3203 [2024-11-18 10:19:20,169 INFO L226 Difference]: Without dead ends: 2089 [2024-11-18 10:19:20,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:20,171 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:20,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-18 10:19:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2024-11-18 10:19:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1345785440613028) internal successors, (2369), 2088 states have internal predecessors, (2369), 0 states have call successors, (0), 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-18 10:19:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2369 transitions. [2024-11-18 10:19:20,208 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2369 transitions. Word has length 352 [2024-11-18 10:19:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:20,209 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2369 transitions. [2024-11-18 10:19:20,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-18 10:19:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2369 transitions. [2024-11-18 10:19:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-18 10:19:20,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:20,241 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:20,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 10:19:20,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 10:19:20,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:20,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:20,443 INFO L85 PathProgramCache]: Analyzing trace with hash 512721694, now seen corresponding path program 1 times [2024-11-18 10:19:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56217708] [2024-11-18 10:19:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:20,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-18 10:19:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56217708] [2024-11-18 10:19:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56217708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303749614] [2024-11-18 10:19:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:20,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:20,700 INFO L87 Difference]: Start difference. First operand 2089 states and 2369 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-18 10:19:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:21,150 INFO L93 Difference]: Finished difference Result 4035 states and 4592 transitions. [2024-11-18 10:19:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:21,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 365 [2024-11-18 10:19:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:21,152 INFO L225 Difference]: With dead ends: 4035 [2024-11-18 10:19:21,152 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:19:21,157 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-18 10:19:21,157 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 94 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:21,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 212 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:19:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:19:21,158 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-18 10:19:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:19:21,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 365 [2024-11-18 10:19:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:21,159 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:19:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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-18 10:19:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:19:21,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:19:21,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:19:21,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 10:19:21,166 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:21,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:19:21,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:19:21,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:19:21 BoogieIcfgContainer [2024-11-18 10:19:21,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:19:21,439 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:19:21,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:19:21,439 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:19:21,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:09" (3/4) ... [2024-11-18 10:19:21,442 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:19:21,454 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 10:19:21,455 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:19:21,456 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:19:21,456 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:19:21,624 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:19:21,625 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:19:21,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:19:21,626 INFO L158 Benchmark]: Toolchain (without parser) took 14792.00ms. Allocated memory was 201.3MB in the beginning and 421.5MB in the end (delta: 220.2MB). Free memory was 127.5MB in the beginning and 141.1MB in the end (delta: -13.6MB). Peak memory consumption was 209.4MB. Max. memory is 16.1GB. [2024-11-18 10:19:21,626 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:19:21,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.80ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 156.6MB in the end (delta: -29.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-18 10:19:21,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.06ms. Allocated memory is still 201.3MB. Free memory was 156.6MB in the beginning and 148.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 10:19:21,627 INFO L158 Benchmark]: Boogie Preprocessor took 122.24ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 138.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 10:19:21,628 INFO L158 Benchmark]: RCFGBuilder took 1357.35ms. Allocated memory was 201.3MB in the beginning and 291.5MB in the end (delta: 90.2MB). Free memory was 138.8MB in the beginning and 239.5MB in the end (delta: -100.7MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2024-11-18 10:19:21,628 INFO L158 Benchmark]: TraceAbstraction took 12382.92ms. Allocated memory was 291.5MB in the beginning and 421.5MB in the end (delta: 130.0MB). Free memory was 238.5MB in the beginning and 152.7MB in the end (delta: 85.8MB). Peak memory consumption was 215.8MB. Max. memory is 16.1GB. [2024-11-18 10:19:21,629 INFO L158 Benchmark]: Witness Printer took 186.97ms. Allocated memory is still 421.5MB. Free memory was 152.7MB in the beginning and 141.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 10:19:21,630 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.21ms. Allocated memory is still 201.3MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.80ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 156.6MB in the end (delta: -29.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.06ms. Allocated memory is still 201.3MB. Free memory was 156.6MB in the beginning and 148.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.24ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 138.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1357.35ms. Allocated memory was 201.3MB in the beginning and 291.5MB in the end (delta: 90.2MB). Free memory was 138.8MB in the beginning and 239.5MB in the end (delta: -100.7MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12382.92ms. Allocated memory was 291.5MB in the beginning and 421.5MB in the end (delta: 130.0MB). Free memory was 238.5MB in the beginning and 152.7MB in the end (delta: 85.8MB). Peak memory consumption was 215.8MB. Max. memory is 16.1GB. * Witness Printer took 186.97ms. Allocated memory is still 421.5MB. Free memory was 152.7MB in the beginning and 141.1MB in the end (delta: 11.5MB). 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: 170]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1076 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1076 mSDsluCounter, 1401 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 669 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4889 IncrementalHoareTripleChecker+Invalid, 5558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 669 mSolverCounterUnsat, 1331 mSDtfsCounter, 4889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2089occurred in iteration=11, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 834 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3313 NumberOfCodeBlocks, 3313 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3299 ConstructedInterpolants, 0 QuantifiedInterpolants, 11625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2788/2928 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: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) || (((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || ((((7 <= a19) && (a10 == 1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:19:21,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE