./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23f93c4b5aa5d0c1614210c7d43e5185eef5f35d440841695b085d9e491cf0d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:43:34,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:43:34,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:43:34,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:43:34,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:43:34,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:43:34,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:43:34,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:43:34,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:43:34,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:43:34,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:43:34,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:43:34,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:43:34,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:43:34,408 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:43:34,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:43:34,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:43:34,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:43:34,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:43:34,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:43:34,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:43:34,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:43:34,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:43:34,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:34,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:43:34,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23f93c4b5aa5d0c1614210c7d43e5185eef5f35d440841695b085d9e491cf0d2 [2025-03-17 02:43:34,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:43:34,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:43:34,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:43:34,624 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:43:34,625 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:43:34,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i [2025-03-17 02:43:35,796 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252bdf71f/19c915b09e324980804026fa5d11a98b/FLAGf100d9220 [2025-03-17 02:43:36,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:43:36,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i [2025-03-17 02:43:36,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252bdf71f/19c915b09e324980804026fa5d11a98b/FLAGf100d9220 [2025-03-17 02:43:36,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/252bdf71f/19c915b09e324980804026fa5d11a98b [2025-03-17 02:43:36,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:43:36,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:43:36,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:36,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:43:36,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:43:36,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36, skipping insertion in model container [2025-03-17 02:43:36,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:43:36,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i[917,930] [2025-03-17 02:43:36,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:36,533 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:43:36,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i[917,930] [2025-03-17 02:43:36,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:36,583 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:43:36,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36 WrapperNode [2025-03-17 02:43:36,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:36,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:36,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:43:36,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:43:36,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,627 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-03-17 02:43:36,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:36,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:43:36,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:43:36,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:43:36,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:43:36,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:43:36,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:43:36,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:43:36,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:43:36,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (1/1) ... [2025-03-17 02:43:36,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:43:36,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:43:36,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:43:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:43:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:43:36,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:43:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:43:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:43:36,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:43:36,761 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:43:36,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:43:36,897 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:43:36,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:43:36,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:43:36,906 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:43:36,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:36 BoogieIcfgContainer [2025-03-17 02:43:36,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:43:36,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:43:36,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:43:36,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:43:36,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:43:36" (1/3) ... [2025-03-17 02:43:36,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1368d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:36, skipping insertion in model container [2025-03-17 02:43:36,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:36" (2/3) ... [2025-03-17 02:43:36,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1368d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:36, skipping insertion in model container [2025-03-17 02:43:36,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:36" (3/3) ... [2025-03-17 02:43:36,912 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-42.i [2025-03-17 02:43:36,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:43:36,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-42.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:43:36,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:43:36,971 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;@13395498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:43:36,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:43:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 02:43:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 02:43:36,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:36,981 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:36,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:36,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash -662800007, now seen corresponding path program 1 times [2025-03-17 02:43:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:43:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272765979] [2025-03-17 02:43:36,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:43:37,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:43:37,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:43:37,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:37,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 02:43:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:43:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272765979] [2025-03-17 02:43:37,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272765979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:43:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078618173] [2025-03-17 02:43:37,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:37,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:43:37,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:43:37,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:43:37,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:43:37,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:43:37,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:43:37,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:37,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:37,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:43:37,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:43:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 02:43:37,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:43:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078618173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:43:37,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:43:37,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:43:37,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546009351] [2025-03-17 02:43:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:43:37,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:43:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:43:37,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:43:37,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:37,305 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 02:43:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:43:37,317 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2025-03-17 02:43:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:43:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 70 [2025-03-17 02:43:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:43:37,322 INFO L225 Difference]: With dead ends: 67 [2025-03-17 02:43:37,322 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 02:43:37,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:37,328 INFO L435 NwaCegarLoop]: 46 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, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:43:37,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:43:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 02:43:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 02:43:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 02:43:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2025-03-17 02:43:37,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 70 [2025-03-17 02:43:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:43:37,354 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-03-17 02:43:37,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 02:43:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2025-03-17 02:43:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 02:43:37,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:37,356 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:37,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:43:37,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:43:37,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:37,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -26890406, now seen corresponding path program 1 times [2025-03-17 02:43:37,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:43:37,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384393050] [2025-03-17 02:43:37,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:43:37,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:43:37,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:43:37,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:37,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:43:37,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:43:37,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:43:37,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:43:37,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:37,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:43:37,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:43:37,737 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:43:37,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:43:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:43:37,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 02:43:37,780 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:43:37,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:43:37 BoogieIcfgContainer [2025-03-17 02:43:37,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:43:37,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:43:37,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:43:37,786 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:43:37,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:36" (3/4) ... [2025-03-17 02:43:37,788 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:43:37,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:43:37,789 INFO L158 Benchmark]: Toolchain (without parser) took 1418.84ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 45.9MB in the end (delta: 84.2MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-17 02:43:37,789 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 126.0MB in the beginning and 125.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:43:37,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.26ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 117.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:43:37,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.66ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:43:37,790 INFO L158 Benchmark]: Boogie Preprocessor took 40.94ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 112.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:43:37,790 INFO L158 Benchmark]: IcfgBuilder took 233.50ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 96.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:43:37,790 INFO L158 Benchmark]: TraceAbstraction took 878.00ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 46.4MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 02:43:37,793 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 45.9MB in the end (delta: 457.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:43:37,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 126.0MB in the beginning and 125.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.26ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 117.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.66ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.94ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 112.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 233.50ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 96.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 878.00ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 46.4MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 45.9MB in the end (delta: 457.2kB). 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 54, overapproximation of someBinaryFLOATComparisonOperation at line 37, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -1; [L23] unsigned char var_1_8 = 5; [L24] unsigned char var_1_9 = 4; [L25] float var_1_10 = 16.5; [L26] float var_1_11 = 127.25; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 0; [L29] unsigned char var_1_15 = 0; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L63] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L63] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L64] var_1_11 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L65] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L66] var_1_13 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L67] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L69] var_1_15 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L70] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L72] var_1_16 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L75] var_1_18 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L76] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_8 = (var_1_9 + 100) [L37] var_1_10 = ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=227, var_1_9=127] [L38] COND FALSE !(var_1_8 > var_1_8) [L41] var_1_1 = (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8)))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L43] COND TRUE var_1_11 <= var_1_10 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L44] COND TRUE var_1_1 != var_1_8 [L45] var_1_17 = var_1_18 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L54] COND TRUE (- var_1_10) > var_1_11 [L55] var_1_12 = (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return (((((var_1_8 > var_1_8) ? (var_1_1 == ((signed long int) (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) - 10))) : (var_1_1 == ((signed long int) (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8))))))) && (var_1_8 == ((unsigned char) (var_1_9 + 100)))) && (var_1_10 == ((float) ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f)))))) && (((- var_1_10) > var_1_11) ? (var_1_12 == ((unsigned char) (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))))) : (var_1_12 == ((unsigned char) ((var_1_1 <= var_1_9) && var_1_16))))) && ((var_1_11 <= var_1_10) ? ((var_1_1 != var_1_8) ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : ((var_1_8 <= 1000000) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0)))) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 63 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 46 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:43:37,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23f93c4b5aa5d0c1614210c7d43e5185eef5f35d440841695b085d9e491cf0d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:43:39,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:43:39,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:43:39,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:43:39,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:43:39,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:43:39,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:43:39,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:43:39,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:43:39,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:43:39,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:43:39,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:43:39,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:43:39,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:43:39,664 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:43:39,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:43:39,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:43:39,665 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:43:39,666 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:43:39,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:43:39,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:43:39,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:39,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:43:39,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23f93c4b5aa5d0c1614210c7d43e5185eef5f35d440841695b085d9e491cf0d2 [2025-03-17 02:43:39,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:43:39,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:43:39,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:43:39,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:43:39,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:43:39,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i [2025-03-17 02:43:41,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aeadeaa6/6d3cda17d8cd47b1b961285d6cd4f01d/FLAGcf1ec63d8 [2025-03-17 02:43:41,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:43:41,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i [2025-03-17 02:43:41,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aeadeaa6/6d3cda17d8cd47b1b961285d6cd4f01d/FLAGcf1ec63d8 [2025-03-17 02:43:41,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aeadeaa6/6d3cda17d8cd47b1b961285d6cd4f01d [2025-03-17 02:43:41,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:43:41,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:43:41,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:41,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:43:41,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:43:41,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414dfc49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41, skipping insertion in model container [2025-03-17 02:43:41,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:43:41,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i[917,930] [2025-03-17 02:43:41,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:41,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:43:41,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-42.i[917,930] [2025-03-17 02:43:41,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:41,772 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:43:41,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41 WrapperNode [2025-03-17 02:43:41,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:41,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:41,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:43:41,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:43:41,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,797 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-03-17 02:43:41,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:41,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:43:41,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:43:41,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:43:41,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,813 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:43:41,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:43:41,822 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:43:41,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:43:41,823 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:43:41,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (1/1) ... [2025-03-17 02:43:41,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:41,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:43:41,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:43:41,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:43:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:43:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:43:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:43:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:43:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:43:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:43:41,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:43:41,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:43:42,130 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:43:42,133 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:43:42,139 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:43:42,140 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:43:42,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:42 BoogieIcfgContainer [2025-03-17 02:43:42,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:43:42,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:43:42,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:43:42,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:43:42,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:43:41" (1/3) ... [2025-03-17 02:43:42,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702caffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:42, skipping insertion in model container [2025-03-17 02:43:42,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:41" (2/3) ... [2025-03-17 02:43:42,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702caffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:42, skipping insertion in model container [2025-03-17 02:43:42,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:42" (3/3) ... [2025-03-17 02:43:42,149 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-42.i [2025-03-17 02:43:42,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:43:42,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-42.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:43:42,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:43:42,198 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;@3ad42bca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:43:42,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:43:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 02:43:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 02:43:42,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:42,206 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:42,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:42,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash -662800007, now seen corresponding path program 1 times [2025-03-17 02:43:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:43:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070621948] [2025-03-17 02:43:42,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:42,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:43:42,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:43:42,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:43:42,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:43:42,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:43:42,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:43:42,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:42,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:42,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:43:42,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:43:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 02:43:42,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:43:42,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:43:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070621948] [2025-03-17 02:43:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070621948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:43:42,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:43:42,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:43:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259027890] [2025-03-17 02:43:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:43:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:43:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:43:42,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:43:42,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:42,391 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 02:43:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:43:42,405 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2025-03-17 02:43:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:43:42,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2025-03-17 02:43:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:43:42,411 INFO L225 Difference]: With dead ends: 67 [2025-03-17 02:43:42,411 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 02:43:42,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:42,416 INFO L435 NwaCegarLoop]: 46 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, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:43:42,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:43:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 02:43:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 02:43:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 02:43:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2025-03-17 02:43:42,445 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 70 [2025-03-17 02:43:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:43:42,445 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-03-17 02:43:42,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 02:43:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2025-03-17 02:43:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 02:43:42,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:42,448 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:42,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:43:42,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:43:42,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:42,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash -26890406, now seen corresponding path program 1 times [2025-03-17 02:43:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:43:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785744026] [2025-03-17 02:43:42,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:43:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:43:42,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:43:42,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:43:42,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:43:42,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:43:42,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:42,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:42,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 02:43:42,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:43:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 02:43:56,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:44:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-17 02:44:27,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:44:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785744026] [2025-03-17 02:44:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785744026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:44:27,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:44:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2025-03-17 02:44:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985826180] [2025-03-17 02:44:27,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 02:44:27,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 02:44:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:44:27,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 02:44:27,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2025-03-17 02:44:27,808 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-17 02:44:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:44:29,249 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-03-17 02:44:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 02:44:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 70 [2025-03-17 02:44:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:44:29,251 INFO L225 Difference]: With dead ends: 72 [2025-03-17 02:44:29,251 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 02:44:29,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=551, Invalid=1611, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 02:44:29,252 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:44:29,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 142 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:44:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 02:44:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2025-03-17 02:44:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 02:44:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2025-03-17 02:44:29,261 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 70 [2025-03-17 02:44:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:44:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2025-03-17 02:44:29,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-17 02:44:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2025-03-17 02:44:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 02:44:29,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:44:29,263 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:44:29,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:44:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:44:29,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:44:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:44:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash 3585787, now seen corresponding path program 1 times [2025-03-17 02:44:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:44:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696437833] [2025-03-17 02:44:29,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:44:29,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:44:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:44:29,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:44:29,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 02:44:29,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:44:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:44:29,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:44:29,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:44:29,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 02:44:29,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:44:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 02:44:29,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:45:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 02:45:01,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:45:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696437833] [2025-03-17 02:45:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696437833] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 02:45:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:45:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2025-03-17 02:45:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803153899] [2025-03-17 02:45:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:45:01,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:45:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:45:01,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:45:01,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:45:01,016 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 02:45:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:45:01,753 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-03-17 02:45:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:45:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2025-03-17 02:45:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:45:01,757 INFO L225 Difference]: With dead ends: 62 [2025-03-17 02:45:01,757 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 02:45:01,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-17 02:45:01,758 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:45:01,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 120 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:45:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 02:45:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2025-03-17 02:45:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 02:45:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-17 02:45:01,766 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 70 [2025-03-17 02:45:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:45:01,766 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-17 02:45:01,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 02:45:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-03-17 02:45:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 02:45:01,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:45:01,768 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:45:01,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 02:45:01,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:45:01,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:45:01,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:45:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 3615578, now seen corresponding path program 1 times [2025-03-17 02:45:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:45:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49986760] [2025-03-17 02:45:01,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:45:01,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:45:01,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:45:01,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:45:01,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 02:45:01,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 02:45:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 02:45:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:45:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:45:02,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 02:45:02,022 INFO L279 TraceCheckSpWp]: Computing forward predicates...