./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-3.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 a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:34:25,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:34:25,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:34:25,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:34:25,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:34:25,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:34:25,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:34:25,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:34:25,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:34:25,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:34:25,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:34:25,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:34:25,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:34:25,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:34:25,724 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:34:25,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:34:25,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:34:25,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:34:25,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:34:25,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:25,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:34:25,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:34:25,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:34:25,727 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 -> a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e [2025-03-08 13:34:25,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:34:25,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:34:25,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:34:25,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:34:25,955 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:34:25,956 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-3.i [2025-03-08 13:34:27,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f322629/69c6688bb5df4a1ba045916e4071c0e7/FLAGab431dd07 [2025-03-08 13:34:27,257 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:34:27,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i [2025-03-08 13:34:27,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f322629/69c6688bb5df4a1ba045916e4071c0e7/FLAGab431dd07 [2025-03-08 13:34:27,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f322629/69c6688bb5df4a1ba045916e4071c0e7 [2025-03-08 13:34:27,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:34:27,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:34:27,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:27,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:34:27,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:34:27,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745f2a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27, skipping insertion in model container [2025-03-08 13:34:27,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:34:27,718 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-3.i[916,929] [2025-03-08 13:34:27,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:27,759 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:34:27,767 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-3.i[916,929] [2025-03-08 13:34:27,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:27,803 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:34:27,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27 WrapperNode [2025-03-08 13:34:27,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:27,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:27,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:34:27,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:34:27,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,832 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-08 13:34:27,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:27,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:34:27,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:34:27,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:34:27,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,848 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-08 13:34:27,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:34:27,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:34:27,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:34:27,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:34:27,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (1/1) ... [2025-03-08 13:34:27,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:27,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:27,880 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-08 13:34:27,881 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-08 13:34:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:34:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:34:27,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:34:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:34:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:34:27,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:34:27,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:34:27,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:34:28,092 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:34:28,092 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:34:28,100 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:34:28,100 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:34:28,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:28 BoogieIcfgContainer [2025-03-08 13:34:28,101 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:34:28,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:34:28,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:34:28,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:34:28,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:34:27" (1/3) ... [2025-03-08 13:34:28,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432ee1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:28, skipping insertion in model container [2025-03-08 13:34:28,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:27" (2/3) ... [2025-03-08 13:34:28,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432ee1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:28, skipping insertion in model container [2025-03-08 13:34:28,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:28" (3/3) ... [2025-03-08 13:34:28,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-3.i [2025-03-08 13:34:28,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:34:28,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-3.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:34:28,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:34:28,168 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;@676eb4a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:34:28,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:34:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:34:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:28,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:28,180 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:28,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1341036285, now seen corresponding path program 1 times [2025-03-08 13:34:28,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:28,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212675857] [2025-03-08 13:34:28,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:28,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:28,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:28,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:28,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 13:34:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:34:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212675857] [2025-03-08 13:34:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212675857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:34:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688819330] [2025-03-08 13:34:28,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:28,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:34:28,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:28,378 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-08 13:34:28,379 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-08 13:34:28,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:28,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:28,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:28,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:28,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:34:28,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 13:34:28,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688819330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:28,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:34:28,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:34:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840468623] [2025-03-08 13:34:28,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:28,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:34:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:34:28,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:34:28,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:28,530 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:34:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:28,543 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-08 13:34:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:34:28,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-03-08 13:34:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:28,548 INFO L225 Difference]: With dead ends: 96 [2025-03-08 13:34:28,548 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 13:34:28,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-08 13:34:28,553 INFO L435 NwaCegarLoop]: 69 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, 69 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-08 13:34:28,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 13:34:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 13:34:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:34:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-08 13:34:28,576 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2025-03-08 13:34:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:28,576 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-08 13:34:28,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:34:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-08 13:34:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:28,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:28,579 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:28,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:34:28,781 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-08 13:34:28,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:28,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 940046983, now seen corresponding path program 1 times [2025-03-08 13:34:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306926154] [2025-03-08 13:34:28,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:28,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:28,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:28,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:28,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:34:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:34:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306926154] [2025-03-08 13:34:29,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306926154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:29,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:34:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:34:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924615325] [2025-03-08 13:34:29,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:29,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:34:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:34:29,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:34:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:34:29,040 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:34:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:29,073 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2025-03-08 13:34:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:34:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-03-08 13:34:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:29,076 INFO L225 Difference]: With dead ends: 138 [2025-03-08 13:34:29,076 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 13:34:29,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 13:34:29,078 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:29,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 13:34:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-08 13:34:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:34:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-08 13:34:29,088 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2025-03-08 13:34:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:29,088 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-08 13:34:29,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:34:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-08 13:34:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:29,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:29,089 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:29,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:34:29,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:29,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash 968676134, now seen corresponding path program 1 times [2025-03-08 13:34:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680156284] [2025-03-08 13:34:29,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:29,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:29,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:29,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:29,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:34:29,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:34:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680156284] [2025-03-08 13:34:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680156284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:34:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615860520] [2025-03-08 13:34:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:29,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:34:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:29,317 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-08 13:34:29,318 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-08 13:34:29,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:29,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:29,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:29,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 13:34:29,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-08 13:34:29,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:34:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:34:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615860520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:34:29,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:34:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 13:34:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792551848] [2025-03-08 13:34:29,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:34:29,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:34:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:34:29,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:34:29,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:34:29,797 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 13:34:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:29,936 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2025-03-08 13:34:29,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:34:29,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2025-03-08 13:34:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:29,938 INFO L225 Difference]: With dead ends: 193 [2025-03-08 13:34:29,938 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 13:34:29,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:34:29,939 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:29,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:34:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 13:34:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-03-08 13:34:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:34:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-03-08 13:34:29,954 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2025-03-08 13:34:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:29,957 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-03-08 13:34:29,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 13:34:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-03-08 13:34:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:29,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:29,958 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:29,965 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-08 13:34:30,162 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-08 13:34:30,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:30,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:30,163 INFO L85 PathProgramCache]: Analyzing trace with hash 969599655, now seen corresponding path program 1 times [2025-03-08 13:34:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:30,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870598827] [2025-03-08 13:34:30,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:30,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:30,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:30,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:30,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:34:30,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:34:30,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:30,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:30,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:30,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:34:30,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:34:30,285 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:34:30,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:34:30,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:34:30,291 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 13:34:30,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:34:30,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:34:30 BoogieIcfgContainer [2025-03-08 13:34:30,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:34:30,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:34:30,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:34:30,350 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:34:30,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:28" (3/4) ... [2025-03-08 13:34:30,352 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:34:30,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:34:30,354 INFO L158 Benchmark]: Toolchain (without parser) took 2742.95ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 75.5MB in the end (delta: 30.9MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2025-03-08 13:34:30,354 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:30,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.38ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:34:30,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.85ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:34:30,355 INFO L158 Benchmark]: Boogie Preprocessor took 22.43ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:30,355 INFO L158 Benchmark]: IcfgBuilder took 244.55ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 73.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:34:30,355 INFO L158 Benchmark]: TraceAbstraction took 2246.77ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 75.6MB in the end (delta: -2.6MB). Peak memory consumption was 457.1kB. Max. memory is 16.1GB. [2025-03-08 13:34:30,355 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 75.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:30,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.38ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.85ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.43ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 244.55ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 73.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2246.77ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 75.6MB in the end (delta: -2.6MB). Peak memory consumption was 457.1kB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 142.6MB. Free memory was 75.6MB in the beginning and 75.5MB in the end (delta: 37.0kB). 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 someUnaryDOUBLEoperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 15.75; [L33] double var_1_14 = -0.5; [L34] double var_1_15 = 5.25; [L35] double var_1_16 = 8.5; [L36] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L74] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L75] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L75] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L77] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L78] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L78] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L80] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L81] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L81] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L83] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L84] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L84] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L86] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L88] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L90] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L91] var_1_16 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L92] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L106] RET updateVariables() [L107] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L41] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L46] signed long int stepLocal_2 = var_1_7; [L47] signed long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, stepLocal_2=1073741822, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L48] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L55] COND FALSE !(! var_1_11) [L58] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L60] COND FALSE !(\read(var_1_4)) [L63] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_11) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_1 || (! var_1_5))))) : 1)) && (var_1_4 ? (var_1_12 == ((double) (((((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) < ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))))))) ? ((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) : ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16)))))))))) : (var_1_12 == ((double) var_1_15))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 183 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304 SizeOfPredicates, 1 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2724/2880 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-08 13:34:30,372 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-3.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 a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:34:32,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:34:32,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:34:32,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:34:32,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:34:32,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:34:32,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:34:32,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:34:32,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:34:32,259 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:34:32,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:34:32,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:34:32,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:34:32,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:34:32,259 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:34:32,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:34:32,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:34:32,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:34:32,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:34:32,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:34:32,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:34:32,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:34:32,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:34:32,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:32,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:34:32,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:34:32,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:34:32,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:34:32,263 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 -> a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e [2025-03-08 13:34:32,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:34:32,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:34:32,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:34:32,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:34:32,528 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:34:32,529 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-3.i [2025-03-08 13:34:33,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171a735a7/21a1bd1481aa4fe7903ad4bb0430a0ba/FLAG47afd1e07 [2025-03-08 13:34:33,855 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:34:33,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i [2025-03-08 13:34:33,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171a735a7/21a1bd1481aa4fe7903ad4bb0430a0ba/FLAG47afd1e07 [2025-03-08 13:34:34,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171a735a7/21a1bd1481aa4fe7903ad4bb0430a0ba [2025-03-08 13:34:34,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:34:34,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:34:34,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:34,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:34:34,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:34:34,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38de72cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34, skipping insertion in model container [2025-03-08 13:34:34,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:34:34,341 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-3.i[916,929] [2025-03-08 13:34:34,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:34,399 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:34:34,407 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-3.i[916,929] [2025-03-08 13:34:34,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:34,450 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:34:34,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34 WrapperNode [2025-03-08 13:34:34,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:34,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:34,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:34:34,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:34:34,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,484 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-08 13:34:34,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:34,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:34:34,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:34:34,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:34:34,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,508 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-08 13:34:34,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:34:34,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:34:34,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:34:34,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:34:34,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (1/1) ... [2025-03-08 13:34:34,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:34,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:34,551 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-08 13:34:34,557 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-08 13:34:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:34:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:34:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:34:34,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:34:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:34:34,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:34:34,639 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:34:34,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:34:35,072 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:34:35,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:34:35,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:34:35,085 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:34:35,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:35 BoogieIcfgContainer [2025-03-08 13:34:35,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:34:35,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:34:35,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:34:35,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:34:35,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:34:34" (1/3) ... [2025-03-08 13:34:35,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c311c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:35, skipping insertion in model container [2025-03-08 13:34:35,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:34" (2/3) ... [2025-03-08 13:34:35,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c311c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:35, skipping insertion in model container [2025-03-08 13:34:35,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:35" (3/3) ... [2025-03-08 13:34:35,094 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-3.i [2025-03-08 13:34:35,104 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:34:35,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-3.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:34:35,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:34:35,155 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;@16099cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:34:35,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:34:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:34:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:35,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:35,169 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:35,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1341036285, now seen corresponding path program 1 times [2025-03-08 13:34:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437941967] [2025-03-08 13:34:35,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:35,187 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-08 13:34:35,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:35,190 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-08 13:34:35,191 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-08 13:34:35,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:35,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:35,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:34:35,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 13:34:35,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:35,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437941967] [2025-03-08 13:34:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437941967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:35,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:34:35,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:34:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171257837] [2025-03-08 13:34:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:35,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:34:35,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:35,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:34:35,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:35,456 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:34:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:35,484 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-08 13:34:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:34:35,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-03-08 13:34:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:35,490 INFO L225 Difference]: With dead ends: 96 [2025-03-08 13:34:35,490 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 13:34:35,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-08 13:34:35,494 INFO L435 NwaCegarLoop]: 69 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, 69 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-08 13:34:35,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 13:34:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 13:34:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:34:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-08 13:34:35,532 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2025-03-08 13:34:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:35,533 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-08 13:34:35,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:34:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-08 13:34:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:35,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:35,535 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:35,542 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-08 13:34:35,736 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-08 13:34:35,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:35,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash 940046983, now seen corresponding path program 1 times [2025-03-08 13:34:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234271787] [2025-03-08 13:34:35,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:35,737 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-08 13:34:35,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:35,739 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-08 13:34:35,740 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-08 13:34:35,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:35,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:35,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:35,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 13:34:35,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:34:36,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:36,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:36,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234271787] [2025-03-08 13:34:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234271787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:36,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:34:36,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:34:36,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78541762] [2025-03-08 13:34:36,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:36,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:34:36,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:36,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:34:36,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:34:36,130 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:34:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:36,348 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2025-03-08 13:34:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:34:36,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-03-08 13:34:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:36,351 INFO L225 Difference]: With dead ends: 138 [2025-03-08 13:34:36,351 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 13:34:36,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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-08 13:34:36,352 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:36,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:34:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 13:34:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-08 13:34:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:34:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-08 13:34:36,364 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2025-03-08 13:34:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:36,364 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-08 13:34:36,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:34:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-08 13:34:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:36,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:36,365 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:36,371 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-08 13:34:36,566 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-08 13:34:36,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:36,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash 968676134, now seen corresponding path program 1 times [2025-03-08 13:34:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772431805] [2025-03-08 13:34:36,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:36,567 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-08 13:34:36,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:36,569 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-08 13:34:36,570 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-08 13:34:36,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:36,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:36,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:36,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:36,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 13:34:36,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-08 13:34:36,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:34:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:34:37,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772431805] [2025-03-08 13:34:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772431805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:34:37,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:34:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 13:34:37,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661185434] [2025-03-08 13:34:37,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:34:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:34:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:37,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:34:37,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:34:37,057 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 13:34:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:37,541 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2025-03-08 13:34:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:34:37,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2025-03-08 13:34:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:37,551 INFO L225 Difference]: With dead ends: 193 [2025-03-08 13:34:37,552 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 13:34:37,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:34:37,553 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:37,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:34:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 13:34:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-03-08 13:34:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:34:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-03-08 13:34:37,565 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2025-03-08 13:34:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:37,565 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-03-08 13:34:37,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 13:34:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-03-08 13:34:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 13:34:37,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:37,567 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:34:37,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 13:34:37,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:37,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:37,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 969599655, now seen corresponding path program 1 times [2025-03-08 13:34:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:37,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819311657] [2025-03-08 13:34:37,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:37,768 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-08 13:34:37,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:37,770 INFO L229 MonitoredProcess]: Starting monitored process 5 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-08 13:34:37,772 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 (5)] Waiting until timeout for monitored process [2025-03-08 13:34:37,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 13:34:37,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 13:34:37,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:37,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:37,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 13:34:37,919 INFO L279 TraceCheckSpWp]: Computing forward predicates...