./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:33:30,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:33:30,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:33:30,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:33:30,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:33:30,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:33:30,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:33:30,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:33:30,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:33:30,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:33:30,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:33:30,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:33:30,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:33:30,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:33:30,090 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:33:30,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:33:30,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:33:30,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:33:30,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:33:30,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:33:30,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:33:30,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:33:30,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:33:30,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:33:30,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:33:30,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:33:30,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:33:30,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:33:30,094 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-jdk21/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 -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2025-01-09 12:33:30,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:33:30,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:33:30,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:33:30,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:33:30,427 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:33:30,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-01-09 12:33:31,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6816fdfc/9b9ad1be49de47d09e541753315796f1/FLAGa89055178 [2025-01-09 12:33:31,979 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:33:31,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-01-09 12:33:31,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6816fdfc/9b9ad1be49de47d09e541753315796f1/FLAGa89055178 [2025-01-09 12:33:32,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6816fdfc/9b9ad1be49de47d09e541753315796f1 [2025-01-09 12:33:32,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:33:32,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:33:32,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:33:32,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:33:32,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:33:32,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290ba614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32, skipping insertion in model container [2025-01-09 12:33:32,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:33:32,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-01-09 12:33:32,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:33:32,525 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:33:32,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-01-09 12:33:32,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:33:32,572 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:33:32,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32 WrapperNode [2025-01-09 12:33:32,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:33:32,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:33:32,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:33:32,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:33:32,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,618 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-01-09 12:33:32,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:33:32,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:33:32,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:33:32,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:33:32,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,651 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-01-09 12:33:32,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:33:32,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:33:32,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:33:32,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:33:32,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (1/1) ... [2025-01-09 12:33:32,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:33:32,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:33:32,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:33:32,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:33:32,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:33:32,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:33:32,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:33:32,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:33:32,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:33:32,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:33:32,803 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:33:32,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:33:32,997 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:33:32,998 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:33:33,006 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:33:33,006 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:33:33,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:33:33 BoogieIcfgContainer [2025-01-09 12:33:33,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:33:33,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:33:33,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:33:33,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:33:33,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:33:32" (1/3) ... [2025-01-09 12:33:33,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b42ede9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:33:33, skipping insertion in model container [2025-01-09 12:33:33,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:32" (2/3) ... [2025-01-09 12:33:33,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b42ede9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:33:33, skipping insertion in model container [2025-01-09 12:33:33,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:33:33" (3/3) ... [2025-01-09 12:33:33,017 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2025-01-09 12:33:33,030 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:33:33,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-68.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:33:33,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:33:33,100 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;@5c8aa6c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:33:33,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:33:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:33:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:33,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:33,113 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:33,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:33,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash 635824422, now seen corresponding path program 1 times [2025-01-09 12:33:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:33:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914936019] [2025-01-09 12:33:33,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:33:33,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:33,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:33,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:33,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 12:33:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:33:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914936019] [2025-01-09 12:33:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914936019] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:33:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721187360] [2025-01-09 12:33:33,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:33,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:33:33,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:33:33,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:33:33,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:33:33,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:33,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:33,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:33,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:33:33,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:33:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 12:33:33,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:33:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721187360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:33:33,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:33:33,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:33:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882123479] [2025-01-09 12:33:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:33:33,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:33:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:33:33,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:33:33,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:33:33,629 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:33:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:33:33,655 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-01-09 12:33:33,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:33:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-01-09 12:33:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:33:33,663 INFO L225 Difference]: With dead ends: 100 [2025-01-09 12:33:33,663 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 12:33:33,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-01-09 12:33:33,671 INFO L435 NwaCegarLoop]: 72 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, 72 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-01-09 12:33:33,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:33:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 12:33:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 12:33:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:33:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-01-09 12:33:33,712 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2025-01-09 12:33:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:33:33,713 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-01-09 12:33:33,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:33:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-01-09 12:33:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:33,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:33,717 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:33,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:33:33,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:33:33,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2053943512, now seen corresponding path program 1 times [2025-01-09 12:33:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:33:33,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300938432] [2025-01-09 12:33:33,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:33:33,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:34,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:34,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:33:34,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:33:34,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300938432] [2025-01-09 12:33:34,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300938432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:33:34,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:33:34,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:33:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167851565] [2025-01-09 12:33:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:33:34,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:33:34,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:33:34,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:33:34,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:34,238 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:33:34,267 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2025-01-09 12:33:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:33:34,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:33:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:33:34,271 INFO L225 Difference]: With dead ends: 97 [2025-01-09 12:33:34,271 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 12:33:34,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:34,272 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:33:34,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:33:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 12:33:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 12:33:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:33:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-01-09 12:33:34,285 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 110 [2025-01-09 12:33:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:33:34,286 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-01-09 12:33:34,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-01-09 12:33:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:34,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:34,292 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:33:34,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1431677158, now seen corresponding path program 1 times [2025-01-09 12:33:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:33:34,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109169473] [2025-01-09 12:33:34,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:33:34,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:34,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:34,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:34,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:33:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:33:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109169473] [2025-01-09 12:33:34,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109169473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:33:34,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:33:34,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:33:34,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131203129] [2025-01-09 12:33:34,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:33:34,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:33:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:33:34,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:33:34,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:34,444 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:33:34,493 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2025-01-09 12:33:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:33:34,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:33:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:33:34,498 INFO L225 Difference]: With dead ends: 123 [2025-01-09 12:33:34,498 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 12:33:34,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:34,499 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:33:34,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:33:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 12:33:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-01-09 12:33:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:33:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-01-09 12:33:34,518 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 110 [2025-01-09 12:33:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:33:34,519 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-01-09 12:33:34,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-01-09 12:33:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:34,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:34,520 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:33:34,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:34,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1433524200, now seen corresponding path program 1 times [2025-01-09 12:33:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:33:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382912965] [2025-01-09 12:33:34,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:33:34,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:34,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:34,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:34,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:33:34,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126329064] [2025-01-09 12:33:34,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:34,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:33:34,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:33:34,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:33:34,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:33:34,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:34,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:34,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:34,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:33:34,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:33:34,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:34,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:34,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:34,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:33:34,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:33:34,957 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:33:34,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:33:34,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:33:35,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:33:35,162 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 12:33:35,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:33:35,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:33:35 BoogieIcfgContainer [2025-01-09 12:33:35,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:33:35,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:33:35,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:33:35,258 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:33:35,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:33:33" (3/4) ... [2025-01-09 12:33:35,261 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:33:35,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:33:35,263 INFO L158 Benchmark]: Toolchain (without parser) took 2959.04ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 96.2MB in the end (delta: 57.7MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2025-01-09 12:33:35,263 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:33:35,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.97ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 141.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:33:35,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.35ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 139.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:33:35,265 INFO L158 Benchmark]: Boogie Preprocessor took 50.27ms. Allocated memory is still 201.3MB. Free memory was 139.1MB in the beginning and 137.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:33:35,266 INFO L158 Benchmark]: RCFGBuilder took 337.12ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 121.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:33:35,266 INFO L158 Benchmark]: TraceAbstraction took 2248.01ms. Allocated memory is still 201.3MB. Free memory was 120.9MB in the beginning and 96.3MB in the end (delta: 24.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2025-01-09 12:33:35,266 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 201.3MB. Free memory was 96.3MB in the beginning and 96.2MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:33:35,268 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.25ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.97ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 141.1MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.35ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 139.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.27ms. Allocated memory is still 201.3MB. Free memory was 139.1MB in the beginning and 137.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.12ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 121.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2248.01ms. Allocated memory is still 201.3MB. Free memory was 120.9MB in the beginning and 96.3MB in the end (delta: 24.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 201.3MB. Free memory was 96.3MB in the beginning and 96.2MB in the end (delta: 39.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 77, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] unsigned char var_1_9 = 0; [L27] double var_1_10 = 25.5; [L28] double var_1_11 = 999999999.729; [L29] double var_1_12 = 999.8; [L30] signed short int var_1_13 = -25; [L31] signed short int var_1_14 = -64; [L32] signed short int var_1_15 = 0; [L33] signed short int var_1_16 = -8; [L34] signed long int var_1_17 = 5; [L35] unsigned long int var_1_18 = 0; [L36] unsigned long int var_1_19 = 8; [L37] float var_1_20 = 32.375; [L38] signed long int var_1_21 = -10; [L39] signed short int last_1_var_1_13 = -25; [L40] signed long int last_1_var_1_17 = 5; VAL [isInitial=0, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=0] [L111] isInitial = 1 [L112] FCALL initially() [L114] CALL updateLastVariables() [L103] last_1_var_1_13 = var_1_13 [L104] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L74] var_1_2 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L75] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L76] var_1_3 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L77] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L78] var_1_8 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_14 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 8192) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L92] var_1_15 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_15 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 <= 8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_16 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L96] RET assume_abort_if_not(var_1_16 >= -16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L97] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L98] var_1_19 = __VERIFIER_nondet_ulong() [L99] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L99] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L100] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L115] RET updateVariables() [L116] CALL step() [L44] signed long int stepLocal_2 = var_1_8 + last_1_var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=7, var_1_10=51/2, var_1_13=-25, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L45] COND FALSE !(\read(var_1_9)) [L52] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=7, var_1_10=51/2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=2, var_1_9=0] [L54] var_1_17 = (var_1_13 + var_1_14) [L55] var_1_18 = var_1_19 [L56] var_1_20 = var_1_12 [L57] var_1_21 = var_1_17 [L58] signed long int stepLocal_1 = var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_1=1, stepLocal_2=7, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] [L59] COND FALSE !(stepLocal_1 != var_1_21) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=7, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] [L62] unsigned long int stepLocal_0 = var_1_18 + var_1_21; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=7, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] [L63] COND FALSE !((var_1_2 - var_1_3) >= var_1_10) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=7, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] [L68] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=7, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((((((var_1_2 - var_1_3) >= var_1_10) ? (((var_1_18 + var_1_21) >= (var_1_13 / var_1_8)) ? (var_1_1 == ((signed long int) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : 1) : (var_1_9 ? (var_1_1 == ((signed long int) ((((var_1_21) > (var_1_18)) ? (var_1_21) : (var_1_18))))) : 1)) && ((var_1_17 != var_1_21) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1)) && (var_1_9 ? ((last_1_var_1_13 <= (var_1_8 + last_1_var_1_17)) ? (var_1_13 == ((signed short int) ((var_1_14 + var_1_15) + var_1_16))) : (var_1_13 == ((signed short int) var_1_15))) : (var_1_13 == ((signed short int) var_1_15)))) && (var_1_17 == ((signed long int) (var_1_13 + var_1_14)))) && (var_1_18 == ((unsigned long int) var_1_19))) && (var_1_20 == ((float) var_1_12))) && (var_1_21 == ((signed long int) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 211 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 660 NumberOfCodeBlocks, 660 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 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-01-09 12:33:35,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:33:37,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:33:37,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:33:37,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:33:37,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:33:37,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:33:37,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:33:37,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:33:37,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:33:37,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:33:37,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:33:37,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:33:37,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:33:37,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:33:37,674 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:33:37,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:33:37,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:33:37,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:33:37,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:33:37,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:33:37,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:33:37,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:33:37,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:33:37,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:33:37,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:33:37,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:33:37,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:33:37,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:33:37,679 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:33:37,679 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:33:37,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:33:37,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:33:37,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:33:37,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:33:37,679 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-jdk21/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 -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2025-01-09 12:33:37,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:33:38,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:33:38,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:33:38,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:33:38,007 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:33:38,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-01-09 12:33:39,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fa428392/ca2c6d387c0a4a4f834bd677137fd4fb/FLAGc6584410a [2025-01-09 12:33:39,703 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:33:39,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-01-09 12:33:39,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fa428392/ca2c6d387c0a4a4f834bd677137fd4fb/FLAGc6584410a [2025-01-09 12:33:40,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fa428392/ca2c6d387c0a4a4f834bd677137fd4fb [2025-01-09 12:33:40,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:33:40,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:33:40,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:33:40,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:33:40,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:33:40,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c2f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40, skipping insertion in model container [2025-01-09 12:33:40,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:33:40,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-01-09 12:33:40,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:33:40,245 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:33:40,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-01-09 12:33:40,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:33:40,297 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:33:40,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40 WrapperNode [2025-01-09 12:33:40,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:33:40,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:33:40,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:33:40,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:33:40,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,345 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-01-09 12:33:40,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:33:40,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:33:40,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:33:40,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:33:40,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,376 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-01-09 12:33:40,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:33:40,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:33:40,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:33:40,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:33:40,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (1/1) ... [2025-01-09 12:33:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:33:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:33:40,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:33:40,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:33:40,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:33:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:33:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:33:40,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:33:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:33:40,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:33:40,535 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:33:40,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:33:42,844 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:33:42,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:33:42,856 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:33:42,856 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:33:42,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:33:42 BoogieIcfgContainer [2025-01-09 12:33:42,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:33:42,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:33:42,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:33:42,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:33:42,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:33:40" (1/3) ... [2025-01-09 12:33:42,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb81c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:33:42, skipping insertion in model container [2025-01-09 12:33:42,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:33:40" (2/3) ... [2025-01-09 12:33:42,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb81c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:33:42, skipping insertion in model container [2025-01-09 12:33:42,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:33:42" (3/3) ... [2025-01-09 12:33:42,868 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2025-01-09 12:33:42,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:33:42,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-68.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:33:42,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:33:42,940 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;@f449cb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:33:42,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:33:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:33:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:42,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:42,950 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:42,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash 635824422, now seen corresponding path program 1 times [2025-01-09 12:33:42,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:33:42,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486067601] [2025-01-09 12:33:42,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:42,963 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-01-09 12:33:42,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:33:42,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 12:33:42,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:33:43,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:43,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:43,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:43,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:43,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:33:43,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:33:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-01-09 12:33:43,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:33:43,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:33:43,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486067601] [2025-01-09 12:33:43,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486067601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:33:43,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:33:43,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:33:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821163027] [2025-01-09 12:33:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:33:43,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:33:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:33:43,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:33:43,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:33:43,350 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:33:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:33:43,398 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-01-09 12:33:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:33:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-01-09 12:33:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:33:43,406 INFO L225 Difference]: With dead ends: 100 [2025-01-09 12:33:43,406 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 12:33:43,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-01-09 12:33:43,411 INFO L435 NwaCegarLoop]: 72 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, 72 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-01-09 12:33:43,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:33:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 12:33:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 12:33:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:33:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-01-09 12:33:43,443 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2025-01-09 12:33:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:33:43,443 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-01-09 12:33:43,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 12:33:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-01-09 12:33:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:43,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:43,446 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:43,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:33:43,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 12:33:43,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:43,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2053943512, now seen corresponding path program 1 times [2025-01-09 12:33:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:33:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176772751] [2025-01-09 12:33:43,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:43,649 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-01-09 12:33:43,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:33:43,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 12:33:43,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:33:43,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:43,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:43,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:43,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:43,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:33:43,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:33:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:33:43,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:33:43,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:33:43,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176772751] [2025-01-09 12:33:43,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176772751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:33:43,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:33:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:33:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541169614] [2025-01-09 12:33:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:33:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:33:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:33:43,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:33:43,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:43,997 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:46,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:33:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:33:46,523 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2025-01-09 12:33:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:33:46,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:33:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:33:46,560 INFO L225 Difference]: With dead ends: 97 [2025-01-09 12:33:46,560 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 12:33:46,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:46,561 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:33:46,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 12:33:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 12:33:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 12:33:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:33:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-01-09 12:33:46,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 110 [2025-01-09 12:33:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:33:46,569 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-01-09 12:33:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-01-09 12:33:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:46,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:46,571 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:46,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:33:46,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 12:33:46,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1431677158, now seen corresponding path program 1 times [2025-01-09 12:33:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:33:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270400174] [2025-01-09 12:33:46,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:46,773 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-01-09 12:33:46,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:33:46,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 12:33:46,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:33:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:47,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:47,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:47,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:33:47,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:33:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 12:33:47,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:33:47,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:33:47,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270400174] [2025-01-09 12:33:47,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270400174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:33:47,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:33:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:33:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278972949] [2025-01-09 12:33:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:33:47,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:33:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:33:47,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:33:47,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:47,129 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:49,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:33:51,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:33:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:33:51,341 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2025-01-09 12:33:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:33:51,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-01-09 12:33:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:33:51,371 INFO L225 Difference]: With dead ends: 123 [2025-01-09 12:33:51,371 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 12:33:51,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:33:51,372 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:33:51,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 129 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 12:33:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 12:33:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-01-09 12:33:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:33:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-01-09 12:33:51,395 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 110 [2025-01-09 12:33:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:33:51,395 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-01-09 12:33:51,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 12:33:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-01-09 12:33:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 12:33:51,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:33:51,397 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:33:51,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:33:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 12:33:51,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:33:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:33:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1433524200, now seen corresponding path program 1 times [2025-01-09 12:33:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:33:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567953624] [2025-01-09 12:33:51,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:33:51,599 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-01-09 12:33:51,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:33:51,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 12:33:51,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 12:33:51,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 12:33:51,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 12:33:51,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:33:51,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:33:51,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 12:33:51,902 INFO L279 TraceCheckSpWp]: Computing forward predicates...