./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-91.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 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:12:55,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:12:55,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:12:55,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:12:55,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:12:55,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:12:55,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:12:55,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:12:55,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:12:55,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:12:55,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:12:55,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:12:55,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:12:55,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:12:55,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:12:55,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:12:55,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:12:55,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:12:55,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:12:55,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:12:55,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:12:55,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:12:55,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:12:55,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:12:55,715 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:12:55,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:12:55,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:12:55,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:12:55,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:12:55,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:12:55,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:12:55,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:12:55,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:12:55,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:12:55,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:12:55,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:12:55,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:12:55,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:12:55,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:12:55,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:12:55,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:12:55,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:12:55,720 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 -> 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 [2024-11-22 10:12:55,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:12:55,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:12:55,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:12:55,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:12:55,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:12:55,996 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-91.i [2024-11-22 10:12:57,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:12:57,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:12:57,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i [2024-11-22 10:12:57,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5213d1d5/61be699bcce64317ab211dee478dbc6e/FLAG97fc8c699 [2024-11-22 10:12:57,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5213d1d5/61be699bcce64317ab211dee478dbc6e [2024-11-22 10:12:57,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:12:57,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:12:57,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:12:57,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:12:57,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:12:57,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:57" (1/1) ... [2024-11-22 10:12:57,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e75cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:57, skipping insertion in model container [2024-11-22 10:12:57,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:12:57" (1/1) ... [2024-11-22 10:12:57,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:12:57,987 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-91.i[916,929] [2024-11-22 10:12:58,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:12:58,034 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:12:58,045 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-91.i[916,929] [2024-11-22 10:12:58,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:12:58,081 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:12:58,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58 WrapperNode [2024-11-22 10:12:58,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:12:58,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:12:58,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:12:58,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:12:58,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,116 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-22 10:12:58,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:12:58,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:12:58,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:12:58,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:12:58,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,143 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-22 10:12:58,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:12:58,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:12:58,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:12:58,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:12:58,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (1/1) ... [2024-11-22 10:12:58,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:12:58,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:12:58,189 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-22 10:12:58,217 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-22 10:12:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:12:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:12:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:12:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:12:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:12:58,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:12:58,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:12:58,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:12:58,521 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 10:12:58,521 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:12:58,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:12:58,533 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:12:58,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:58 BoogieIcfgContainer [2024-11-22 10:12:58,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:12:58,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:12:58,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:12:58,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:12:58,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:12:57" (1/3) ... [2024-11-22 10:12:58,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2239f7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:58, skipping insertion in model container [2024-11-22 10:12:58,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:12:58" (2/3) ... [2024-11-22 10:12:58,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2239f7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:12:58, skipping insertion in model container [2024-11-22 10:12:58,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:58" (3/3) ... [2024-11-22 10:12:58,546 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-91.i [2024-11-22 10:12:58,560 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:12:58,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:12:58,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:12:58,624 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;@12d10760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:12:58,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:12:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 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-22 10:12:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 10:12:58,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:58,639 INFO L215 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, 1, 1] [2024-11-22 10:12:58,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1288732057, now seen corresponding path program 1 times [2024-11-22 10:12:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043755678] [2024-11-22 10:12:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 10:12:58,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:12:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043755678] [2024-11-22 10:12:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043755678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:12:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498577985] [2024-11-22 10:12:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:12:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:12:58,927 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-22 10:12:58,928 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-22 10:12:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:59,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:12:59,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:12:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 10:12:59,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:12:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498577985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:12:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:12:59,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:12:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867538360] [2024-11-22 10:12:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:12:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:12:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:12:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:12:59,104 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 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), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:12:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:59,165 INFO L93 Difference]: Finished difference Result 105 states and 184 transitions. [2024-11-22 10:12:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:12:59,171 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), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2024-11-22 10:12:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:59,181 INFO L225 Difference]: With dead ends: 105 [2024-11-22 10:12:59,182 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 10:12:59,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-22 10:12:59,190 INFO L432 NwaCegarLoop]: 78 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, 78 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-22 10:12:59,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:12:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 10:12:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-22 10:12:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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-22 10:12:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2024-11-22 10:12:59,257 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 123 [2024-11-22 10:12:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:59,259 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-22 10:12:59,260 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), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:12:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-11-22 10:12:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 10:12:59,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:59,268 INFO L215 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, 1, 1] [2024-11-22 10:12:59,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:12:59,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:12:59,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:59,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1065228903, now seen corresponding path program 1 times [2024-11-22 10:12:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:12:59,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868374519] [2024-11-22 10:12:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:59,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:12:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:10,192 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 62 DAG size of output: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 10:13:14,177 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-22 10:13:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:14,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868374519] [2024-11-22 10:13:14,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868374519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:14,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:14,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:13:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062346144] [2024-11-22 10:13:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:14,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:13:14,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:14,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:13:14,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:13:14,182 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:13:18,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-22 10:13:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:23,313 INFO L93 Difference]: Finished difference Result 104 states and 144 transitions. [2024-11-22 10:13:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:13:23,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-11-22 10:13:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:23,316 INFO L225 Difference]: With dead ends: 104 [2024-11-22 10:13:23,316 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 10:13:23,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:13:23,318 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 98 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:23,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 330 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-22 10:13:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 10:13:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2024-11-22 10:13:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 10:13:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-11-22 10:13:23,331 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 123 [2024-11-22 10:13:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:23,332 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-11-22 10:13:23,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:13:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-11-22 10:13:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 10:13:23,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:23,334 INFO L215 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, 1, 1] [2024-11-22 10:13:23,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:13:23,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1007970601, now seen corresponding path program 1 times [2024-11-22 10:13:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632605558] [2024-11-22 10:13:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:33,059 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-22 10:13:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:13:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632605558] [2024-11-22 10:13:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632605558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:13:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026289281] [2024-11-22 10:13:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:33,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:13:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:13:33,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:13:33,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:13:33,062 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:13:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:34,870 INFO L93 Difference]: Finished difference Result 167 states and 242 transitions. [2024-11-22 10:13:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:13:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-11-22 10:13:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:34,875 INFO L225 Difference]: With dead ends: 167 [2024-11-22 10:13:34,875 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 10:13:34,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:13:34,876 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 50 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 10:13:34,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 440 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 10:13:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 10:13:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 76. [2024-11-22 10:13:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 10:13:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2024-11-22 10:13:34,898 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 123 [2024-11-22 10:13:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:34,899 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2024-11-22 10:13:34,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:13:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2024-11-22 10:13:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 10:13:34,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:34,905 INFO L215 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, 1, 1] [2024-11-22 10:13:34,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:13:34,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:34,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1874575529, now seen corresponding path program 1 times [2024-11-22 10:13:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:13:34,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810313137] [2024-11-22 10:13:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:34,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:13:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:13:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219229709] [2024-11-22 10:13:35,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:35,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:13:35,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:13:35,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:13:35,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 10:13:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:13:35,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:13:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:13:35,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:13:35,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:13:35,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:13:35,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 10:13:35,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-22 10:13:35,443 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 10:13:35,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:13:35,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:13:35 BoogieIcfgContainer [2024-11-22 10:13:35,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:13:35,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:13:35,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:13:35,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:13:35,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:12:58" (3/4) ... [2024-11-22 10:13:35,549 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:13:35,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:13:35,551 INFO L158 Benchmark]: Toolchain (without parser) took 37724.50ms. Allocated memory was 188.7MB in the beginning and 362.8MB in the end (delta: 174.1MB). Free memory was 114.9MB in the beginning and 288.3MB in the end (delta: -173.4MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2024-11-22 10:13:35,551 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:13:35,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.51ms. Allocated memory is still 188.7MB. Free memory was 114.7MB in the beginning and 100.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:13:35,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.52ms. Allocated memory is still 188.7MB. Free memory was 100.4MB in the beginning and 98.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:13:35,552 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 188.7MB. Free memory was 98.2MB in the beginning and 95.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:13:35,552 INFO L158 Benchmark]: RCFGBuilder took 378.72ms. Allocated memory was 188.7MB in the beginning and 249.6MB in the end (delta: 60.8MB). Free memory was 95.8MB in the beginning and 205.6MB in the end (delta: -109.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-22 10:13:35,552 INFO L158 Benchmark]: TraceAbstraction took 37009.34ms. Allocated memory was 249.6MB in the beginning and 362.8MB in the end (delta: 113.2MB). Free memory was 205.6MB in the beginning and 289.4MB in the end (delta: -83.7MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-22 10:13:35,552 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 362.8MB. Free memory is still 288.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:13:35,555 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.15ms. Allocated memory is still 188.7MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.51ms. Allocated memory is still 188.7MB. Free memory was 114.7MB in the beginning and 100.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.52ms. Allocated memory is still 188.7MB. Free memory was 100.4MB in the beginning and 98.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 188.7MB. Free memory was 98.2MB in the beginning and 95.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.72ms. Allocated memory was 188.7MB in the beginning and 249.6MB in the end (delta: 60.8MB). Free memory was 95.8MB in the beginning and 205.6MB in the end (delta: -109.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 37009.34ms. Allocated memory was 249.6MB in the beginning and 362.8MB in the end (delta: 113.2MB). Free memory was 205.6MB in the beginning and 289.4MB in the end (delta: -83.7MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 362.8MB. Free memory is still 288.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] signed long int var_1_2 = 49; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 64; [L26] signed short int var_1_5 = 1; [L27] signed long int var_1_6 = 8; [L28] signed long int var_1_7 = 0; [L29] signed short int var_1_8 = -4; [L30] unsigned long int var_1_9 = 64; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 10; [L33] signed short int var_1_12 = 100; [L34] signed short int var_1_14 = 128; [L35] signed short int var_1_15 = 10; VAL [isInitial=0, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=49, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L70] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L71] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L71] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L72] var_1_3 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L74] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L74] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=64, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L75] var_1_4 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L76] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L77] CALL assume_abort_if_not(var_1_4 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L77] RET assume_abort_if_not(var_1_4 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=8, var_1_7=0, var_1_8=-4, var_1_9=64] [L78] var_1_6 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L79] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L80] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L80] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=0, var_1_8=-4, var_1_9=64] [L81] var_1_7 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L82] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L83] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L83] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-4, var_1_9=64] [L84] var_1_8 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L85] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L86] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L86] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L87] var_1_10 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L89] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L89] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L90] var_1_11 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L92] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L92] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L93] var_1_14 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L94] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L95] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L95] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L96] var_1_15 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L97] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L98] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L98] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L111] RET updateVariables() [L112] CALL step() [L39] COND FALSE !(var_1_2 >= 50.4f) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=1, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L42] COND FALSE !(var_1_3 == (var_1_1 * var_1_4)) [L49] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=64] [L51] COND TRUE ! (var_1_4 < var_1_3) [L52] var_1_9 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L56] COND FALSE !(var_1_10 > var_1_9) [L65] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return ((((var_1_2 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) && ((var_1_3 == (var_1_1 * var_1_4)) ? ((var_1_2 >= (var_1_6 + var_1_7)) ? (var_1_5 == ((signed short int) var_1_8)) : (var_1_5 == ((signed short int) 32))) : (var_1_5 == ((signed short int) var_1_8)))) && ((! (var_1_4 < var_1_3)) ? (var_1_9 == ((unsigned long int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_9 == ((unsigned long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))))) && ((var_1_10 > var_1_9) ? ((63.1 >= var_1_7) ? ((var_1_7 >= var_1_2) ? (var_1_12 == ((signed short int) (var_1_14 - var_1_15))) : (var_1_12 == ((signed short int) var_1_14))) : 1) : (var_1_12 == ((signed short int) var_1_15))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_2=-2147483648, var_1_3=-4194967295, var_1_4=4394967297, var_1_5=-32767, var_1_6=-2147483648, var_1_7=-2147483648, var_1_8=-32767, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.8s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 848 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 603 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 206 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 245 mSDtfsCounter, 206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 277 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3002/3040 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-22 10:13:35,602 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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-91.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 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:13:38,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:13:38,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:13:38,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:13:38,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:13:38,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:13:38,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:13:38,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:13:38,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:13:38,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:13:38,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:13:38,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:13:38,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:13:38,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:13:38,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:13:38,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:13:38,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:13:38,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:13:38,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:13:38,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:13:38,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:13:38,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:13:38,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:13:38,131 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:13:38,131 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:13:38,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:13:38,131 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:13:38,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:13:38,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:13:38,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:13:38,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:13:38,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:13:38,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:13:38,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:13:38,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:13:38,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:13:38,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:13:38,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:13:38,133 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:13:38,133 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:13:38,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:13:38,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:13:38,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:13:38,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:13:38,136 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 -> 5353ffee1c37a3ffec4ffba8ec43efc8addb948d99d804c998abea189ea9cf15 [2024-11-22 10:13:38,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:13:38,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:13:38,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:13:38,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:13:38,473 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:13:38,474 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-91.i [2024-11-22 10:13:40,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:13:40,369 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:13:40,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-91.i [2024-11-22 10:13:40,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5a27e2a/8c74fe760df949968a8da91eca06469a/FLAG2a964f984 [2024-11-22 10:13:40,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e5a27e2a/8c74fe760df949968a8da91eca06469a [2024-11-22 10:13:40,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:13:40,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:13:40,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:13:40,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:13:40,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:13:40,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:40" (1/1) ... [2024-11-22 10:13:40,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ea2b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:40, skipping insertion in model container [2024-11-22 10:13:40,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:40" (1/1) ... [2024-11-22 10:13:40,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:13:40,876 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-91.i[916,929] [2024-11-22 10:13:40,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:13:40,973 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:13:40,987 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-91.i[916,929] [2024-11-22 10:13:41,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:13:41,039 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:13:41,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41 WrapperNode [2024-11-22 10:13:41,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:13:41,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:13:41,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:13:41,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:13:41,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,100 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-22 10:13:41,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:13:41,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:13:41,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:13:41,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:13:41,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,126 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-22 10:13:41,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:13:41,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:13:41,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:13:41,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:13:41,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (1/1) ... [2024-11-22 10:13:41,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:13:41,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:13:41,209 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-22 10:13:41,212 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-22 10:13:41,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:13:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:13:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:13:41,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:13:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:13:41,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:13:41,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:13:41,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:13:43,199 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 10:13:43,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:13:43,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:13:43,210 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:13:43,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:43 BoogieIcfgContainer [2024-11-22 10:13:43,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:13:43,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:13:43,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:13:43,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:13:43,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:13:40" (1/3) ... [2024-11-22 10:13:43,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2907dc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:43, skipping insertion in model container [2024-11-22 10:13:43,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:41" (2/3) ... [2024-11-22 10:13:43,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2907dc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:43, skipping insertion in model container [2024-11-22 10:13:43,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:43" (3/3) ... [2024-11-22 10:13:43,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-91.i [2024-11-22 10:13:43,231 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:13:43,232 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:13:43,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:13:43,307 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;@620678b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:13:43,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:13:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 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-22 10:13:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 10:13:43,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:43,326 INFO L215 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, 1, 1] [2024-11-22 10:13:43,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:43,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1288732057, now seen corresponding path program 1 times [2024-11-22 10:13:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:13:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584314677] [2024-11-22 10:13:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:43,346 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-22 10:13:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:13:43,352 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-22 10:13:43,354 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-22 10:13:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:43,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:13:43,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:13:43,585 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-22 10:13:43,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:13:43,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:13:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584314677] [2024-11-22 10:13:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584314677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:13:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:13:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:13:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927144936] [2024-11-22 10:13:43,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:13:43,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:13:43,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:13:43,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:13:43,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:13:43,612 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-22 10:13:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:13:43,634 INFO L93 Difference]: Finished difference Result 105 states and 184 transitions. [2024-11-22 10:13:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:13:43,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 123 [2024-11-22 10:13:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:13:43,646 INFO L225 Difference]: With dead ends: 105 [2024-11-22 10:13:43,646 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 10:13:43,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-22 10:13:43,655 INFO L432 NwaCegarLoop]: 78 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, 78 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-22 10:13:43,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:13:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 10:13:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-22 10:13:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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-22 10:13:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2024-11-22 10:13:43,696 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 123 [2024-11-22 10:13:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:13:43,696 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-22 10:13:43,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-22 10:13:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-11-22 10:13:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 10:13:43,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:13:43,699 INFO L215 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, 1, 1] [2024-11-22 10:13:43,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 10:13:43,903 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-22 10:13:43,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:13:43,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:13:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1065228903, now seen corresponding path program 1 times [2024-11-22 10:13:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:13:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239162766] [2024-11-22 10:13:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:13:43,907 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-22 10:13:43,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:13:43,909 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-22 10:13:43,934 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-22 10:13:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:13:44,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 10:13:44,055 INFO L278 TraceCheckSpWp]: Computing forward predicates...