./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_label51.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 d1cc78894862a8232926a266f0e84c32d40ba4c1c811df274fffc61517c63c36 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:48:18,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:48:18,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:48:18,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:48:18,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:48:18,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:48:18,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:48:18,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:48:18,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:48:18,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:48:18,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:48:18,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:48:18,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:48:18,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:48:18,624 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:48:18,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:48:18,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:48:18,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:48:18,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:48:18,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:48:18,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:48:18,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:48:18,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:48:18,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:48:18,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:48:18,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:48:18,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:48:18,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:48:18,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:48:18,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:48:18,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:48:18,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:48:18,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:48:18,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:48:18,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:48:18,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:48:18,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:48:18,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:48:18,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:48:18,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:48:18,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:48:18,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:48:18,634 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 -> d1cc78894862a8232926a266f0e84c32d40ba4c1c811df274fffc61517c63c36 [2024-11-16 03:48:18,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:48:18,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:48:18,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:48:18,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:48:18,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:48:18,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label51.c [2024-11-16 03:48:20,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:48:20,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:48:20,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label51.c [2024-11-16 03:48:20,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b314caa/2303d024c1c6470a85e367764ad097d5/FLAG48b842769 [2024-11-16 03:48:20,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b314caa/2303d024c1c6470a85e367764ad097d5 [2024-11-16 03:48:20,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:48:20,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:48:20,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:48:20,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:48:20,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:48:20,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0082e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:20, skipping insertion in model container [2024-11-16 03:48:20,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:20" (1/1) ... [2024-11-16 03:48:20,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:48:21,178 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_label51.c[5763,5776] [2024-11-16 03:48:21,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:48:21,415 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:48:21,457 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_label51.c[5763,5776] [2024-11-16 03:48:21,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:48:21,614 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:48:21,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21 WrapperNode [2024-11-16 03:48:21,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:48:21,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:48:21,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:48:21,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:48:21,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,713 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-16 03:48:21,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:48:21,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:48:21,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:48:21,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:48:21,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,776 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-16 03:48:21,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:48:21,824 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:48:21,824 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:48:21,824 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:48:21,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (1/1) ... [2024-11-16 03:48:21,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:48:21,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:21,881 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-16 03:48:21,883 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-16 03:48:21,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:48:21,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:48:21,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:48:21,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:48:21,977 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:48:21,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:48:22,760 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-16 03:48:22,760 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:48:22,779 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:48:22,780 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:48:22,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:22 BoogieIcfgContainer [2024-11-16 03:48:22,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:48:22,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:48:22,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:48:22,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:48:22,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:48:20" (1/3) ... [2024-11-16 03:48:22,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e4fd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:22, skipping insertion in model container [2024-11-16 03:48:22,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:21" (2/3) ... [2024-11-16 03:48:22,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e4fd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:22, skipping insertion in model container [2024-11-16 03:48:22,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:22" (3/3) ... [2024-11-16 03:48:22,790 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label51.c [2024-11-16 03:48:22,803 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:48:22,804 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:48:22,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:48:22,885 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;@1bfbef10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:48:22,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:48:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 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-16 03:48:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 03:48:22,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:22,898 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-16 03:48:22,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1206437322, now seen corresponding path program 1 times [2024-11-16 03:48:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159650541] [2024-11-16 03:48:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:23,286 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-16 03:48:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159650541] [2024-11-16 03:48:23,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159650541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:23,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:23,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015120437] [2024-11-16 03:48:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:23,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:48:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:48:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:48:23,340 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 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 4 states, 4 states have (on average 13.0) internal successors, (52), 3 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-16 03:48:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:24,388 INFO L93 Difference]: Finished difference Result 703 states and 1255 transitions. [2024-11-16 03:48:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:48:24,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 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-16 03:48:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:24,402 INFO L225 Difference]: With dead ends: 703 [2024-11-16 03:48:24,402 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:48:24,405 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-16 03:48:24,407 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 475 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:24,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 50 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 03:48:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:48:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-16 03:48:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.3797169811320755) internal successors, (585), 424 states have internal predecessors, (585), 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-16 03:48:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 585 transitions. [2024-11-16 03:48:24,450 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 585 transitions. Word has length 52 [2024-11-16 03:48:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:24,450 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 585 transitions. [2024-11-16 03:48:24,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 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-16 03:48:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 585 transitions. [2024-11-16 03:48:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 03:48:24,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:24,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:48:24,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:48:24,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:24,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash 113542841, now seen corresponding path program 1 times [2024-11-16 03:48:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206812066] [2024-11-16 03:48:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206812066] [2024-11-16 03:48:24,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206812066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:48:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559803486] [2024-11-16 03:48:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:24,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:24,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:24,693 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-16 03:48:24,695 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-16 03:48:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:24,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:48:24,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:48:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:24,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:48:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559803486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:24,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:48:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-16 03:48:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145287612] [2024-11-16 03:48:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:24,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:24,889 INFO L87 Difference]: Start difference. First operand 425 states and 585 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 03:48:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:25,360 INFO L93 Difference]: Finished difference Result 988 states and 1449 transitions. [2024-11-16 03:48:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 128 [2024-11-16 03:48:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:25,364 INFO L225 Difference]: With dead ends: 988 [2024-11-16 03:48:25,364 INFO L226 Difference]: Without dead ends: 705 [2024-11-16 03:48:25,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:25,365 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 97 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:25,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 81 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-16 03:48:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 565. [2024-11-16 03:48:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.3652482269503545) internal successors, (770), 564 states have internal predecessors, (770), 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-16 03:48:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 770 transitions. [2024-11-16 03:48:25,383 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 770 transitions. Word has length 128 [2024-11-16 03:48:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:25,383 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 770 transitions. [2024-11-16 03:48:25,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-16 03:48:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 770 transitions. [2024-11-16 03:48:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-16 03:48:25,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:25,387 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, 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] [2024-11-16 03:48:25,404 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-16 03:48:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:25,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:25,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1448787206, now seen corresponding path program 1 times [2024-11-16 03:48:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:25,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424169032] [2024-11-16 03:48:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 03:48:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424169032] [2024-11-16 03:48:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424169032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:25,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:48:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603560618] [2024-11-16 03:48:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:25,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:25,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:25,916 INFO L87 Difference]: Start difference. First operand 565 states and 770 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) 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-11-16 03:48:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:26,465 INFO L93 Difference]: Finished difference Result 1128 states and 1573 transitions. [2024-11-16 03:48:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:26,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) 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 189 [2024-11-16 03:48:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:26,468 INFO L225 Difference]: With dead ends: 1128 [2024-11-16 03:48:26,468 INFO L226 Difference]: Without dead ends: 705 [2024-11-16 03:48:26,469 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-16 03:48:26,470 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 108 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:26,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 37 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:48:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-16 03:48:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-16 03:48:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.2428977272727273) internal successors, (875), 704 states have internal predecessors, (875), 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-16 03:48:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 875 transitions. [2024-11-16 03:48:26,488 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 875 transitions. Word has length 189 [2024-11-16 03:48:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:26,489 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 875 transitions. [2024-11-16 03:48:26,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) 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-11-16 03:48:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 875 transitions. [2024-11-16 03:48:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-16 03:48:26,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:26,493 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, 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] [2024-11-16 03:48:26,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:48:26,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:26,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1231320572, now seen corresponding path program 1 times [2024-11-16 03:48:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210850996] [2024-11-16 03:48:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210850996] [2024-11-16 03:48:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210850996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297026939] [2024-11-16 03:48:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:26,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:26,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:26,769 INFO L87 Difference]: Start difference. First operand 705 states and 875 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-16 03:48:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:27,363 INFO L93 Difference]: Finished difference Result 1548 states and 1984 transitions. [2024-11-16 03:48:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 206 [2024-11-16 03:48:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:27,368 INFO L225 Difference]: With dead ends: 1548 [2024-11-16 03:48:27,368 INFO L226 Difference]: Without dead ends: 985 [2024-11-16 03:48:27,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 03:48:27,372 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:27,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 22 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:48:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-16 03:48:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2024-11-16 03:48:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 1.2560975609756098) internal successors, (1236), 984 states have internal predecessors, (1236), 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-16 03:48:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1236 transitions. [2024-11-16 03:48:27,394 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1236 transitions. Word has length 206 [2024-11-16 03:48:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:27,395 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1236 transitions. [2024-11-16 03:48:27,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-16 03:48:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1236 transitions. [2024-11-16 03:48:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-16 03:48:27,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:27,400 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, 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] [2024-11-16 03:48:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:48:27,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:27,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1700898737, now seen corresponding path program 1 times [2024-11-16 03:48:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141925843] [2024-11-16 03:48:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141925843] [2024-11-16 03:48:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141925843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:48:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029550072] [2024-11-16 03:48:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:27,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:48:27,600 INFO L87 Difference]: Start difference. First operand 985 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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-16 03:48:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:27,980 INFO L93 Difference]: Finished difference Result 1968 states and 2505 transitions. [2024-11-16 03:48:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:27,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 252 [2024-11-16 03:48:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:27,984 INFO L225 Difference]: With dead ends: 1968 [2024-11-16 03:48:27,984 INFO L226 Difference]: Without dead ends: 1125 [2024-11-16 03:48:27,985 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-16 03:48:27,986 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:27,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 220 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:48:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-16 03:48:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 985. [2024-11-16 03:48:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 1.2245934959349594) internal successors, (1205), 984 states have internal predecessors, (1205), 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-16 03:48:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1205 transitions. [2024-11-16 03:48:28,022 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1205 transitions. Word has length 252 [2024-11-16 03:48:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:28,022 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1205 transitions. [2024-11-16 03:48:28,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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-16 03:48:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1205 transitions. [2024-11-16 03:48:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-16 03:48:28,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:28,025 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, 2, 2, 2, 2, 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] [2024-11-16 03:48:28,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:48:28,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:28,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1823364705, now seen corresponding path program 1 times [2024-11-16 03:48:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:28,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540714402] [2024-11-16 03:48:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:28,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:48:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:28,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540714402] [2024-11-16 03:48:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540714402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:28,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:48:28,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:48:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069493903] [2024-11-16 03:48:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:28,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:48:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:48:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:48:28,395 INFO L87 Difference]: Start difference. First operand 985 states and 1205 transitions. Second operand has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 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-16 03:48:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:28,754 INFO L93 Difference]: Finished difference Result 1884 states and 2319 transitions. [2024-11-16 03:48:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:48:28,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 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 266 [2024-11-16 03:48:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:28,757 INFO L225 Difference]: With dead ends: 1884 [2024-11-16 03:48:28,757 INFO L226 Difference]: Without dead ends: 985 [2024-11-16 03:48:28,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:48:28,759 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 143 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:28,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 27 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:48:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-16 03:48:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2024-11-16 03:48:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 1.2184959349593496) internal successors, (1199), 984 states have internal predecessors, (1199), 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-16 03:48:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1199 transitions. [2024-11-16 03:48:28,770 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1199 transitions. Word has length 266 [2024-11-16 03:48:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:28,770 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1199 transitions. [2024-11-16 03:48:28,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 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-16 03:48:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1199 transitions. [2024-11-16 03:48:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-16 03:48:28,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:48:28,773 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:48:28,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:48:28,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:48:28,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:48:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1989231495, now seen corresponding path program 1 times [2024-11-16 03:48:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:48:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832611493] [2024-11-16 03:48:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:48:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 33 proven. 64 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 03:48:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:48:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832611493] [2024-11-16 03:48:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832611493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:48:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103100519] [2024-11-16 03:48:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:48:29,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:48:29,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:48:29,046 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-16 03:48:29,050 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-16 03:48:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:48:29,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:48:29,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:48:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 03:48:29,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:48:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103100519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:48:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:48:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-16 03:48:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011000842] [2024-11-16 03:48:29,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:48:29,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:48:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:48:29,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:48:29,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:29,207 INFO L87 Difference]: Start difference. First operand 985 states and 1199 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-16 03:48:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:48:29,540 INFO L93 Difference]: Finished difference Result 1825 states and 2250 transitions. [2024-11-16 03:48:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:48:29,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 302 [2024-11-16 03:48:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:48:29,541 INFO L225 Difference]: With dead ends: 1825 [2024-11-16 03:48:29,542 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:48:29,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:48:29,544 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 96 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 215 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.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:48:29,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 215 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:48:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:48:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:48:29,545 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-16 03:48:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:48:29,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 302 [2024-11-16 03:48:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:48:29,547 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:48:29,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-16 03:48:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:48:29,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:48:29,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:48:29,563 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-16 03:48:29,753 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,SelfDestructingSolverStorable6 [2024-11-16 03:48:29,761 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:48:29,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:48:29,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:48:29,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:48:29 BoogieIcfgContainer [2024-11-16 03:48:29,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:48:29,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:48:29,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:48:29,878 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:48:29,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:22" (3/4) ... [2024-11-16 03:48:29,880 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:48:29,903 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:48:29,908 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:48:29,908 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:48:29,909 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:48:30,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:48:30,098 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:48:30,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:48:30,102 INFO L158 Benchmark]: Toolchain (without parser) took 9426.32ms. Allocated memory was 159.4MB in the beginning and 354.4MB in the end (delta: 195.0MB). Free memory was 85.0MB in the beginning and 197.3MB in the end (delta: -112.4MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2024-11-16 03:48:30,102 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:48:30,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 937.19ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 125.1MB in the end (delta: -40.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-11-16 03:48:30,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.30ms. Allocated memory was 159.4MB in the beginning and 278.9MB in the end (delta: 119.5MB). Free memory was 125.0MB in the beginning and 242.2MB in the end (delta: -117.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-16 03:48:30,102 INFO L158 Benchmark]: Boogie Preprocessor took 106.67ms. Allocated memory is still 278.9MB. Free memory was 242.2MB in the beginning and 232.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 03:48:30,102 INFO L158 Benchmark]: IcfgBuilder took 957.48ms. Allocated memory is still 278.9MB. Free memory was 232.8MB in the beginning and 138.4MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-16 03:48:30,103 INFO L158 Benchmark]: TraceAbstraction took 7094.17ms. Allocated memory was 278.9MB in the beginning and 354.4MB in the end (delta: 75.5MB). Free memory was 138.4MB in the beginning and 208.9MB in the end (delta: -70.4MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-11-16 03:48:30,103 INFO L158 Benchmark]: Witness Printer took 223.41ms. Allocated memory is still 354.4MB. Free memory was 208.9MB in the beginning and 197.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:48:30,104 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.14ms. Allocated memory is still 159.4MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 937.19ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 125.1MB in the end (delta: -40.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.30ms. Allocated memory was 159.4MB in the beginning and 278.9MB in the end (delta: 119.5MB). Free memory was 125.0MB in the beginning and 242.2MB in the end (delta: -117.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.67ms. Allocated memory is still 278.9MB. Free memory was 242.2MB in the beginning and 232.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 957.48ms. Allocated memory is still 278.9MB. Free memory was 232.8MB in the beginning and 138.4MB in the end (delta: 94.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7094.17ms. Allocated memory was 278.9MB in the beginning and 354.4MB in the end (delta: 75.5MB). Free memory was 138.4MB in the beginning and 208.9MB in the end (delta: -70.4MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 223.41ms. Allocated memory is still 354.4MB. Free memory was 208.9MB in the beginning and 197.3MB 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: 164]: 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, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1011 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1011 mSDsluCounter, 652 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2980 IncrementalHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 593 mSDtfsCounter, 2980 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=985occurred in iteration=4, InterpolantAutomatonStates: 26, 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, 7 MinimizatonAttempts, 280 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1825 NumberOfCodeBlocks, 1825 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1816 ConstructedInterpolants, 0 QuantifiedInterpolants, 7494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 614 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 1094/1173 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]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:48:30,143 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