./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/hardness-nfm22/hardness_operatoramount_amount10_file-78.i -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 9eace40a5bfc748d79d918840a33885e3923058b3c61ac895b0c4200f609a10f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:14:26,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:14:26,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:14:26,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:14:26,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:14:26,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:14:26,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:14:26,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:14:26,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:14:26,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:14:26,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:14:26,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:14:26,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:14:26,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:14:26,730 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:14:26,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:14:26,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:14:26,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:14:26,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:14:26,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:14:26,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:14:26,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:14:26,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:14:26,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:14:26,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:14:26,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:14:26,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:14:26,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:14:26,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:14:26,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:14:26,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:14:26,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:14:26,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:26,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:14:26,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:14:26,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:14:26,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:14:26,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:14:26,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:14:26,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:14:26,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:14:26,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:14:26,743 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 -> 9eace40a5bfc748d79d918840a33885e3923058b3c61ac895b0c4200f609a10f [2024-11-12 06:14:26,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:14:27,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:14:27,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:14:27,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:14:27,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:14:27,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i [2024-11-12 06:14:28,482 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:14:28,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:14:28,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i [2024-11-12 06:14:28,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b63208659/9f3b9da022f14d8281475abed0c3a762/FLAG17c84bf11 [2024-11-12 06:14:29,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b63208659/9f3b9da022f14d8281475abed0c3a762 [2024-11-12 06:14:29,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:14:29,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:14:29,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:29,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:14:29,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:14:29,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ba7129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29, skipping insertion in model container [2024-11-12 06:14:29,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:14:29,264 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/hardness-nfm22/hardness_operatoramount_amount10_file-78.i[915,928] [2024-11-12 06:14:29,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:29,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:14:29,306 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/hardness-nfm22/hardness_operatoramount_amount10_file-78.i[915,928] [2024-11-12 06:14:29,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:29,344 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:14:29,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29 WrapperNode [2024-11-12 06:14:29,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:29,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:29,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:14:29,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:14:29,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,395 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-11-12 06:14:29,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:29,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:14:29,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:14:29,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:14:29,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,424 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-12 06:14:29,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:14:29,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:14:29,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:14:29,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:14:29,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (1/1) ... [2024-11-12 06:14:29,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:29,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:14:29,519 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-12 06:14:29,522 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-12 06:14:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:14:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:14:29,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:14:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:14:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:14:29,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:14:29,618 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:14:29,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:14:29,811 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:14:29,813 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:14:29,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:14:29,827 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:14:29,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:29 BoogieIcfgContainer [2024-11-12 06:14:29,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:14:29,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:14:29,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:14:29,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:14:29,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:14:29" (1/3) ... [2024-11-12 06:14:29,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec37d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:29, skipping insertion in model container [2024-11-12 06:14:29,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:29" (2/3) ... [2024-11-12 06:14:29,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec37d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:29, skipping insertion in model container [2024-11-12 06:14:29,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:29" (3/3) ... [2024-11-12 06:14:29,836 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-78.i [2024-11-12 06:14:29,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:14:29,851 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:14:29,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:14:29,916 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;@39002b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:14:29,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:14:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:14:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 06:14:29,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:29,931 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:14:29,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:29,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1834674241, now seen corresponding path program 1 times [2024-11-12 06:14:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156160588] [2024-11-12 06:14:29,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:14:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:14:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:14:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:14:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:14:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:14:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:14:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:14:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:14:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:14:30,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:30,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156160588] [2024-11-12 06:14:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156160588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:30,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:14:30,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944500498] [2024-11-12 06:14:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:30,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:14:30,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:14:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:14:30,230 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 06:14:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:30,252 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2024-11-12 06:14:30,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:14:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2024-11-12 06:14:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:30,259 INFO L225 Difference]: With dead ends: 67 [2024-11-12 06:14:30,260 INFO L226 Difference]: Without dead ends: 33 [2024-11-12 06:14:30,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-11-12 06:14:30,266 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:30,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:14:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-12 06:14:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-12 06:14:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:14:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-11-12 06:14:30,304 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 65 [2024-11-12 06:14:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:30,305 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-12 06:14:30,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 06:14:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-11-12 06:14:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 06:14:30,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:30,307 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:14:30,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:14:30,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1906436481, now seen corresponding path program 1 times [2024-11-12 06:14:30,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:30,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303850399] [2024-11-12 06:14:30,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:14:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:14:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:14:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:14:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:14:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:14:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:14:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:14:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:14:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:14:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:31,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303850399] [2024-11-12 06:14:31,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303850399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:31,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:31,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:14:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157666713] [2024-11-12 06:14:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:31,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:14:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:14:31,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:14:31,061 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:14:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:31,160 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2024-11-12 06:14:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:14:31,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-11-12 06:14:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:31,161 INFO L225 Difference]: With dead ends: 41 [2024-11-12 06:14:31,161 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 06:14:31,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:14:31,162 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:31,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:14:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 06:14:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-12 06:14:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:14:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-12 06:14:31,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 65 [2024-11-12 06:14:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:31,174 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-12 06:14:31,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:14:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-12 06:14:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:14:31,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:31,176 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:14:31,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:14:31,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:31,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1413334919, now seen corresponding path program 1 times [2024-11-12 06:14:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140010798] [2024-11-12 06:14:31,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:14:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:14:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:14:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:14:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:14:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:14:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:14:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:14:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:14:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:14:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140010798] [2024-11-12 06:14:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140010798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:31,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159031434] [2024-11-12 06:14:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:31,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:31,575 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:14:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:31,664 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-11-12 06:14:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-12 06:14:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:31,665 INFO L225 Difference]: With dead ends: 47 [2024-11-12 06:14:31,665 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 06:14:31,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:14:31,667 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:31,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 167 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:14:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 06:14:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2024-11-12 06:14:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:14:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-12 06:14:31,679 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 66 [2024-11-12 06:14:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:31,680 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-12 06:14:31,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:14:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-12 06:14:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 06:14:31,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:31,681 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:14:31,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:14:31,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:31,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -811131303, now seen corresponding path program 1 times [2024-11-12 06:14:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:31,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472959310] [2024-11-12 06:14:31,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:14:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:14:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:14:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:14:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:14:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:14:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:14:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:14:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:14:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:14:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:31,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472959310] [2024-11-12 06:14:31,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472959310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:31,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:31,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:14:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092516932] [2024-11-12 06:14:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:31,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:14:31,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:31,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:14:31,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:14:31,903 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:14:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:32,037 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-11-12 06:14:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:14:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-12 06:14:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:32,041 INFO L225 Difference]: With dead ends: 46 [2024-11-12 06:14:32,041 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:14:32,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:14:32,042 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:32,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 221 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:14:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:14:32,043 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-12 06:14:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:14:32,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-12 06:14:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:32,044 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:14:32,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:14:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:14:32,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:14:32,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:14:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:14:32,057 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 06:14:32,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:14:32,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:14:32,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:14:32 BoogieIcfgContainer [2024-11-12 06:14:32,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:14:32,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:14:32,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:14:32,142 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:14:32,142 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:29" (3/4) ... [2024-11-12 06:14:32,145 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:14:32,148 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:14:32,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-12 06:14:32,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 06:14:32,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:14:32,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:14:32,227 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:14:32,228 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:14:32,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:14:32,228 INFO L158 Benchmark]: Toolchain (without parser) took 3142.81ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 84.2MB in the beginning and 162.7MB in the end (delta: -78.5MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:32,229 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory was 106.4MB in the beginning and 106.3MB in the end (delta: 110.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:32,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.53ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 125.4MB in the end (delta: -41.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:32,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.96ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 125.4MB in the beginning and 167.7MB in the end (delta: -42.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-12 06:14:32,229 INFO L158 Benchmark]: Boogie Preprocessor took 56.02ms. Allocated memory is still 197.1MB. Free memory was 167.7MB in the beginning and 165.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:32,229 INFO L158 Benchmark]: RCFGBuilder took 374.99ms. Allocated memory is still 197.1MB. Free memory was 165.6MB in the beginning and 152.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:32,230 INFO L158 Benchmark]: TraceAbstraction took 2305.03ms. Allocated memory is still 197.1MB. Free memory was 151.0MB in the beginning and 55.9MB in the end (delta: 95.0MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2024-11-12 06:14:32,230 INFO L158 Benchmark]: Witness Printer took 93.06ms. Allocated memory is still 197.1MB. Free memory was 55.9MB in the beginning and 162.7MB in the end (delta: -106.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:32,231 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.18ms. Allocated memory is still 155.2MB. Free memory was 106.4MB in the beginning and 106.3MB in the end (delta: 110.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.53ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 125.4MB in the end (delta: -41.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.96ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 125.4MB in the beginning and 167.7MB in the end (delta: -42.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.02ms. Allocated memory is still 197.1MB. Free memory was 167.7MB in the beginning and 165.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.99ms. Allocated memory is still 197.1MB. Free memory was 165.6MB in the beginning and 152.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2305.03ms. Allocated memory is still 197.1MB. Free memory was 151.0MB in the beginning and 55.9MB in the end (delta: 95.0MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. * Witness Printer took 93.06ms. Allocated memory is still 197.1MB. Free memory was 55.9MB in the beginning and 162.7MB in the end (delta: -106.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 179 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 720/720 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: 70]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:14:32,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE