./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.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 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:54:07,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:54:07,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:54:07,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:54:07,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:54:07,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:54:07,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:54:07,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:54:07,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:54:07,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:54:07,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:54:07,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:54:07,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:54:07,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:54:07,725 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:54:07,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:54:07,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:54:07,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:54:07,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:54:07,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:54:07,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:54:07,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:54:07,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:54:07,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:54:07,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:54:07,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:54:07,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:54:07,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:54:07,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:54:07,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:54:07,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:54:07,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:54:07,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:07,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:54:07,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:54:07,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:54:07,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:54:07,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:54:07,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:54:07,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:54:07,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:54:07,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:54:07,734 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 -> 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 [2024-11-12 04:54:07,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:54:07,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:54:07,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:54:07,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:54:07,962 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:54:07,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2024-11-12 04:54:09,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:54:09,417 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:54:09,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2024-11-12 04:54:09,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bef06f6d/a929c56fa50e41e7bcf3cd17b485ce1d/FLAG6e1f88350 [2024-11-12 04:54:09,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bef06f6d/a929c56fa50e41e7bcf3cd17b485ce1d [2024-11-12 04:54:09,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:54:09,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:54:09,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:09,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:54:09,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:54:09,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fc3518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09, skipping insertion in model container [2024-11-12 04:54:09,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:54:09,610 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2024-11-12 04:54:09,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:09,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:54:09,659 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2024-11-12 04:54:09,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:09,690 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:54:09,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09 WrapperNode [2024-11-12 04:54:09,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:09,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:09,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:54:09,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:54:09,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,725 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-12 04:54:09,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:09,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:54:09,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:54:09,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:54:09,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,748 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:54:09,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:54:09,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:54:09,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:54:09,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:54:09,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (1/1) ... [2024-11-12 04:54:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:09,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:54:09,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:54:09,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:54:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:54:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:54:09,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:54:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:54:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:54:09,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:54:09,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:54:09,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:54:10,071 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 04:54:10,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:54:10,083 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:54:10,083 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:54:10,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:10 BoogieIcfgContainer [2024-11-12 04:54:10,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:54:10,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:54:10,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:54:10,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:54:10,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:54:09" (1/3) ... [2024-11-12 04:54:10,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebf58a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:10, skipping insertion in model container [2024-11-12 04:54:10,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:09" (2/3) ... [2024-11-12 04:54:10,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebf58a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:10, skipping insertion in model container [2024-11-12 04:54:10,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:10" (3/3) ... [2024-11-12 04:54:10,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-93.i [2024-11-12 04:54:10,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:54:10,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:54:10,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:54:10,159 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;@510f0b44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:54:10,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:54:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 04:54:10,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 04:54:10,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:10,174 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:10,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1136071295, now seen corresponding path program 1 times [2024-11-12 04:54:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:54:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958161745] [2024-11-12 04:54:10,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:54:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:54:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:54:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:54:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:54:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:54:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 04:54:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:54:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 04:54:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:54:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 04:54:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:54:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 04:54:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:54:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 04:54:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 04:54:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 04:54:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:54:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 04:54:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:54:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 04:54:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 04:54:10,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:54:10,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958161745] [2024-11-12 04:54:10,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958161745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:54:10,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:54:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:54:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198274644] [2024-11-12 04:54:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:54:10,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:54:10,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:54:10,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:54:10,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:10,616 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 04:54:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:54:10,641 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2024-11-12 04:54:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:54:10,644 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-11-12 04:54:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:54:10,650 INFO L225 Difference]: With dead ends: 99 [2024-11-12 04:54:10,651 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 04:54:10,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:10,658 INFO L435 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:54:10,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:54:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 04:54:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 04:54:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 04:54:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-11-12 04:54:10,702 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 121 [2024-11-12 04:54:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:54:10,704 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-11-12 04:54:10,704 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 04:54:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-11-12 04:54:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 04:54:10,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:10,710 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:10,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:54:10,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:10,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1865427133, now seen corresponding path program 1 times [2024-11-12 04:54:10,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:54:10,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574255575] [2024-11-12 04:54:10,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:10,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:54:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:54:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013540864] [2024-11-12 04:54:10,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:10,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:54:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:54:10,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:54:10,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:54:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:54:10,969 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:54:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:54:11,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:54:11,075 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:54:11,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:54:11,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:54:11,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:54:11,282 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 04:54:11,376 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:54:11,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:54:11 BoogieIcfgContainer [2024-11-12 04:54:11,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:54:11,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:54:11,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:54:11,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:54:11,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:10" (3/4) ... [2024-11-12 04:54:11,386 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:54:11,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:54:11,389 INFO L158 Benchmark]: Toolchain (without parser) took 1947.42ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 120.2MB in the beginning and 157.3MB in the end (delta: -37.1MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-11-12 04:54:11,389 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:54:11,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.92ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 106.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 04:54:11,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.63ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 103.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:54:11,391 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 101.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:54:11,392 INFO L158 Benchmark]: RCFGBuilder took 324.36ms. Allocated memory is still 176.2MB. Free memory was 101.3MB in the beginning and 85.2MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:54:11,393 INFO L158 Benchmark]: TraceAbstraction took 1297.08ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 84.5MB in the beginning and 157.3MB in the end (delta: -72.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:54:11,393 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 249.6MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:54:11,394 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.16ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.92ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 106.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.63ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 103.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 101.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 324.36ms. Allocated memory is still 176.2MB. Free memory was 101.3MB in the beginning and 85.2MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1297.08ms. Allocated memory was 176.2MB in the beginning and 249.6MB in the end (delta: 73.4MB). Free memory was 84.5MB in the beginning and 157.3MB in the end (delta: -72.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 249.6MB. Free memory is still 157.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 to_int at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 255; [L23] signed long int var_1_3 = 0; [L24] signed long int var_1_5 = 128; [L25] signed long int var_1_6 = 9; [L26] signed long int var_1_7 = 31; [L27] signed long int var_1_8 = 9; [L28] signed long int var_1_9 = 499; [L29] signed long int var_1_10 = 1; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] signed long int last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L62] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L65] var_1_5 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L66] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L82] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L83] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L83] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L84] var_1_13 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L86] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L86] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L88] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L103] RET updateVariables() [L104] CALL step() [L38] COND FALSE !(((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) [L45] var_1_1 = 64.51f VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L47] COND TRUE var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1)))) [L48] var_1_10 = 2147000000.0f VAL [isInitial=1, last_1_var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L52] COND TRUE ! (var_1_3 <= var_1_10) [L53] var_1_11 = (var_1_12 && var_1_13) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) ? ((last_1_var_1_10 != (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - var_1_8)) ? (var_1_1 == ((signed long int) var_1_9)) : (var_1_1 == ((signed long int) var_1_9))) : (var_1_1 == ((signed long int) 64.51f))) && ((var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1))))) ? (var_1_10 == ((signed long int) 1.00000000000004E13f)) : (var_1_10 == ((signed long int) var_1_9)))) && ((! (var_1_3 <= var_1_10)) ? (var_1_11 == ((unsigned char) (var_1_12 && var_1_13))) : (((var_1_7 / var_1_3) < ((((((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) < (var_1_5)) ? (((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) : (var_1_5)))) ? (var_1_11 == ((unsigned char) var_1_14)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=0, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=0, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=0, var_1_3=1, var_1_5=-1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 20, 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, 73 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, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 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-12 04:54:11,426 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_floatingpointinfluence_no-floats_file-93.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 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:54:13,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:54:13,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:54:13,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:54:13,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:54:13,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:54:13,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:54:13,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:54:13,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:54:13,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:54:13,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:54:13,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:54:13,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:54:13,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:54:13,359 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:54:13,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:54:13,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:54:13,360 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:54:13,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:54:13,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:54:13,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:54:13,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:54:13,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:54:13,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:54:13,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:54:13,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:54:13,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:54:13,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:54:13,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:54:13,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:54:13,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:54:13,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:54:13,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:54:13,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:54:13,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:13,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:54:13,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:54:13,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:54:13,364 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:54:13,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:54:13,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:54:13,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:54:13,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:54:13,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:54:13,366 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 -> 47a9580359f4ce533ffae805fbaa0b559dfa198618e852328ee6cb0ba7f4c377 [2024-11-12 04:54:13,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:54:13,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:54:13,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:54:13,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:54:13,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:54:13,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2024-11-12 04:54:14,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:54:15,136 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:54:15,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93.i [2024-11-12 04:54:15,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb992cc2/1a891975fe904a988b500dec26fe9c79/FLAGf9892961b [2024-11-12 04:54:15,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb992cc2/1a891975fe904a988b500dec26fe9c79 [2024-11-12 04:54:15,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:54:15,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:54:15,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:15,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:54:15,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:54:15,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758ce344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15, skipping insertion in model container [2024-11-12 04:54:15,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:54:15,723 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2024-11-12 04:54:15,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:15,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:54:15,787 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_floatingpointinfluence_no-floats_file-93.i[916,929] [2024-11-12 04:54:15,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:54:15,814 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:54:15,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15 WrapperNode [2024-11-12 04:54:15,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:54:15,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:15,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:54:15,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:54:15,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,848 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-12 04:54:15,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:54:15,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:54:15,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:54:15,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:54:15,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,885 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:54:15,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:54:15,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:54:15,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:54:15,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:54:15,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (1/1) ... [2024-11-12 04:54:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:54:15,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:54:15,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:54:15,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:54:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:54:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:54:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:54:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:54:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:54:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:54:16,061 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:54:16,064 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:54:28,715 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 04:54:28,715 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:54:28,729 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:54:28,729 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:54:28,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:28 BoogieIcfgContainer [2024-11-12 04:54:28,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:54:28,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:54:28,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:54:28,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:54:28,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:54:15" (1/3) ... [2024-11-12 04:54:28,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bb5d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:28, skipping insertion in model container [2024-11-12 04:54:28,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:54:15" (2/3) ... [2024-11-12 04:54:28,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bb5d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:54:28, skipping insertion in model container [2024-11-12 04:54:28,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:28" (3/3) ... [2024-11-12 04:54:28,742 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-93.i [2024-11-12 04:54:28,754 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:54:28,755 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:54:28,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:54:28,800 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;@396f1e34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:54:28,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:54:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 04:54:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 04:54:28,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:28,813 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:28,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:28,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1136071295, now seen corresponding path program 1 times [2024-11-12 04:54:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:54:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945272445] [2024-11-12 04:54:28,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:28,832 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-12 04:54:28,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:54:28,835 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-12 04:54:28,836 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-12 04:54:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:54:29,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:54:29,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:54:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-12 04:54:29,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:54:29,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:54:29,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945272445] [2024-11-12 04:54:29,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945272445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:54:29,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:54:29,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:54:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071055968] [2024-11-12 04:54:29,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:54:29,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:54:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:54:29,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:54:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:29,280 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 04:54:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:54:29,299 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2024-11-12 04:54:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:54:29,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-11-12 04:54:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:54:29,306 INFO L225 Difference]: With dead ends: 99 [2024-11-12 04:54:29,306 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 04:54:29,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:54:29,313 INFO L435 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:54:29,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:54:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 04:54:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 04:54:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 04:54:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-11-12 04:54:29,346 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 121 [2024-11-12 04:54:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:54:29,346 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-11-12 04:54:29,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 04:54:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-11-12 04:54:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 04:54:29,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:54:29,348 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:54:29,365 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 04:54:29,549 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-12 04:54:29,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:54:29,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:54:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1865427133, now seen corresponding path program 1 times [2024-11-12 04:54:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:54:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750775773] [2024-11-12 04:54:29,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:54:29,552 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-12 04:54:29,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:54:29,555 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-12 04:54:29,556 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-12 04:54:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:54:30,034 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:54:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:54:30,476 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 04:54:30,476 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:54:30,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:54:30,500 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-12 04:54:30,679 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-12 04:54:30,683 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 04:54:30,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:54:30,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:54:30 BoogieIcfgContainer [2024-11-12 04:54:30,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:54:30,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:54:30,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:54:30,761 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:54:30,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:54:28" (3/4) ... [2024-11-12 04:54:30,762 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 04:54:30,869 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 04:54:30,869 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:54:30,870 INFO L158 Benchmark]: Toolchain (without parser) took 15331.03ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 48.7MB in the beginning and 85.8MB in the end (delta: -37.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-12 04:54:30,870 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 88.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:54:30,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.84ms. Allocated memory is still 88.1MB. Free memory was 48.7MB in the beginning and 59.3MB in the end (delta: -10.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-12 04:54:30,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.59ms. Allocated memory is still 88.1MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:54:30,871 INFO L158 Benchmark]: Boogie Preprocessor took 62.71ms. Allocated memory is still 88.1MB. Free memory was 57.2MB in the beginning and 54.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:54:30,872 INFO L158 Benchmark]: RCFGBuilder took 12817.64ms. Allocated memory is still 88.1MB. Free memory was 54.7MB in the beginning and 39.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:54:30,872 INFO L158 Benchmark]: TraceAbstraction took 2023.53ms. Allocated memory is still 113.2MB. Free memory was 90.7MB in the beginning and 73.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-12 04:54:30,873 INFO L158 Benchmark]: Witness Printer took 108.55ms. Allocated memory is still 113.2MB. Free memory was 73.2MB in the beginning and 85.8MB in the end (delta: -12.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-12 04:54:30,874 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 88.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.84ms. Allocated memory is still 88.1MB. Free memory was 48.7MB in the beginning and 59.3MB in the end (delta: -10.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.59ms. Allocated memory is still 88.1MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.71ms. Allocated memory is still 88.1MB. Free memory was 57.2MB in the beginning and 54.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 12817.64ms. Allocated memory is still 88.1MB. Free memory was 54.7MB in the beginning and 39.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2023.53ms. Allocated memory is still 113.2MB. Free memory was 90.7MB in the beginning and 73.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 108.55ms. Allocated memory is still 113.2MB. Free memory was 73.2MB in the beginning and 85.8MB in the end (delta: -12.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 255; [L23] signed long int var_1_3 = 0; [L24] signed long int var_1_5 = 128; [L25] signed long int var_1_6 = 9; [L26] signed long int var_1_7 = 31; [L27] signed long int var_1_8 = 9; [L28] signed long int var_1_9 = 499; [L29] signed long int var_1_10 = 1; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] signed long int last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=0, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L62] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L65] var_1_5 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L66] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=9, var_1_9=499] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=499] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L82] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L83] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L83] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L84] var_1_13 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L86] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L86] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L88] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L103] RET updateVariables() [L104] CALL step() [L38] COND FALSE !(((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) [L45] var_1_1 = 64.51f VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L47] COND TRUE var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1)))) [L48] var_1_10 = 2147000000.0f VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L52] COND TRUE ! (var_1_3 <= var_1_10) [L53] var_1_11 = (var_1_12 && var_1_13) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) ? ((last_1_var_1_10 != (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - var_1_8)) ? (var_1_1 == ((signed long int) var_1_9)) : (var_1_1 == ((signed long int) var_1_9))) : (var_1_1 == ((signed long int) 64.51f))) && ((var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1))))) ? (var_1_10 == ((signed long int) 1.00000000000004E13f)) : (var_1_10 == ((signed long int) var_1_9)))) && ((! (var_1_3 <= var_1_10)) ? (var_1_11 == ((unsigned char) (var_1_12 && var_1_13))) : (((var_1_7 / var_1_3) < ((((((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) < (var_1_5)) ? (((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) : (var_1_5)))) ? (var_1_11 == ((unsigned char) var_1_14)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, var_1_10=2147000064, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=64, var_1_3=2147000066, var_1_5=67076096, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-802816000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 20, 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, 73 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, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.7s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 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 proved your program to be incorrect! [2024-11-12 04:54:30,988 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE