./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_has-floats_file-35.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 aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:23:55,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:23:55,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:23:55,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:23:55,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:23:55,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:23:55,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:23:55,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:23:55,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:23:55,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:23:55,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:23:55,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:23:55,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:23:55,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:23:55,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:23:55,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:23:55,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:23:55,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:23:55,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:23:55,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:23:55,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:23:55,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:23:55,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:23:55,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:23:55,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:23:55,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:23:55,579 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 [2025-03-03 22:23:55,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:23:55,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:23:55,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:23:55,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:23:55,797 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:23:55,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-03-03 22:23:56,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f532261eb/ca0e826832474c58881838b23cacddaf/FLAG8bc3733c8 [2025-03-03 22:23:57,246 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:23:57,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-03-03 22:23:57,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f532261eb/ca0e826832474c58881838b23cacddaf/FLAG8bc3733c8 [2025-03-03 22:23:57,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f532261eb/ca0e826832474c58881838b23cacddaf [2025-03-03 22:23:57,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:23:57,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:23:57,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:23:57,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:23:57,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:23:57,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4742ae65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57, skipping insertion in model container [2025-03-03 22:23:57,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:23:57,653 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_has-floats_file-35.i[917,930] [2025-03-03 22:23:57,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:23:57,688 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:23:57,694 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_has-floats_file-35.i[917,930] [2025-03-03 22:23:57,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:23:57,718 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:23:57,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57 WrapperNode [2025-03-03 22:23:57,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:23:57,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:23:57,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:23:57,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:23:57,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,754 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-03 22:23:57,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:23:57,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:23:57,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:23:57,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:23:57,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,773 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]. [2025-03-03 22:23:57,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:23:57,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:23:57,788 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:23:57,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:23:57,789 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (1/1) ... [2025-03-03 22:23:57,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:23:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:23:57,814 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) [2025-03-03 22:23:57,817 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 [2025-03-03 22:23:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:23:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:23:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:23:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:23:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:23:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:23:57,888 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:23:57,890 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:23:58,077 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:23:58,077 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:23:58,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:23:58,084 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:23:58,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:58 BoogieIcfgContainer [2025-03-03 22:23:58,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:23:58,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:23:58,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:23:58,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:23:58,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:23:57" (1/3) ... [2025-03-03 22:23:58,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29af3df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:23:58, skipping insertion in model container [2025-03-03 22:23:58,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:23:57" (2/3) ... [2025-03-03 22:23:58,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29af3df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:23:58, skipping insertion in model container [2025-03-03 22:23:58,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:58" (3/3) ... [2025-03-03 22:23:58,091 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-35.i [2025-03-03 22:23:58,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:23:58,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-35.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:23:58,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:23:58,144 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;@3419fb12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:23:58,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:23:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:23:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:23:58,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:58,154 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:58,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:58,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1946220228, now seen corresponding path program 1 times [2025-03-03 22:23:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:23:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437357967] [2025-03-03 22:23:58,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:23:58,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:23:58,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:23:58,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:58,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 22:23:58,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:23:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437357967] [2025-03-03 22:23:58,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437357967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:23:58,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527654383] [2025-03-03 22:23:58,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:58,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:23:58,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:23:58,398 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) [2025-03-03 22:23:58,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:23:58,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:23:58,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:23:58,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:58,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:58,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:23:58,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:23:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 22:23:58,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:23:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527654383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:23:58,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:23:58,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:23:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674298931] [2025-03-03 22:23:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:23:58,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:23:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:23:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:23:58,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:23:58,577 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:23:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:23:58,596 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-03 22:23:58,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:23:58,597 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-03-03 22:23:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:23:58,601 INFO L225 Difference]: With dead ends: 100 [2025-03-03 22:23:58,601 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 22:23:58,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:23:58,606 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:23:58,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:23:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 22:23:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 22:23:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:23:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-03 22:23:58,647 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2025-03-03 22:23:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:23:58,648 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-03 22:23:58,648 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:23:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-03 22:23:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:23:58,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:58,651 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:58,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:23:58,855 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 [2025-03-03 22:23:58,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:58,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1561092926, now seen corresponding path program 1 times [2025-03-03 22:23:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:23:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951675964] [2025-03-03 22:23:58,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:23:58,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:23:58,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:23:58,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:58,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 22:23:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:23:59,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951675964] [2025-03-03 22:23:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951675964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:23:59,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:23:59,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:23:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875639856] [2025-03-03 22:23:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:23:59,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:23:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:23:59,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:23:59,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:23:59,008 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:23:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:23:59,046 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2025-03-03 22:23:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:23:59,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-03-03 22:23:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:23:59,048 INFO L225 Difference]: With dead ends: 142 [2025-03-03 22:23:59,049 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 22:23:59,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:23:59,051 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:23:59,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:23:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 22:23:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 51. [2025-03-03 22:23:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:23:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-03-03 22:23:59,062 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 115 [2025-03-03 22:23:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:23:59,063 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-03-03 22:23:59,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 22:23:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-03-03 22:23:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:23:59,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:23:59,064 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:23:59,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:23:59,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:23:59,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:23:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1532463775, now seen corresponding path program 1 times [2025-03-03 22:23:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:23:59,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548151709] [2025-03-03 22:23:59,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:59,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:23:59,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:23:59,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:23:59,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:59,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 22:23:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:23:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548151709] [2025-03-03 22:23:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548151709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:23:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104664600] [2025-03-03 22:23:59,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:23:59,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:23:59,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:23:59,536 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) [2025-03-03 22:23:59,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:23:59,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:23:59,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:23:59,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:23:59,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:23:59,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:23:59,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:23:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-03 22:23:59,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:23:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 22:23:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104664600] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:23:59,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:23:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 22:23:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774511939] [2025-03-03 22:23:59,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:23:59,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:23:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:23:59,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:23:59,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:23:59,990 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:24:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:00,395 INFO L93 Difference]: Finished difference Result 214 states and 296 transitions. [2025-03-03 22:24:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 22:24:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2025-03-03 22:24:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:00,397 INFO L225 Difference]: With dead ends: 214 [2025-03-03 22:24:00,397 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 22:24:00,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-03-03 22:24:00,398 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 172 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:00,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 228 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:24:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 22:24:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2025-03-03 22:24:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:24:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-03-03 22:24:00,413 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 115 [2025-03-03 22:24:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-03-03 22:24:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:24:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-03-03 22:24:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:24:00,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:00,416 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:00,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:24:00,616 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,SelfDestructingSolverStorable2 [2025-03-03 22:24:00,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash -644960094, now seen corresponding path program 1 times [2025-03-03 22:24:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:24:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746969942] [2025-03-03 22:24:00,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:24:00,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:24:00,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:24:00,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:00,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:24:00,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:24:00,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:24:00,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:24:00,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:00,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:24:00,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:24:00,769 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:24:00,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:24:00,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:24:00,772 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 22:24:00,828 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:24:00,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:24:00 BoogieIcfgContainer [2025-03-03 22:24:00,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:24:00,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:24:00,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:24:00,832 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:24:00,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:23:58" (3/4) ... [2025-03-03 22:24:00,833 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:24:00,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:24:00,834 INFO L158 Benchmark]: Toolchain (without parser) took 3280.80ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 96.1MB in the end (delta: 8.8MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2025-03-03 22:24:00,834 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:00,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.13ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:24:00,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.66ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:24:00,836 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:00,836 INFO L158 Benchmark]: IcfgBuilder took 297.21ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 71.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:24:00,836 INFO L158 Benchmark]: TraceAbstraction took 2744.23ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 96.1MB in the end (delta: -25.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2025-03-03 22:24:00,836 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:24:00,837 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.13ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.66ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 297.21ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 71.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2744.23ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 96.1MB in the end (delta: -25.8MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory is still 96.1MB. 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 71, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] float var_1_4 = 255.1; [L24] float var_1_5 = -0.6; [L25] signed short int var_1_6 = -10; [L26] unsigned char var_1_8 = 1; [L27] signed char var_1_11 = -2; [L28] signed char var_1_12 = 10; [L29] signed char var_1_13 = 5; [L30] signed char var_1_14 = -1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 5; [L35] unsigned char var_1_19 = 64; [L36] unsigned char var_1_20 = 5; [L37] unsigned char last_1_var_1_18 = 5; VAL [isInitial=0, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L71] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L72] var_1_5 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L73] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L77] var_1_12 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L78] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L80] var_1_13 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L81] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L83] var_1_14 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L84] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L86] var_1_16 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L87] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L89] var_1_17 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L90] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L92] var_1_19 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_19 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L93] RET assume_abort_if_not(var_1_19 >= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L95] var_1_20 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L96] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L97] CALL assume_abort_if_not(var_1_20 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L97] RET assume_abort_if_not(var_1_20 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_0=-6, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L42] COND TRUE last_1_var_1_18 >= stepLocal_0 [L43] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L45] unsigned char stepLocal_1 = (var_1_1 * var_1_5) >= var_1_4; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_1=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L46] COND TRUE var_1_17 && stepLocal_1 [L47] var_1_18 = (2 + ((var_1_19 - var_1_20) + 32)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L51] COND FALSE !(\read(var_1_8)) [L54] var_1_15 = (! var_1_17) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L56] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L59] COND FALSE !(\read(var_1_15)) [L66] var_1_6 = var_1_11 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_18 >= (~ last_1_var_1_18)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_15 ? (var_1_15 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_15 ? (var_1_11 == ((signed char) ((var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))) + var_1_14))) : 1)) && (var_1_8 ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) (! var_1_17))))) && ((var_1_17 && ((var_1_1 * var_1_5) >= var_1_4)) ? (var_1_18 == ((unsigned char) (2 + ((var_1_19 - var_1_20) + 32)))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 201 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 154 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013 SizeOfPredicates, 2 NumberOfNonLiveVariables, 529 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 3584/3672 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:24:00,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_has-floats_file-35.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 aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:24:02,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:24:02,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:24:02,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:24:02,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:24:02,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:24:02,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:24:02,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:24:02,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:24:02,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:24:02,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:24:02,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:24:02,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:24:02,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:24:02,977 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:24:02,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:24:02,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:24:02,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:24:02,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:24:02,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:24:02,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:24:02,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:24:02,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:24:02,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:24:02,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:24:02,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:24:02,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:24:02,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:24:02,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:24:02,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 [2025-03-03 22:24:03,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:24:03,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:24:03,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:24:03,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:24:03,240 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:24:03,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-03-03 22:24:04,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd35fb24/a0d320fa191f47fb8fdabafc3e789ab3/FLAG401dc63b8 [2025-03-03 22:24:04,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:24:04,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-03-03 22:24:04,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd35fb24/a0d320fa191f47fb8fdabafc3e789ab3/FLAG401dc63b8 [2025-03-03 22:24:04,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd35fb24/a0d320fa191f47fb8fdabafc3e789ab3 [2025-03-03 22:24:04,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:24:04,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:24:04,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:24:04,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:24:04,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:24:04,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:24:04" (1/1) ... [2025-03-03 22:24:04,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9a839a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:04, skipping insertion in model container [2025-03-03 22:24:04,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:24:04" (1/1) ... [2025-03-03 22:24:04,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:24:05,061 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_has-floats_file-35.i[917,930] [2025-03-03 22:24:05,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:24:05,106 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:24:05,113 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_has-floats_file-35.i[917,930] [2025-03-03 22:24:05,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:24:05,140 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:24:05,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05 WrapperNode [2025-03-03 22:24:05,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:24:05,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:24:05,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:24:05,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:24:05,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,172 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-03 22:24:05,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:24:05,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:24:05,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:24:05,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:24:05,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,190 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]. [2025-03-03 22:24:05,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:24:05,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:24:05,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:24:05,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:24:05,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (1/1) ... [2025-03-03 22:24:05,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:24:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:24:05,231 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) [2025-03-03 22:24:05,232 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 [2025-03-03 22:24:05,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:24:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:24:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:24:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:24:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:24:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:24:05,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:24:05,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:24:06,024 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:24:06,025 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:24:06,032 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:24:06,033 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:24:06,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:24:06 BoogieIcfgContainer [2025-03-03 22:24:06,033 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:24:06,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:24:06,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:24:06,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:24:06,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:24:04" (1/3) ... [2025-03-03 22:24:06,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52670546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:24:06, skipping insertion in model container [2025-03-03 22:24:06,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:24:05" (2/3) ... [2025-03-03 22:24:06,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52670546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:24:06, skipping insertion in model container [2025-03-03 22:24:06,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:24:06" (3/3) ... [2025-03-03 22:24:06,040 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-35.i [2025-03-03 22:24:06,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:24:06,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-35.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:24:06,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:24:06,116 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;@22979d71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:24:06,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:24:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:24:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:24:06,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:06,126 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:06,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:06,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1946220228, now seen corresponding path program 1 times [2025-03-03 22:24:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:24:06,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816438678] [2025-03-03 22:24:06,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:06,137 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 [2025-03-03 22:24:06,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:24:06,139 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) [2025-03-03 22:24:06,140 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 [2025-03-03 22:24:06,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:24:06,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:24:06,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:06,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:06,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:24:06,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-03 22:24:06,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:24:06,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:24:06,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816438678] [2025-03-03 22:24:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816438678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:24:06,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:24:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:24:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786541074] [2025-03-03 22:24:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:24:06,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:24:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:24:06,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:24:06,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:24:06,423 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:24:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:06,445 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-03 22:24:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:24:06,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-03-03 22:24:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:06,452 INFO L225 Difference]: With dead ends: 100 [2025-03-03 22:24:06,452 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 22:24:06,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:24:06,458 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:06,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:24:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 22:24:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 22:24:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:24:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-03 22:24:06,492 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2025-03-03 22:24:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:06,494 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-03 22:24:06,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 22:24:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-03 22:24:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:24:06,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:06,497 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:06,506 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 [2025-03-03 22:24:06,697 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 [2025-03-03 22:24:06,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:06,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1561092926, now seen corresponding path program 1 times [2025-03-03 22:24:06,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:24:06,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468276096] [2025-03-03 22:24:06,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:06,699 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 [2025-03-03 22:24:06,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:24:06,701 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) [2025-03-03 22:24:06,702 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 [2025-03-03 22:24:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:24:06,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:24:06,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:06,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:24:06,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:24:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-03 22:24:07,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:24:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 22:24:07,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:24:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468276096] [2025-03-03 22:24:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468276096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:24:07,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:24:07,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 22:24:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955802852] [2025-03-03 22:24:07,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:24:07,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:24:07,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:24:07,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:24:07,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:24:07,363 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:24:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:24:08,463 INFO L93 Difference]: Finished difference Result 213 states and 300 transitions. [2025-03-03 22:24:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 22:24:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2025-03-03 22:24:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:24:08,467 INFO L225 Difference]: With dead ends: 213 [2025-03-03 22:24:08,468 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 22:24:08,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-03-03 22:24:08,470 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 160 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:24:08,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 185 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:24:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 22:24:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2025-03-03 22:24:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 22:24:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-03-03 22:24:08,483 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 115 [2025-03-03 22:24:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:24:08,485 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-03-03 22:24:08,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:24:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-03-03 22:24:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 22:24:08,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:24:08,486 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:24:08,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:24:08,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:24:08,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:24:08,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:24:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -644960094, now seen corresponding path program 1 times [2025-03-03 22:24:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:24:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135043580] [2025-03-03 22:24:08,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:24:08,688 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 [2025-03-03 22:24:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:24:08,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:24:08,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 22:24:08,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 22:24:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 22:24:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:24:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:24:08,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 22:24:08,909 INFO L279 TraceCheckSpWp]: Computing forward predicates...