./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.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 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:15:31,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:15:31,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:15:31,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:15:31,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:15:31,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:15:31,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:15:31,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:15:31,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:15:31,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:15:31,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:15:31,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:15:31,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:15:31,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:15:31,887 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:15:31,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:15:31,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:15:31,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:15:31,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:15:31,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:15:31,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:15:31,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:15:31,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:15:31,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:15:31,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:15:31,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:15:31,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:15:31,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:15:31,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:15:31,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:15:31,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:15:31,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:15:31,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:15:31,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:15:31,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:15:31,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:15:31,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:15:31,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:15:31,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:15:31,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:15:31,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:15:31,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:15:31,902 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 -> 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 [2024-10-12 15:15:32,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:15:32,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:15:32,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:15:32,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:15:32,191 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:15:32,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-10-12 15:15:33,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:15:34,006 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:15:34,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2024-10-12 15:15:34,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184c6bdca/da17ac3ea3ef4c519e5d0235d622ae57/FLAGb9ced5354 [2024-10-12 15:15:34,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184c6bdca/da17ac3ea3ef4c519e5d0235d622ae57 [2024-10-12 15:15:34,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:15:34,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:15:34,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:15:34,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:15:34,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:15:34,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:34,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281d748b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34, skipping insertion in model container [2024-10-12 15:15:34,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:34,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:15:34,738 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-10-12 15:15:34,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:15:34,776 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:15:34,870 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c[21088,21101] [2024-10-12 15:15:34,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:15:34,901 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:15:34,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34 WrapperNode [2024-10-12 15:15:34,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:15:34,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:15:34,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:15:34,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:15:34,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:34,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:34,974 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-12 15:15:34,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:15:34,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:15:34,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:15:34,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:15:34,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:34,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:34,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,020 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:15:35,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:15:35,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:15:35,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:15:35,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:15:35,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (1/1) ... [2024-10-12 15:15:35,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:15:35,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:35,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:15:35,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:15:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:15:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:15:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:15:35,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:15:35,253 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:15:35,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:15:36,390 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-12 15:15:36,390 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:15:36,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:15:36,475 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:15:36,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:36 BoogieIcfgContainer [2024-10-12 15:15:36,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:15:36,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:15:36,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:15:36,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:15:36,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:15:34" (1/3) ... [2024-10-12 15:15:36,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4950a232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:36, skipping insertion in model container [2024-10-12 15:15:36,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:15:34" (2/3) ... [2024-10-12 15:15:36,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4950a232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:15:36, skipping insertion in model container [2024-10-12 15:15:36,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:36" (3/3) ... [2024-10-12 15:15:36,488 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30.c [2024-10-12 15:15:36,507 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:15:36,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:15:36,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:15:36,588 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;@793d8068, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:15:36,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:15:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 15:15:36,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:36,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:36,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:36,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash -765933257, now seen corresponding path program 1 times [2024-10-12 15:15:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:36,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407248069] [2024-10-12 15:15:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:36,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407248069] [2024-10-12 15:15:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407248069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:37,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:15:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611069577] [2024-10-12 15:15:37,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:37,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:15:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:37,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:15:37,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:15:37,049 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:37,082 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-12 15:15:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:15:37,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-12 15:15:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:37,093 INFO L225 Difference]: With dead ends: 271 [2024-10-12 15:15:37,093 INFO L226 Difference]: Without dead ends: 134 [2024-10-12 15:15:37,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:15:37,100 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:37,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:15:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-12 15:15:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-12 15:15:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-12 15:15:37,151 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 124 [2024-10-12 15:15:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:37,152 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-12 15:15:37,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-12 15:15:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 15:15:37,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:37,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:37,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:15:37,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1182057605, now seen corresponding path program 1 times [2024-10-12 15:15:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625264536] [2024-10-12 15:15:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625264536] [2024-10-12 15:15:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625264536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:37,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558296160] [2024-10-12 15:15:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:37,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:37,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:37,776 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:38,658 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2024-10-12 15:15:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-12 15:15:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:38,667 INFO L225 Difference]: With dead ends: 529 [2024-10-12 15:15:38,667 INFO L226 Difference]: Without dead ends: 396 [2024-10-12 15:15:38,668 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-10-12 15:15:38,672 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 270 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:38,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 35 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:15:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-12 15:15:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-12 15:15:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 516 transitions. [2024-10-12 15:15:38,708 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 516 transitions. Word has length 124 [2024-10-12 15:15:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:38,709 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 516 transitions. [2024-10-12 15:15:38,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 516 transitions. [2024-10-12 15:15:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 15:15:38,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:38,715 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:38,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:15:38,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:38,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1289066740, now seen corresponding path program 1 times [2024-10-12 15:15:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:38,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660151559] [2024-10-12 15:15:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:39,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660151559] [2024-10-12 15:15:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660151559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:39,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:15:39,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:15:39,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149675756] [2024-10-12 15:15:39,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:39,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:15:39,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:15:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:39,130 INFO L87 Difference]: Start difference. First operand 396 states and 516 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:39,847 INFO L93 Difference]: Finished difference Result 886 states and 1234 transitions. [2024-10-12 15:15:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:15:39,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-10-12 15:15:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:39,850 INFO L225 Difference]: With dead ends: 886 [2024-10-12 15:15:39,850 INFO L226 Difference]: Without dead ends: 527 [2024-10-12 15:15:39,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:15:39,853 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:39,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 80 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:15:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-12 15:15:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 396. [2024-10-12 15:15:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.1974683544303797) internal successors, (473), 395 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 473 transitions. [2024-10-12 15:15:39,881 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 473 transitions. Word has length 131 [2024-10-12 15:15:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:39,881 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 473 transitions. [2024-10-12 15:15:39,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 473 transitions. [2024-10-12 15:15:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-12 15:15:39,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:39,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:39,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:15:39,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:39,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1117239178, now seen corresponding path program 1 times [2024-10-12 15:15:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:39,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765636646] [2024-10-12 15:15:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:15:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765636646] [2024-10-12 15:15:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765636646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473879480] [2024-10-12 15:15:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:40,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:40,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:40,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:15:40,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:15:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:40,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:40,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 15:15:40,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473879480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:15:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046853603] [2024-10-12 15:15:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:40,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:40,536 INFO L87 Difference]: Start difference. First operand 396 states and 473 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:40,922 INFO L93 Difference]: Finished difference Result 922 states and 1123 transitions. [2024-10-12 15:15:40,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 139 [2024-10-12 15:15:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:40,925 INFO L225 Difference]: With dead ends: 922 [2024-10-12 15:15:40,925 INFO L226 Difference]: Without dead ends: 527 [2024-10-12 15:15:40,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:40,927 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:40,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 170 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-12 15:15:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-12 15:15:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.193916349809886) internal successors, (628), 526 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 628 transitions. [2024-10-12 15:15:40,960 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 628 transitions. Word has length 139 [2024-10-12 15:15:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:40,961 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 628 transitions. [2024-10-12 15:15:40,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 628 transitions. [2024-10-12 15:15:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-12 15:15:40,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:40,967 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:40,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:15:41,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:41,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:41,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash -928690084, now seen corresponding path program 1 times [2024-10-12 15:15:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783136932] [2024-10-12 15:15:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 15:15:41,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783136932] [2024-10-12 15:15:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783136932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482821907] [2024-10-12 15:15:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:41,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:41,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:15:41,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:15:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:41,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:41,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 15:15:41,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:41,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482821907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:41,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:15:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849488491] [2024-10-12 15:15:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:41,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:41,832 INFO L87 Difference]: Start difference. First operand 527 states and 628 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:42,237 INFO L93 Difference]: Finished difference Result 1446 states and 1747 transitions. [2024-10-12 15:15:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-10-12 15:15:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:42,241 INFO L225 Difference]: With dead ends: 1446 [2024-10-12 15:15:42,241 INFO L226 Difference]: Without dead ends: 920 [2024-10-12 15:15:42,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:42,243 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:42,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 188 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-12 15:15:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-10-12 15:15:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.1871599564744286) internal successors, (1091), 919 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1091 transitions. [2024-10-12 15:15:42,262 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1091 transitions. Word has length 155 [2024-10-12 15:15:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:42,262 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1091 transitions. [2024-10-12 15:15:42,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1091 transitions. [2024-10-12 15:15:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 15:15:42,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:15:42,266 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:15:42,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:15:42,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:42,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:15:42,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:15:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1599914179, now seen corresponding path program 1 times [2024-10-12 15:15:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:15:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149632688] [2024-10-12 15:15:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:15:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-12 15:15:42,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:15:42,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149632688] [2024-10-12 15:15:42,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149632688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:15:42,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63809150] [2024-10-12 15:15:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:15:42,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:42,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:15:42,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:15:42,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:15:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:15:42,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:15:42,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:15:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-12 15:15:43,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:15:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63809150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:15:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:15:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:15:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674857340] [2024-10-12 15:15:43,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:15:43,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:15:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:15:43,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:15:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:43,003 INFO L87 Difference]: Start difference. First operand 920 states and 1091 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:15:43,385 INFO L93 Difference]: Finished difference Result 2623 states and 3091 transitions. [2024-10-12 15:15:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:15:43,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 169 [2024-10-12 15:15:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:15:43,388 INFO L225 Difference]: With dead ends: 2623 [2024-10-12 15:15:43,388 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:15:43,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:15:43,391 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:15:43,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 185 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:15:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:15:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:15:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:15:43,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2024-10-12 15:15:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:15:43,395 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:15:43,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:15:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:15:43,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:15:43,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:15:43,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 15:15:43,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:15:43,603 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-12 15:15:43,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:15:43,636 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:15:43,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:15:43 BoogieIcfgContainer [2024-10-12 15:15:43,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:15:43,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:15:43,655 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:15:43,656 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:15:43,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:15:36" (3/4) ... [2024-10-12 15:15:43,658 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:15:43,684 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:15:43,685 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:15:43,686 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:15:43,687 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:15:43,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:15:43,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:15:43,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:15:43,848 INFO L158 Benchmark]: Toolchain (without parser) took 9565.12ms. Allocated memory was 119.5MB in the beginning and 224.4MB in the end (delta: 104.9MB). Free memory was 63.6MB in the beginning and 82.1MB in the end (delta: -18.6MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2024-10-12 15:15:43,848 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 119.5MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:15:43,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.38ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 63.4MB in the beginning and 100.4MB in the end (delta: -37.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-12 15:15:43,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.84ms. Allocated memory is still 146.8MB. Free memory was 99.7MB in the beginning and 94.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:15:43,849 INFO L158 Benchmark]: Boogie Preprocessor took 99.12ms. Allocated memory is still 146.8MB. Free memory was 94.1MB in the beginning and 88.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 15:15:43,849 INFO L158 Benchmark]: RCFGBuilder took 1400.29ms. Allocated memory is still 146.8MB. Free memory was 88.5MB in the beginning and 101.7MB in the end (delta: -13.2MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-10-12 15:15:43,849 INFO L158 Benchmark]: TraceAbstraction took 7176.25ms. Allocated memory was 146.8MB in the beginning and 224.4MB in the end (delta: 77.6MB). Free memory was 100.6MB in the beginning and 94.7MB in the end (delta: 5.9MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-10-12 15:15:43,849 INFO L158 Benchmark]: Witness Printer took 192.01ms. Allocated memory is still 224.4MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:15:43,853 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.31ms. Allocated memory is still 119.5MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.38ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 63.4MB in the beginning and 100.4MB in the end (delta: -37.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.84ms. Allocated memory is still 146.8MB. Free memory was 99.7MB in the beginning and 94.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.12ms. Allocated memory is still 146.8MB. Free memory was 94.1MB in the beginning and 88.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1400.29ms. Allocated memory is still 146.8MB. Free memory was 88.5MB in the beginning and 101.7MB in the end (delta: -13.2MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7176.25ms. Allocated memory was 146.8MB in the beginning and 224.4MB in the end (delta: 77.6MB). Free memory was 100.6MB in the beginning and 94.7MB in the end (delta: 5.9MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * Witness Printer took 192.01ms. Allocated memory is still 224.4MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 561]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 433 mSDsluCounter, 858 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2091 IncrementalHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 823 mSDtfsCounter, 2091 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=920occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 131 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1305 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1296 ConstructedInterpolants, 0 QuantifiedInterpolants, 6177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 936 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 303/312 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: 593]: Loop Invariant Derived loop invariant: ((((a21 < 1) || (a7 != 1)) || (a17 < 1)) || (a16 < 5)) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:15:43,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE