./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.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-14.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 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:32:22,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:32:22,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:32:22,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:32:22,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:32:23,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:32:23,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:32:23,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:32:23,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:32:23,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:32:23,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:32:23,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:32:23,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:32:23,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:32:23,017 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:32:23,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:32:23,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:32:23,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:32:23,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:32:23,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:32:23,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:32:23,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:32:23,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:32:23,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:32:23,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:32:23,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:32:23,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:32:23,020 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 -> 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 [2025-03-08 13:32:23,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:32:23,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:32:23,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:32:23,233 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:32:23,233 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:32:23,234 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-14.i [2025-03-08 13:32:24,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c46bc140/443bf952e5e44757b39a4f58cd1a4142/FLAG0eb867458 [2025-03-08 13:32:24,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:32:24,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2025-03-08 13:32:24,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c46bc140/443bf952e5e44757b39a4f58cd1a4142/FLAG0eb867458 [2025-03-08 13:32:24,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c46bc140/443bf952e5e44757b39a4f58cd1a4142 [2025-03-08 13:32:24,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:32:24,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:32:24,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:32:24,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:32:24,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:32:24,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddd72be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24, skipping insertion in model container [2025-03-08 13:32:24,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:32:24,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i[917,930] [2025-03-08 13:32:24,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:32:24,776 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:32:24,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i[917,930] [2025-03-08 13:32:24,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:32:24,824 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:32:24,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24 WrapperNode [2025-03-08 13:32:24,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:32:24,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:32:24,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:32:24,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:32:24,831 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:32:24" (1/1) ... [2025-03-08 13:32:24,838 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:32:24" (1/1) ... [2025-03-08 13:32:24,870 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-08 13:32:24,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:32:24,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:32:24,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:32:24,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:32:24,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,890 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:32:24,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:32:24,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:32:24,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:32:24,900 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:32:24,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (1/1) ... [2025-03-08 13:32:24,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:32:24,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:32:24,924 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:32:24,929 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:32:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:32:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:32:24,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:32:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:32:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:32:24,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:32:24,994 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:32:24,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:32:25,234 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:32:25,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:32:25,241 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:32:25,242 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:32:25,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:32:25 BoogieIcfgContainer [2025-03-08 13:32:25,242 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:32:25,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:32:25,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:32:25,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:32:25,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:32:24" (1/3) ... [2025-03-08 13:32:25,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b41f7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:32:25, skipping insertion in model container [2025-03-08 13:32:25,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:24" (2/3) ... [2025-03-08 13:32:25,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b41f7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:32:25, skipping insertion in model container [2025-03-08 13:32:25,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:32:25" (3/3) ... [2025-03-08 13:32:25,249 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-14.i [2025-03-08 13:32:25,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:32:25,260 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-14.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:32:25,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:32:25,311 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;@60f725ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:32:25,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:32:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 13:32:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:25,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:25,324 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:25,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -563282028, now seen corresponding path program 1 times [2025-03-08 13:32:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:32:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4251136] [2025-03-08 13:32:25,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:32:25,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:25,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:25,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:25,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 13:32:25,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:32:25,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4251136] [2025-03-08 13:32:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4251136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:32:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080857828] [2025-03-08 13:32:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:25,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:32:25,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:32:25,545 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:32:25,547 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:32:25,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:25,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:25,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:25,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:25,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:32:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:32:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 13:32:25,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:32:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080857828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:32:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:32:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:32:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898312958] [2025-03-08 13:32:25,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:32:25,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:32:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:32:25,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:32:25,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:32:25,738 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 13:32:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:32:25,753 INFO L93 Difference]: Finished difference Result 108 states and 184 transitions. [2025-03-08 13:32:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:32:25,755 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-03-08 13:32:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:32:25,759 INFO L225 Difference]: With dead ends: 108 [2025-03-08 13:32:25,759 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 13:32:25,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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:32:25,762 INFO L435 NwaCegarLoop]: 79 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, 79 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:32:25,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:32:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 13:32:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 13:32:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 13:32:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2025-03-08 13:32:25,793 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 131 [2025-03-08 13:32:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:32:25,794 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2025-03-08 13:32:25,794 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 13:32:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2025-03-08 13:32:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:25,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:25,796 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:25,802 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:32:25,997 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:32:25,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:25,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash 311746803, now seen corresponding path program 1 times [2025-03-08 13:32:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:32:25,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326713140] [2025-03-08 13:32:25,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:32:26,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:26,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:26,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:26,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 13:32:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:32:26,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326713140] [2025-03-08 13:32:26,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326713140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:32:26,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:32:26,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:32:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854679391] [2025-03-08 13:32:26,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:32:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:32:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:32:26,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:32:26,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:32:26,416 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 13:32:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:32:26,571 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2025-03-08 13:32:26,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:32:26,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2025-03-08 13:32:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:32:26,573 INFO L225 Difference]: With dead ends: 160 [2025-03-08 13:32:26,573 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 13:32:26,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:32:26,576 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:32:26,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 221 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:32:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 13:32:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2025-03-08 13:32:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 13:32:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2025-03-08 13:32:26,605 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 131 [2025-03-08 13:32:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:32:26,606 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2025-03-08 13:32:26,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 13:32:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2025-03-08 13:32:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:26,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:26,608 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:26,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:32:26,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1495707660, now seen corresponding path program 1 times [2025-03-08 13:32:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:32:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863256148] [2025-03-08 13:32:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:32:26,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:26,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:26,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:26,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 13:32:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:32:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863256148] [2025-03-08 13:32:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863256148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:32:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385242044] [2025-03-08 13:32:26,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:26,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:32:26,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:32:26,997 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:32:26,999 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:32:27,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:27,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:27,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:27,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:27,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 13:32:27,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:32:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 13:32:27,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:32:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 13:32:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385242044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:32:27,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:32:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-08 13:32:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673135096] [2025-03-08 13:32:27,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:32:27,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:32:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:32:27,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:32:27,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:32:27,516 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 13:32:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:32:27,775 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2025-03-08 13:32:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:32:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 131 [2025-03-08 13:32:27,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:32:27,777 INFO L225 Difference]: With dead ends: 157 [2025-03-08 13:32:27,777 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 13:32:27,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-03-08 13:32:27,778 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:32:27,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 153 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:32:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 13:32:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-03-08 13:32:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 13:32:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-03-08 13:32:27,800 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 131 [2025-03-08 13:32:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:32:27,800 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-03-08 13:32:27,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 13:32:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-03-08 13:32:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:27,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:27,805 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:27,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 13:32:28,006 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:32:28,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1494784139, now seen corresponding path program 1 times [2025-03-08 13:32:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:32:28,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373689444] [2025-03-08 13:32:28,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:28,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:32:28,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:28,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:28,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:28,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:32:28,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:32:28,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:28,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:28,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:28,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:32:28,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:32:28,183 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:32:28,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:32:28,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:32:28,188 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 13:32:28,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:32:28,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:32:28 BoogieIcfgContainer [2025-03-08 13:32:28,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:32:28,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:32:28,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:32:28,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:32:28,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:32:25" (3/4) ... [2025-03-08 13:32:28,284 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:32:28,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:32:28,285 INFO L158 Benchmark]: Toolchain (without parser) took 3685.82ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.4MB in the beginning and 240.9MB in the end (delta: -134.5MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2025-03-08 13:32:28,285 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:32:28,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.26ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:32:28,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.86ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:32:28,287 INFO L158 Benchmark]: Boogie Preprocessor took 27.92ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 87.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:32:28,287 INFO L158 Benchmark]: IcfgBuilder took 342.67ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 69.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:32:28,288 INFO L158 Benchmark]: TraceAbstraction took 3035.80ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 69.5MB in the beginning and 240.9MB in the end (delta: -171.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:32:28,288 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 302.0MB. Free memory was 240.9MB in the beginning and 240.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:32:28,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.26ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.86ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.92ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 87.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 342.67ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 69.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3035.80ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 69.5MB in the beginning and 240.9MB in the end (delta: -171.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 302.0MB. Free memory was 240.9MB in the beginning and 240.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed short int var_1_5 = -64; [L26] signed short int var_1_6 = -64; [L27] signed short int var_1_7 = 10; [L28] signed short int var_1_8 = 8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] unsigned short int var_1_12 = 2; [L33] float var_1_13 = 32.25; [L34] float var_1_14 = 15.5; [L35] float var_1_15 = 256.25; [L36] double var_1_16 = 8.6; [L37] unsigned short int var_1_17 = 57581; [L38] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=10, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=10, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=10, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=10, var_1_8=8, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_short() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L89] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L91] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L92] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L93] var_1_15 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L94] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L96] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L97] var_1_17 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L98] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L99] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=-64, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L42] COND FALSE !(\read(last_1_var_1_9)) [L45] var_1_5 = ((var_1_7 + 16) - var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L47] COND FALSE !((var_1_13 / var_1_14) <= var_1_15) [L54] var_1_12 = var_1_8 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L56] COND FALSE !(((var_1_5 >= var_1_12) && var_1_2) && var_1_3) [L59] var_1_9 = (! (var_1_11 || var_1_10)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L61] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10=1, var_1_11=1, var_1_12=8, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L62] COND FALSE !(stepLocal_0 && var_1_9) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_9 && var_1_9) ? (var_1_1 == ((signed long int) var_1_5)) : 1) && (last_1_var_1_9 ? (var_1_5 == ((signed short int) var_1_6)) : (var_1_5 == ((signed short int) ((var_1_7 + 16) - var_1_8))))) && ((((var_1_5 >= var_1_12) && var_1_2) && var_1_3) ? (var_1_9 == ((unsigned char) (! var_1_10))) : (var_1_9 == ((unsigned char) (! (var_1_11 || var_1_10)))))) && (((var_1_13 / var_1_14) <= var_1_15) ? (((var_1_16 - 2.3) > var_1_14) ? (var_1_12 == ((unsigned short int) (var_1_17 - var_1_7))) : (var_1_12 == ((unsigned short int) ((((var_1_7) > (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))) ? (var_1_7) : (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))))))) : (var_1_12 == ((unsigned short int) var_1_8))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=0, var_1_5=8, var_1_6=8, var_1_7=0, var_1_8=8, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 453 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 204 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 780 ConstructedInterpolants, 0 QuantifiedInterpolants, 1416 SizeOfPredicates, 3 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4910/5040 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:32:28,307 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-14.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 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:32:30,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:32:30,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:32:30,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:32:30,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:32:30,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:32:30,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:32:30,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:32:30,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:32:30,222 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:32:30,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:32:30,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:32:30,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:32:30,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:32:30,224 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:32:30,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:32:30,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:32:30,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:32:30,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:32:30,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:32:30,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:32:30,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:32:30,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:32:30,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:32:30,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:32:30,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:32:30,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:32:30,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:32:30,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:32:30,227 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:32:30,227 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:32:30,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:32:30,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:32:30,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:32:30,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:32:30,227 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 -> 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 [2025-03-08 13:32:30,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:32:30,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:32:30,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:32:30,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:32:30,472 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:32:30,474 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-14.i [2025-03-08 13:32:31,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8599d52ba/dc17f585ff54459e9c6420d864a0fb17/FLAGf66a39864 [2025-03-08 13:32:31,638 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-08 13:32:31,783 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:32:31,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2025-03-08 13:32:31,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8599d52ba/dc17f585ff54459e9c6420d864a0fb17/FLAGf66a39864 [2025-03-08 13:32:31,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8599d52ba/dc17f585ff54459e9c6420d864a0fb17 [2025-03-08 13:32:31,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:32:31,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:32:31,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:32:31,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:32:31,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:32:31,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:32:31" (1/1) ... [2025-03-08 13:32:31,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f62344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:31, skipping insertion in model container [2025-03-08 13:32:31,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:32:31" (1/1) ... [2025-03-08 13:32:31,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:32:31,931 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-14.i[917,930] [2025-03-08 13:32:31,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:32:31,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:32:32,004 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-14.i[917,930] [2025-03-08 13:32:32,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:32:32,043 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:32:32,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32 WrapperNode [2025-03-08 13:32:32,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:32:32,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:32:32,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:32:32,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:32:32,050 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:32:32" (1/1) ... [2025-03-08 13:32:32,057 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:32:32" (1/1) ... [2025-03-08 13:32:32,072 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-08 13:32:32,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:32:32,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:32:32,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:32:32,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:32:32,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,091 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:32:32,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:32:32,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:32:32,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:32:32,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:32:32,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (1/1) ... [2025-03-08 13:32:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:32:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:32:32,130 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:32:32,135 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:32:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:32:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:32:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:32:32,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:32:32,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:32:32,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:32:32,215 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:32:32,217 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:32:35,629 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:32:35,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:32:35,637 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:32:35,637 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:32:35,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:32:35 BoogieIcfgContainer [2025-03-08 13:32:35,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:32:35,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:32:35,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:32:35,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:32:35,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:32:31" (1/3) ... [2025-03-08 13:32:35,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ae0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:32:35, skipping insertion in model container [2025-03-08 13:32:35,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:32:32" (2/3) ... [2025-03-08 13:32:35,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ae0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:32:35, skipping insertion in model container [2025-03-08 13:32:35,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:32:35" (3/3) ... [2025-03-08 13:32:35,644 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-14.i [2025-03-08 13:32:35,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:32:35,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-14.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:32:35,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:32:35,710 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;@4d633fc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:32:35,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:32:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 13:32:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:35,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:35,721 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:35,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:35,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -563282028, now seen corresponding path program 1 times [2025-03-08 13:32:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:32:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679395613] [2025-03-08 13:32:35,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:35,738 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:32:35,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:32:35,740 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:32:35,741 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:32:35,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:36,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:36,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:36,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:36,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:32:36,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:32:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-08 13:32:36,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:32:36,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:32:36,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679395613] [2025-03-08 13:32:36,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679395613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:32:36,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:32:36,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:32:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70125992] [2025-03-08 13:32:36,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:32:36,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:32:36,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:32:36,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:32:36,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:32:36,117 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 13:32:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:32:36,134 INFO L93 Difference]: Finished difference Result 108 states and 184 transitions. [2025-03-08 13:32:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:32:36,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2025-03-08 13:32:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:32:36,139 INFO L225 Difference]: With dead ends: 108 [2025-03-08 13:32:36,139 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 13:32:36,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:32:36,142 INFO L435 NwaCegarLoop]: 79 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, 79 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:32:36,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:32:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 13:32:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 13:32:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 13:32:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2025-03-08 13:32:36,173 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 131 [2025-03-08 13:32:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:32:36,173 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2025-03-08 13:32:36,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 13:32:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2025-03-08 13:32:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:36,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:36,175 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:36,184 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:32:36,376 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:32:36,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:36,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 311746803, now seen corresponding path program 1 times [2025-03-08 13:32:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:32:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070977546] [2025-03-08 13:32:36,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:36,378 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:32:36,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:32:36,380 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:32:36,381 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:32:36,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:36,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:36,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:36,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:36,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:32:36,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:32:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 13:32:37,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:32:37,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:32:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070977546] [2025-03-08 13:32:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070977546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:32:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:32:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:32:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888894267] [2025-03-08 13:32:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:32:37,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:32:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:32:37,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:32:37,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:32:37,451 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 13:32:39,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:32:40,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:32:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:32:40,902 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2025-03-08 13:32:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:32:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2025-03-08 13:32:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:32:40,930 INFO L225 Difference]: With dead ends: 160 [2025-03-08 13:32:40,930 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 13:32:40,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:32:40,931 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 46 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:32:40,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 221 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 13:32:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 13:32:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2025-03-08 13:32:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 13:32:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2025-03-08 13:32:40,951 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 131 [2025-03-08 13:32:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:32:40,951 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2025-03-08 13:32:40,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 13:32:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2025-03-08 13:32:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:40,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:40,953 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:40,964 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:32:41,153 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:32:41,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:41,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1495707660, now seen corresponding path program 1 times [2025-03-08 13:32:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:32:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158146406] [2025-03-08 13:32:41,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:41,155 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:32:41,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:32:41,158 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:32:41,159 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:32:41,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:41,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:41,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:41,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:41,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:32:41,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:32:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 13:32:41,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:32:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-08 13:32:42,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:32:42,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158146406] [2025-03-08 13:32:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158146406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:32:42,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:32:42,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 13:32:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147674722] [2025-03-08 13:32:42,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:32:42,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:32:42,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:32:42,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:32:42,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:32:42,368 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 13:32:44,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:32:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:32:44,666 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2025-03-08 13:32:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:32:44,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 131 [2025-03-08 13:32:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:32:44,696 INFO L225 Difference]: With dead ends: 157 [2025-03-08 13:32:44,697 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 13:32:44,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:32:44,698 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:32:44,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 104 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 13:32:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 13:32:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-03-08 13:32:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 13:32:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-03-08 13:32:44,713 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 131 [2025-03-08 13:32:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:32:44,714 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-03-08 13:32:44,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 13:32:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-03-08 13:32:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 13:32:44,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:32:44,715 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:44,728 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:32:44,916 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:32:44,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:32:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:32:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1494784139, now seen corresponding path program 1 times [2025-03-08 13:32:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:32:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190640463] [2025-03-08 13:32:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:32:44,917 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:32:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:32:44,919 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:32:44,920 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:32:44,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 13:32:45,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 13:32:45,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:32:45,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:32:45,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 13:32:45,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:33:18,875 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)