./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.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-32.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 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:16:54,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:16:54,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:16:54,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:16:54,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:16:54,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:16:54,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:16:54,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:16:54,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:16:54,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:16:54,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:16:54,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:16:54,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:16:54,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:16:54,936 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:16:54,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:16:54,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:16:54,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:16:54,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:16:54,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:16:54,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:16:54,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:16:54,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:16:54,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:16:54,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:16:54,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:16:54,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:16:54,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:16:54,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:16:54,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:16:54,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:16:54,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:16:54,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:54,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:16:54,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:16:54,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:16:54,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:16:54,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:16:54,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:16:54,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:16:54,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:16:54,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:16:54,946 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 -> 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e [2024-11-10 08:16:55,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:16:55,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:16:55,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:16:55,221 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:16:55,222 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:16:55,223 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-32.i [2024-11-10 08:16:56,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:16:56,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:16:56,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2024-11-10 08:16:56,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec335555e/22a24c91aa424ea09fe06af90e104c6a/FLAGd5c90c54a [2024-11-10 08:16:57,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec335555e/22a24c91aa424ea09fe06af90e104c6a [2024-11-10 08:16:57,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:16:57,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:16:57,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:57,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:16:57,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:16:57,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ffc7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57, skipping insertion in model container [2024-11-10 08:16:57,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:16:57,480 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-32.i[915,928] [2024-11-10 08:16:57,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:57,522 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:16:57,533 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-32.i[915,928] [2024-11-10 08:16:57,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:57,562 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:16:57,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57 WrapperNode [2024-11-10 08:16:57,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:57,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:57,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:16:57,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:16:57,572 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:16:57" (1/1) ... [2024-11-10 08:16:57,584 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:16:57" (1/1) ... [2024-11-10 08:16:57,613 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2024-11-10 08:16:57,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:57,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:16:57,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:16:57,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:16:57,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,641 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:16:57,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:16:57,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:16:57,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:16:57,658 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:16:57,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (1/1) ... [2024-11-10 08:16:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:57,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:16:57,700 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:16:57,704 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:16:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:16:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:16:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:16:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:16:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:16:57,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:16:57,826 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:16:57,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:16:58,035 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:16:58,036 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:16:58,046 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:16:58,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:16:58,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:58 BoogieIcfgContainer [2024-11-10 08:16:58,054 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:16:58,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:16:58,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:16:58,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:16:58,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:16:57" (1/3) ... [2024-11-10 08:16:58,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdddf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:58, skipping insertion in model container [2024-11-10 08:16:58,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:57" (2/3) ... [2024-11-10 08:16:58,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdddf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:58, skipping insertion in model container [2024-11-10 08:16:58,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:58" (3/3) ... [2024-11-10 08:16:58,066 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-32.i [2024-11-10 08:16:58,080 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:16:58,080 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:16:58,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:16:58,148 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;@5e72a97c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:16:58,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:16:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:16:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:16:58,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:58,162 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:16:58,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:58,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:58,170 INFO L85 PathProgramCache]: Analyzing trace with hash 982221967, now seen corresponding path program 1 times [2024-11-10 08:16:58,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240591323] [2024-11-10 08:16:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:16:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 08:16:58,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:58,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240591323] [2024-11-10 08:16:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240591323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:58,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:58,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:16:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760976130] [2024-11-10 08:16:58,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:58,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:16:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:58,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:16:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:16:58,553 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:16:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:58,579 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-11-10 08:16:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:16:58,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-10 08:16:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:58,588 INFO L225 Difference]: With dead ends: 62 [2024-11-10 08:16:58,588 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 08:16:58,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:16:58,597 INFO L432 NwaCegarLoop]: 37 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, 37 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:16:58,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 08:16:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 08:16:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:16:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-10 08:16:58,639 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-10 08:16:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:58,640 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-10 08:16:58,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:16:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-10 08:16:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:16:58,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:58,643 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:16:58,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:16:58,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 840823758, now seen corresponding path program 1 times [2024-11-10 08:16:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550815983] [2024-11-10 08:16:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:16:58,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:16:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:16:58,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:16:58,843 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:16:58,845 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:16:58,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:16:58,850 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:16:58,909 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:16:58,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:16:58 BoogieIcfgContainer [2024-11-10 08:16:58,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:16:58,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:16:58,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:16:58,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:16:58,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:58" (3/4) ... [2024-11-10 08:16:58,917 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:16:58,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:16:58,919 INFO L158 Benchmark]: Toolchain (without parser) took 1625.57ms. Allocated memory is still 190.8MB. Free memory was 121.5MB in the beginning and 129.3MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:58,921 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:58,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.62ms. Allocated memory is still 190.8MB. Free memory was 121.2MB in the beginning and 108.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:16:58,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.08ms. Allocated memory is still 190.8MB. Free memory was 108.3MB in the beginning and 105.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:58,924 INFO L158 Benchmark]: Boogie Preprocessor took 39.77ms. Allocated memory is still 190.8MB. Free memory was 105.9MB in the beginning and 102.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:16:58,924 INFO L158 Benchmark]: IcfgBuilder took 396.84ms. Allocated memory is still 190.8MB. Free memory was 102.9MB in the beginning and 89.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:16:58,925 INFO L158 Benchmark]: TraceAbstraction took 857.05ms. Allocated memory is still 190.8MB. Free memory was 88.6MB in the beginning and 129.3MB in the end (delta: -40.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:58,925 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 190.8MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:58,931 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.19ms. Allocated memory is still 121.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.62ms. Allocated memory is still 190.8MB. Free memory was 121.2MB in the beginning and 108.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.08ms. Allocated memory is still 190.8MB. Free memory was 108.3MB in the beginning and 105.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.77ms. Allocated memory is still 190.8MB. Free memory was 105.9MB in the beginning and 102.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 396.84ms. Allocated memory is still 190.8MB. Free memory was 102.9MB in the beginning and 89.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 857.05ms. Allocated memory is still 190.8MB. Free memory was 88.6MB in the beginning and 129.3MB in the end (delta: -40.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 190.8MB. Free memory is still 129.3MB. 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 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned char var_1_2 = 1; [L24] signed short int var_1_5 = -32475; [L25] float var_1_7 = 7.2; [L26] float var_1_8 = 500.4; [L27] unsigned char var_1_9 = 10; [L28] unsigned char var_1_10 = 16; [L29] unsigned short int var_1_11 = 4; VAL [isInitial=0, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=1, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L60] isInitial = 1 [L61] FCALL initially() [L62] COND TRUE 1 [L63] FCALL updateLastVariables() [L64] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_uchar() [L42] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L42] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L43] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L43] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L44] var_1_5 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_5 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L45] RET assume_abort_if_not(var_1_5 >= -32766) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L46] CALL assume_abort_if_not(var_1_5 <= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L46] RET assume_abort_if_not(var_1_5 <= -16383) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L47] var_1_8 = __VERIFIER_nondet_float() [L48] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L48] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L49] var_1_10 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L50] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L51] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L51] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L64] RET updateVariables() [L65] CALL step() [L33] var_1_7 = var_1_8 [L34] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L35] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L38] var_1_11 = var_1_1 VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L65] RET step() [L66] CALL, EXPR property() [L56-L57] return (((var_1_2 ? (var_1_1 == ((signed short int) ((((((var_1_9 + 16)) > (var_1_9)) ? ((var_1_9 + 16)) : (var_1_9))) - (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) - var_1_9)))) : 1) && (var_1_7 == ((float) var_1_8))) && (var_1_9 == ((unsigned char) var_1_10))) && (var_1_11 == ((unsigned short int) var_1_1)) ; VAL [\result=0, isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L66] RET, EXPR property() [L66] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 7, 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, 37 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, 37 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 84/84 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:16:58,962 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-32.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 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:17:01,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:17:01,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:17:01,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:17:01,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:17:01,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:17:01,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:17:01,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:17:01,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:17:01,337 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:17:01,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:17:01,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:17:01,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:17:01,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:17:01,340 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:17:01,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:17:01,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:17:01,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:17:01,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:17:01,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:17:01,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:17:01,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:17:01,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:17:01,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:17:01,347 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:17:01,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:17:01,347 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:17:01,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:17:01,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:17:01,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:17:01,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:17:01,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:17:01,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:17:01,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:17:01,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:01,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:17:01,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:17:01,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:17:01,359 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:17:01,359 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:17:01,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:17:01,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:17:01,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:17:01,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:17:01,360 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 -> 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e [2024-11-10 08:17:01,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:17:01,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:17:01,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:17:01,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:17:01,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:17:01,706 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-32.i [2024-11-10 08:17:03,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:17:03,521 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:17:03,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2024-11-10 08:17:03,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0815d887/5d6aca997a75454f8e2591b6dbd1d359/FLAGa2f19c70f [2024-11-10 08:17:03,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0815d887/5d6aca997a75454f8e2591b6dbd1d359 [2024-11-10 08:17:03,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:17:03,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:17:03,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:03,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:17:03,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:17:03,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:03" (1/1) ... [2024-11-10 08:17:03,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95794a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:03, skipping insertion in model container [2024-11-10 08:17:03,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:17:03" (1/1) ... [2024-11-10 08:17:03,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:17:04,100 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-32.i[915,928] [2024-11-10 08:17:04,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:04,161 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:17:04,173 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-32.i[915,928] [2024-11-10 08:17:04,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:17:04,221 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:17:04,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04 WrapperNode [2024-11-10 08:17:04,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:17:04,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:04,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:17:04,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:17:04,230 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:17:04" (1/1) ... [2024-11-10 08:17:04,251 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:17:04" (1/1) ... [2024-11-10 08:17:04,272 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-11-10 08:17:04,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:17:04,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:17:04,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:17:04,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:17:04,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,302 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:17:04,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:17:04,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:17:04,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:17:04,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:17:04,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (1/1) ... [2024-11-10 08:17:04,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:17:04,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:17:04,355 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:17:04,358 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:17:04,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:17:04,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:17:04,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:17:04,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:17:04,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:17:04,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:17:04,460 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:17:04,464 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:17:04,661 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:17:04,661 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:17:04,672 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:17:04,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:17:04,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:04 BoogieIcfgContainer [2024-11-10 08:17:04,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:17:04,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:17:04,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:17:04,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:17:04,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:17:03" (1/3) ... [2024-11-10 08:17:04,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e007d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:04, skipping insertion in model container [2024-11-10 08:17:04,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:17:04" (2/3) ... [2024-11-10 08:17:04,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e007d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:17:04, skipping insertion in model container [2024-11-10 08:17:04,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:04" (3/3) ... [2024-11-10 08:17:04,685 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-32.i [2024-11-10 08:17:04,708 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:17:04,709 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:17:04,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:17:04,779 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;@1e306db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:17:04,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:17:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:17:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:04,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:04,790 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:17:04,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:04,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 982221967, now seen corresponding path program 1 times [2024-11-10 08:17:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:04,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956696928] [2024-11-10 08:17:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:04,806 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:17:04,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:04,809 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:17:04,813 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:17:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:04,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:17:04,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-10 08:17:04,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:17:04,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956696928] [2024-11-10 08:17:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956696928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:17:04,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:17:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:17:04,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295122999] [2024-11-10 08:17:04,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:17:05,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:17:05,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:05,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:17:05,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:17:05,022 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:17:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:05,038 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-11-10 08:17:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:17:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-10 08:17:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:05,047 INFO L225 Difference]: With dead ends: 62 [2024-11-10 08:17:05,047 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 08:17:05,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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:17:05,060 INFO L432 NwaCegarLoop]: 37 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, 37 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:17:05,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:17:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 08:17:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 08:17:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 08:17:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-10 08:17:05,092 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-10 08:17:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:05,092 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-10 08:17:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 08:17:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-10 08:17:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:05,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:05,095 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:17:05,101 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:17:05,296 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:17:05,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:05,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash 840823758, now seen corresponding path program 1 times [2024-11-10 08:17:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:05,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977960928] [2024-11-10 08:17:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:05,299 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:17:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:05,301 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:17:05,322 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:17:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:05,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:17:05,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 08:17:13,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:17:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-10 08:17:25,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:25,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977960928] [2024-11-10 08:17:25,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977960928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:17:25,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:17:25,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-10 08:17:25,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390809698] [2024-11-10 08:17:25,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:17:25,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 08:17:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:25,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 08:17:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-11-10 08:17:25,396 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 08:17:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:28,585 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-11-10 08:17:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 08:17:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 52 [2024-11-10 08:17:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:28,587 INFO L225 Difference]: With dead ends: 62 [2024-11-10 08:17:28,587 INFO L226 Difference]: Without dead ends: 59 [2024-11-10 08:17:28,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2024-11-10 08:17:28,589 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 91 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:28,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 223 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 08:17:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-10 08:17:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2024-11-10 08:17:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:17:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2024-11-10 08:17:28,601 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 52 [2024-11-10 08:17:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:28,602 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2024-11-10 08:17:28,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 08:17:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-10 08:17:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 08:17:28,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:17:28,604 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:17:28,609 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:17:28,804 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:17:28,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:17:28,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:17:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash -46679923, now seen corresponding path program 1 times [2024-11-10 08:17:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:17:28,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734631281] [2024-11-10 08:17:28,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:17:28,807 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:17:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:17:28,808 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:17:28,810 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:17:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:17:28,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:17:28,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:17:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 08:17:37,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:17:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-10 08:17:40,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:17:40,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734631281] [2024-11-10 08:17:40,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734631281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:17:40,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:17:40,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-10 08:17:40,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335118793] [2024-11-10 08:17:40,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:17:40,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 08:17:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:17:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 08:17:40,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-11-10 08:17:40,773 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 08:17:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:17:41,943 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-11-10 08:17:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 08:17:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 52 [2024-11-10 08:17:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:17:41,944 INFO L225 Difference]: With dead ends: 68 [2024-11-10 08:17:41,944 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:17:41,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 08:17:41,946 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:17:41,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 228 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:17:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:17:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:17:41,948 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:17:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:17:41,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-11-10 08:17:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:17:41,948 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:17:41,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 08:17:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:17:41,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:17:41,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:17:41,959 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:17:42,153 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:17:42,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:17:42,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:17:43,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:17:43,331 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:17:43,332 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-10 08:17:43,334 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:17:43,334 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-10 08:17:43,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:17:43 BoogieIcfgContainer [2024-11-10 08:17:43,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:17:43,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:17:43,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:17:43,341 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:17:43,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:17:04" (3/4) ... [2024-11-10 08:17:43,344 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:17:43,348 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:17:43,352 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:17:43,353 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:17:43,353 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:17:43,353 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:17:43,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:17:43,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:17:43,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:17:43,449 INFO L158 Benchmark]: Toolchain (without parser) took 39552.22ms. Allocated memory was 54.5MB in the beginning and 801.1MB in the end (delta: 746.6MB). Free memory was 36.0MB in the beginning and 608.1MB in the end (delta: -572.1MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. [2024-11-10 08:17:43,450 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 44.0MB. Free memory was 27.3MB in the beginning and 27.2MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:17:43,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.88ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 22.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:17:43,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.82ms. Allocated memory is still 54.5MB. Free memory was 21.8MB in the beginning and 34.3MB in the end (delta: -12.4MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-10 08:17:43,450 INFO L158 Benchmark]: Boogie Preprocessor took 47.81ms. Allocated memory is still 54.5MB. Free memory was 34.0MB in the beginning and 32.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:17:43,451 INFO L158 Benchmark]: IcfgBuilder took 350.26ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 19.6MB in the end (delta: 12.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 08:17:43,451 INFO L158 Benchmark]: TraceAbstraction took 38665.61ms. Allocated memory was 54.5MB in the beginning and 801.1MB in the end (delta: 746.6MB). Free memory was 18.9MB in the beginning and 613.3MB in the end (delta: -594.5MB). Peak memory consumption was 154.0MB. Max. memory is 16.1GB. [2024-11-10 08:17:43,451 INFO L158 Benchmark]: Witness Printer took 108.12ms. Allocated memory is still 801.1MB. Free memory was 613.3MB in the beginning and 608.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:17:43,453 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.70ms. Allocated memory is still 44.0MB. Free memory was 27.3MB in the beginning and 27.2MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.88ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 22.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.82ms. Allocated memory is still 54.5MB. Free memory was 21.8MB in the beginning and 34.3MB in the end (delta: -12.4MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.81ms. Allocated memory is still 54.5MB. Free memory was 34.0MB in the beginning and 32.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 350.26ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 19.6MB in the end (delta: 12.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38665.61ms. Allocated memory was 54.5MB in the beginning and 801.1MB in the end (delta: 746.6MB). Free memory was 18.9MB in the beginning and 613.3MB in the end (delta: -594.5MB). Peak memory consumption was 154.0MB. Max. memory is 16.1GB. * Witness Printer took 108.12ms. Allocated memory is still 801.1MB. Free memory was 613.3MB in the beginning and 608.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.4s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 488 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 378 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 110 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 39, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 255 ConstructedInterpolants, 3 QuantifiedInterpolants, 7385 SizeOfPredicates, 26 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 328/420 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: 62]: 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: ((0 != cond) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:17:43,540 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