./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-81.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 5dc86f6ccc49efa466c40ecfaf02fc621e42a3eb275044534af963c5345cf993 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:19:12,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:19:12,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:19:12,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:19:12,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:19:12,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:19:12,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:19:12,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:19:12,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:19:12,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:19:12,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:19:12,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:19:12,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:19:12,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:19:12,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:19:12,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:19:12,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:19:12,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:19:12,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:19:12,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:19:12,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:19:12,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:19:12,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:19:12,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:19:12,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:19:12,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:19:12,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:19:12,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:19:12,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:19:12,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:19:12,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:19:12,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:19:12,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:12,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:19:12,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:19:12,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:19:12,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:19:12,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:19:12,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:19:12,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:19:12,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:19:12,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:19:12,643 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 -> 5dc86f6ccc49efa466c40ecfaf02fc621e42a3eb275044534af963c5345cf993 [2024-11-10 08:19:12,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:19:12,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:19:12,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:19:12,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:19:12,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:19:12,943 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-81.i [2024-11-10 08:19:14,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:19:14,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:19:14,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-81.i [2024-11-10 08:19:14,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9734d9e/008f1aef1cd64acab94b05611e878556/FLAGe02fc4de8 [2024-11-10 08:19:14,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9734d9e/008f1aef1cd64acab94b05611e878556 [2024-11-10 08:19:14,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:19:14,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:19:14,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:14,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:19:14,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:19:14,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:14,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1724dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14, skipping insertion in model container [2024-11-10 08:19:14,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:14,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:19:14,829 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-81.i[915,928] [2024-11-10 08:19:14,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:14,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:19:14,895 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-81.i[915,928] [2024-11-10 08:19:14,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:14,932 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:19:14,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14 WrapperNode [2024-11-10 08:19:14,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:14,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:14,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:19:14,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:19:14,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:14,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:14,980 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2024-11-10 08:19:14,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:14,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:19:14,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:19:14,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:19:14,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:14,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:14,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,014 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-10 08:19:15,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:19:15,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:19:15,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:19:15,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:19:15,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (1/1) ... [2024-11-10 08:19:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:15,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:19:15,131 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-10 08:19:15,143 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-10 08:19:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:19:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:19:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:19:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:19:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:19:15,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:19:15,246 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:19:15,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:19:15,455 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:19:15,458 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:19:15,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:19:15,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:19:15,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:15 BoogieIcfgContainer [2024-11-10 08:19:15,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:19:15,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:19:15,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:19:15,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:19:15,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:19:14" (1/3) ... [2024-11-10 08:19:15,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5105cef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:15, skipping insertion in model container [2024-11-10 08:19:15,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:14" (2/3) ... [2024-11-10 08:19:15,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5105cef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:15, skipping insertion in model container [2024-11-10 08:19:15,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:15" (3/3) ... [2024-11-10 08:19:15,494 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-81.i [2024-11-10 08:19:15,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:19:15,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:19:15,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:19:15,599 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;@3bf397b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:19:15,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:19:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 08:19:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 08:19:15,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:15,618 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:15,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2123359190, now seen corresponding path program 1 times [2024-11-10 08:19:15,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918078165] [2024-11-10 08:19:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:19:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:19:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:19:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:19:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:19:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:19:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:19:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 08:19:15,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918078165] [2024-11-10 08:19:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918078165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:15,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:15,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:19:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169843440] [2024-11-10 08:19:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:15,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:19:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:19:15,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:15,988 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 08:19:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:16,010 INFO L93 Difference]: Finished difference Result 66 states and 97 transitions. [2024-11-10 08:19:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:19:16,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-11-10 08:19:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:16,020 INFO L225 Difference]: With dead ends: 66 [2024-11-10 08:19:16,020 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 08:19:16,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-10 08:19:16,028 INFO L432 NwaCegarLoop]: 40 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, 40 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-10 08:19:16,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 08:19:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-10 08:19:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 08:19:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-10 08:19:16,070 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 58 [2024-11-10 08:19:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-10 08:19:16,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 08:19:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-10 08:19:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 08:19:16,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:16,077 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:16,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:19:16,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:16,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1218291700, now seen corresponding path program 1 times [2024-11-10 08:19:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:16,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583870871] [2024-11-10 08:19:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:16,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:19:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:16,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:19:16,288 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:19:16,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:19:16,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:19:16,297 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:19:16,353 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:19:16,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:19:16 BoogieIcfgContainer [2024-11-10 08:19:16,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:19:16,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:19:16,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:19:16,357 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:19:16,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:15" (3/4) ... [2024-11-10 08:19:16,359 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:19:16,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:19:16,361 INFO L158 Benchmark]: Toolchain (without parser) took 1762.34ms. Allocated memory is still 174.1MB. Free memory was 103.7MB in the beginning and 92.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:16,362 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 174.1MB. Free memory was 130.1MB in the beginning and 129.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:16,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.28ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 90.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:19:16,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.78ms. Allocated memory is still 174.1MB. Free memory was 90.5MB in the beginning and 88.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:16,364 INFO L158 Benchmark]: Boogie Preprocessor took 72.15ms. Allocated memory is still 174.1MB. Free memory was 88.8MB in the beginning and 145.8MB in the end (delta: -57.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-10 08:19:16,364 INFO L158 Benchmark]: IcfgBuilder took 419.29ms. Allocated memory is still 174.1MB. Free memory was 145.8MB in the beginning and 132.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:19:16,365 INFO L158 Benchmark]: TraceAbstraction took 878.65ms. Allocated memory is still 174.1MB. Free memory was 131.9MB in the beginning and 92.7MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 08:19:16,365 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 174.1MB. Free memory was 92.7MB in the beginning and 92.0MB in the end (delta: 677.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:16,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 174.1MB. Free memory was 130.1MB in the beginning and 129.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.28ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 90.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.78ms. Allocated memory is still 174.1MB. Free memory was 90.5MB in the beginning and 88.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.15ms. Allocated memory is still 174.1MB. Free memory was 88.8MB in the beginning and 145.8MB in the end (delta: -57.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * IcfgBuilder took 419.29ms. Allocated memory is still 174.1MB. Free memory was 145.8MB in the beginning and 132.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 878.65ms. Allocated memory is still 174.1MB. Free memory was 131.9MB in the beginning and 92.7MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 174.1MB. Free memory was 92.7MB in the beginning and 92.0MB in the end (delta: 677.5kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 0; [L23] float var_1_2 = 16.875; [L24] float var_1_3 = 49.5; [L25] signed short int var_1_4 = 25; [L26] signed short int var_1_5 = 256; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 64; VAL [isInitial=0, var_1_1=0, var_1_2=135/8, var_1_3=99/2, var_1_4=25, var_1_5=256, var_1_6=10, var_1_7=64] [L61] isInitial = 1 [L62] FCALL initially() [L63] COND TRUE 1 [L64] FCALL updateLastVariables() [L65] CALL updateVariables() [L40] var_1_2 = __VERIFIER_nondet_float() [L41] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=99/2, var_1_4=25, var_1_5=256, var_1_6=10, var_1_7=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=99/2, var_1_4=25, var_1_5=256, var_1_6=10, var_1_7=64] [L41] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=99/2, var_1_4=25, var_1_5=256, var_1_6=10, var_1_7=64] [L42] var_1_3 = __VERIFIER_nondet_float() [L43] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=25, var_1_5=256, var_1_6=10, var_1_7=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=25, var_1_5=256, var_1_6=10, var_1_7=64] [L43] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_4=25, var_1_5=256, var_1_6=10, var_1_7=64] [L44] var_1_4 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=256, var_1_6=10, var_1_7=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=256, var_1_6=10, var_1_7=64] [L45] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=256, var_1_6=10, var_1_7=64] [L46] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=256, var_1_6=10, var_1_7=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=256, var_1_6=10, var_1_7=64] [L46] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=256, var_1_6=10, var_1_7=64] [L47] var_1_5 = __VERIFIER_nondet_short() [L48] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=64] [L48] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=64] [L49] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=64] [L49] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=64] [L50] var_1_7 = __VERIFIER_nondet_char() [L51] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=-127] [L51] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=-127] [L52] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=-127] [L52] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=-127] [L65] RET updateVariables() [L66] CALL step() [L32] COND FALSE !((- var_1_2) <= var_1_3) [L35] var_1_1 = ((100 + 4) - ((((16) < (var_1_5)) ? (16) : (var_1_5)))) VAL [isInitial=1, var_1_1=88, var_1_4=32766, var_1_5=32762, var_1_6=10, var_1_7=-127] [L37] var_1_6 = var_1_7 VAL [isInitial=1, var_1_1=88, var_1_4=32766, var_1_5=32762, var_1_6=-127, var_1_7=-127] [L66] RET step() [L67] CALL, EXPR property() [L57-L58] return (((- var_1_2) <= var_1_3) ? (var_1_1 == ((signed short int) (var_1_4 - var_1_5))) : (var_1_1 == ((signed short int) ((100 + 4) - ((((16) < (var_1_5)) ? (16) : (var_1_5))))))) && (var_1_6 == ((signed char) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_1=88, var_1_4=32766, var_1_5=32762, var_1_6=-127, var_1_7=-127] [L67] RET, EXPR property() [L67] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=88, var_1_4=32766, var_1_5=32762, var_1_6=-127, var_1_7=-127] [L19] reach_error() VAL [isInitial=1, var_1_1=88, var_1_4=32766, var_1_5=32762, var_1_6=-127, var_1_7=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 40 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 08:19:16,403 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 5dc86f6ccc49efa466c40ecfaf02fc621e42a3eb275044534af963c5345cf993 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:19:18,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:19:18,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:19:18,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:19:18,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:19:18,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:19:18,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:19:18,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:19:18,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:19:18,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:19:18,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:19:18,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:19:18,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:19:18,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:19:18,896 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:19:18,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:19:18,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:19:18,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:19:18,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:19:18,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:19:18,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:19:18,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:19:18,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:19:18,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:19:18,899 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:19:18,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:19:18,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:19:18,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:19:18,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:19:18,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:19:18,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:19:18,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:19:18,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:19:18,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:19:18,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:18,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:19:18,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:19:18,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:19:18,904 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:19:18,904 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:19:18,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:19:18,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:19:18,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:19:18,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:19:18,908 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 -> 5dc86f6ccc49efa466c40ecfaf02fc621e42a3eb275044534af963c5345cf993 [2024-11-10 08:19:19,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:19:19,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:19:19,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:19:19,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:19:19,290 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:19:19,291 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-81.i [2024-11-10 08:19:20,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:19:21,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:19:21,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-81.i [2024-11-10 08:19:21,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532e0ea30/5d3e230c01e34008a19bcbe1ce661817/FLAG2b8756e68 [2024-11-10 08:19:21,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/532e0ea30/5d3e230c01e34008a19bcbe1ce661817 [2024-11-10 08:19:21,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:19:21,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:19:21,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:21,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:19:21,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:19:21,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0bad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21, skipping insertion in model container [2024-11-10 08:19:21,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:19:21,691 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-81.i[915,928] [2024-11-10 08:19:21,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:21,749 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:19:21,760 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-81.i[915,928] [2024-11-10 08:19:21,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:21,800 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:19:21,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21 WrapperNode [2024-11-10 08:19:21,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:21,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:21,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:19:21,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:19:21,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,843 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 67 [2024-11-10 08:19:21,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:21,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:19:21,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:19:21,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:19:21,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,883 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-10 08:19:21,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:19:21,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:19:21,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:19:21,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:19:21,913 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (1/1) ... [2024-11-10 08:19:21,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:21,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:19:21,949 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-10 08:19:21,953 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-10 08:19:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:19:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:19:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:19:22,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:19:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:19:22,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:19:22,083 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:19:22,086 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:19:22,315 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:19:22,315 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:19:22,330 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:19:22,332 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:19:22,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:22 BoogieIcfgContainer [2024-11-10 08:19:22,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:19:22,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:19:22,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:19:22,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:19:22,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:19:21" (1/3) ... [2024-11-10 08:19:22,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c44734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:22, skipping insertion in model container [2024-11-10 08:19:22,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:21" (2/3) ... [2024-11-10 08:19:22,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c44734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:22, skipping insertion in model container [2024-11-10 08:19:22,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:22" (3/3) ... [2024-11-10 08:19:22,342 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-81.i [2024-11-10 08:19:22,361 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:19:22,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:19:22,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:19:22,439 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;@490717df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:19:22,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:19:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 08:19:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 08:19:22,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:22,456 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:22,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:22,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2123359190, now seen corresponding path program 1 times [2024-11-10 08:19:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658947090] [2024-11-10 08:19:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:22,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:22,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:22,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:22,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 08:19:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:22,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:19:22,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-10 08:19:22,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:19:22,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:22,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658947090] [2024-11-10 08:19:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658947090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:19:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078847178] [2024-11-10 08:19:22,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:22,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:19:22,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:22,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:19:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:22,697 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 08:19:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:22,718 INFO L93 Difference]: Finished difference Result 66 states and 97 transitions. [2024-11-10 08:19:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:19:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-11-10 08:19:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:22,735 INFO L225 Difference]: With dead ends: 66 [2024-11-10 08:19:22,735 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 08:19:22,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 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-10 08:19:22,744 INFO L432 NwaCegarLoop]: 40 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, 40 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-10 08:19:22,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 08:19:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-10 08:19:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 08:19:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-10 08:19:22,779 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 58 [2024-11-10 08:19:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:22,779 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-10 08:19:22,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 08:19:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-10 08:19:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 08:19:22,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:22,783 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:22,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 08:19:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:22,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:22,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:22,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1218291700, now seen corresponding path program 1 times [2024-11-10 08:19:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892402874] [2024-11-10 08:19:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:22,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:22,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:22,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 08:19:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:23,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:19:23,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 08:19:23,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:19:23,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:23,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892402874] [2024-11-10 08:19:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892402874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:19:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597260726] [2024-11-10 08:19:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:19:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:19:23,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:19:23,739 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 08:19:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:23,908 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-10 08:19:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:19:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-10 08:19:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:23,914 INFO L225 Difference]: With dead ends: 43 [2024-11-10 08:19:23,914 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 08:19:23,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:19:23,916 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:23,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:19:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 08:19:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-10 08:19:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 08:19:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-10 08:19:23,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 58 [2024-11-10 08:19:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:23,930 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-10 08:19:23,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 08:19:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-10 08:19:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 08:19:23,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:23,934 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:19:23,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 08:19:24,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:24,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:24,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash 330788019, now seen corresponding path program 1 times [2024-11-10 08:19:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:24,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228195909] [2024-11-10 08:19:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:24,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:24,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:24,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:24,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 08:19:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:24,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:19:24,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 08:19:24,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:19:24,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228195909] [2024-11-10 08:19:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228195909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:24,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:24,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:19:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717026721] [2024-11-10 08:19:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:24,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:19:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:19:24,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:19:24,458 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 08:19:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:24,626 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-10 08:19:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:19:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-10 08:19:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:24,628 INFO L225 Difference]: With dead ends: 40 [2024-11-10 08:19:24,628 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:19:24,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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-10 08:19:24,629 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:24,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:19:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:19:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:19:24,631 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-10 08:19:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:19:24,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2024-11-10 08:19:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:19:24,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-10 08:19:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:19:24,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:19:24,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:19:24,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 08:19:24,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:24,839 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:19:24,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:19:24,860 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:19:24,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:19:24 BoogieIcfgContainer [2024-11-10 08:19:24,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:19:24,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:19:24,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:19:24,885 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:19:24,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:22" (3/4) ... [2024-11-10 08:19:24,891 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:19:24,895 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:19:24,898 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:19:24,898 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:19:24,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:19:24,899 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:19:24,993 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:19:24,993 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:19:24,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:19:24,994 INFO L158 Benchmark]: Toolchain (without parser) took 3530.60ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 32.6MB in the beginning and 40.6MB in the end (delta: -8.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-10 08:19:24,994 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 52.4MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:24,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.84ms. Allocated memory is still 65.0MB. Free memory was 32.4MB in the beginning and 34.6MB in the end (delta: -2.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-10 08:19:24,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.57ms. Allocated memory is still 65.0MB. Free memory was 34.6MB in the beginning and 32.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:24,995 INFO L158 Benchmark]: Boogie Preprocessor took 65.00ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 30.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:24,995 INFO L158 Benchmark]: IcfgBuilder took 421.16ms. Allocated memory is still 65.0MB. Free memory was 30.8MB in the beginning and 41.4MB in the end (delta: -10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:19:24,995 INFO L158 Benchmark]: TraceAbstraction took 2549.68ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 40.7MB in the beginning and 45.5MB in the end (delta: -4.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-10 08:19:24,996 INFO L158 Benchmark]: Witness Printer took 108.62ms. Allocated memory is still 79.7MB. Free memory was 45.5MB in the beginning and 40.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:19:24,998 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.27ms. Allocated memory is still 52.4MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.84ms. Allocated memory is still 65.0MB. Free memory was 32.4MB in the beginning and 34.6MB in the end (delta: -2.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.57ms. Allocated memory is still 65.0MB. Free memory was 34.6MB in the beginning and 32.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.00ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 30.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 421.16ms. Allocated memory is still 65.0MB. Free memory was 30.8MB in the beginning and 41.4MB in the end (delta: -10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2549.68ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 40.7MB in the beginning and 45.5MB in the end (delta: -4.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Witness Printer took 108.62ms. Allocated memory is still 79.7MB. Free memory was 45.5MB in the beginning and 40.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. 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.4s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 122 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 14 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 336/336 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: 63]: Location Invariant Derived location invariant: null - 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))) && (var_1_7 == \old(var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:19:25,032 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