./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.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 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:08,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:08,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:05:08,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:08,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:08,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:08,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:08,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:08,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:08,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:08,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:08,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:08,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:08,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:08,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:08,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:08,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:08,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:08,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:08,374 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 -> 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 [2025-03-04 00:05:08,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:08,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:08,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:08,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:08,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:08,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2025-03-04 00:05:09,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4949058/b8163fa9731543c5bebf47460905378a/FLAG9aaa0a1a0 [2025-03-04 00:05:10,016 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:10,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2025-03-04 00:05:10,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4949058/b8163fa9731543c5bebf47460905378a/FLAG9aaa0a1a0 [2025-03-04 00:05:10,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4949058/b8163fa9731543c5bebf47460905378a [2025-03-04 00:05:10,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:10,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:10,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:10,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:10,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:10,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb0b31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10, skipping insertion in model container [2025-03-04 00:05:10,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:10,496 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_operatoramount_amount10_file-61.i[915,928] [2025-03-04 00:05:10,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:10,543 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:10,553 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_operatoramount_amount10_file-61.i[915,928] [2025-03-04 00:05:10,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:10,582 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:10,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10 WrapperNode [2025-03-04 00:05:10,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:10,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:10,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:10,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:10,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,611 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2025-03-04 00:05:10,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:10,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:10,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:10,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:10,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,641 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-04 00:05:10,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:10,655 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:10,655 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:10,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:10,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (1/1) ... [2025-03-04 00:05:10,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:10,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:10,690 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-04 00:05:10,692 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-04 00:05:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:05:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:10,762 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:10,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:10,891 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:10,891 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:10,899 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:10,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:10,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:10 BoogieIcfgContainer [2025-03-04 00:05:10,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:10,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:10,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:10,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:10,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:10" (1/3) ... [2025-03-04 00:05:10,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e427d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:10, skipping insertion in model container [2025-03-04 00:05:10,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:10" (2/3) ... [2025-03-04 00:05:10,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e427d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:10, skipping insertion in model container [2025-03-04 00:05:10,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:10" (3/3) ... [2025-03-04 00:05:10,908 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-61.i [2025-03-04 00:05:10,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:10,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-61.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:10,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:10,966 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;@53a110ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:10,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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-04 00:05:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:05:10,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:10,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, 1, 1] [2025-03-04 00:05:10,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:10,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash 922767047, now seen corresponding path program 1 times [2025-03-04 00:05:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333904281] [2025-03-04 00:05:10,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:11,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:05:11,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:05:11,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:11,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:11,139 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-04 00:05:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:05:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333904281] [2025-03-04 00:05:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333904281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:05:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521306759] [2025-03-04 00:05:11,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:11,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:05:11,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:11,145 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-04 00:05:11,146 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-04 00:05:11,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:05:11,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:05:11,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:11,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:11,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:11,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:11,231 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-04 00:05:11,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521306759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:11,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:05:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:05:11,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727765865] [2025-03-04 00:05:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:11,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:05:11,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:11,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:11,250 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-04 00:05:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:11,262 INFO L93 Difference]: Finished difference Result 68 states and 106 transitions. [2025-03-04 00:05:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 72 [2025-03-04 00:05:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:11,267 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:05:11,267 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 00:05:11,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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-04 00:05:11,270 INFO L435 NwaCegarLoop]: 45 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, 45 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-04 00:05:11,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 00:05:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 00:05:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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-04 00:05:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-04 00:05:11,294 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 72 [2025-03-04 00:05:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:11,294 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-04 00:05:11,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-04 00:05:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-04 00:05:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:05:11,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:11,296 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, 1, 1] [2025-03-04 00:05:11,303 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-04 00:05:11,497 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-04 00:05:11,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:11,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:11,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1134929722, now seen corresponding path program 1 times [2025-03-04 00:05:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:05:11,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796861572] [2025-03-04 00:05:11,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:05:11,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:05:11,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:05:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:11,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:05:11,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:05:11,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:05:11,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:05:11,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:05:11,633 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:05:11,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:05:11,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:05:11,638 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:05:11,673 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:05:11,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:05:11 BoogieIcfgContainer [2025-03-04 00:05:11,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:05:11,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:05:11,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:05:11,676 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:05:11,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:10" (3/4) ... [2025-03-04 00:05:11,678 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:05:11,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:05:11,679 INFO L158 Benchmark]: Toolchain (without parser) took 1312.38ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 48.8MB in the end (delta: 73.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-04 00:05:11,679 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:11,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.98ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:11,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.70ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:11,680 INFO L158 Benchmark]: Boogie Preprocessor took 40.99ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:11,680 INFO L158 Benchmark]: IcfgBuilder took 246.04ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 94.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:11,680 INFO L158 Benchmark]: TraceAbstraction took 772.18ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 48.8MB in the end (delta: 44.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 00:05:11,680 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:11,681 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.22ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.98ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.70ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.99ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 246.04ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 94.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 772.18ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 48.8MB in the end (delta: 44.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory is still 48.8MB. 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 someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] double var_1_2 = 199.5; [L24] double var_1_3 = 10.25; [L25] signed char var_1_4 = 5; [L26] signed char var_1_5 = 64; [L27] signed char var_1_6 = 8; [L28] signed char var_1_7 = 5; [L29] unsigned long int var_1_8 = 8; VAL [isInitial=0, var_1_1=0, var_1_2=399/2, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] FCALL updateLastVariables() [L70] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L42] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L43] CALL assume_abort_if_not(var_1_2 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L43] RET assume_abort_if_not(var_1_2 != 0.0F) VAL [isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L44] var_1_3 = __VERIFIER_nondet_double() [L45] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L45] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L46] var_1_4 = __VERIFIER_nondet_char() [L47] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L47] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L48] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L48] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L49] var_1_5 = __VERIFIER_nondet_char() [L50] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L50] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L51] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L51] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L52] var_1_6 = __VERIFIER_nondet_char() [L53] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L53] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L54] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L54] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L55] var_1_7 = __VERIFIER_nondet_char() [L56] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L56] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L57] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L57] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L70] RET updateVariables() [L71] CALL step() [L33] COND TRUE (999.375 / ((((var_1_2) > (-0.19)) ? (var_1_2) : (-0.19)))) >= var_1_3 [L34] var_1_1 = (var_1_4 + -32) VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L38] var_1_8 = var_1_7 VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return (((999.375 / ((((var_1_2) > (-0.19)) ? (var_1_2) : (-0.19)))) >= var_1_3) ? (var_1_1 == ((signed char) (var_1_4 + -32))) : (var_1_1 == ((signed char) (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) - var_1_7)))) && (var_1_8 == ((unsigned long int) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, 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, 45 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, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 171 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-04 00:05:11,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_operatoramount_amount10_file-61.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 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:13,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:13,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:05:13,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:13,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:13,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:13,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:13,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:13,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:13,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:13,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:13,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:13,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:13,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:13,723 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:13,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:13,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:13,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:13,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:13,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:13,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:13,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:13,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:13,726 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 -> 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 [2025-03-04 00:05:13,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:13,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:13,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:13,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:13,969 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:13,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2025-03-04 00:05:15,155 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a63e3f3/b4a2d56e8882403e965fa89321be00d2/FLAG0c3add9df [2025-03-04 00:05:15,335 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:15,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2025-03-04 00:05:15,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a63e3f3/b4a2d56e8882403e965fa89321be00d2/FLAG0c3add9df [2025-03-04 00:05:15,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a63e3f3/b4a2d56e8882403e965fa89321be00d2 [2025-03-04 00:05:15,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:15,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:15,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:15,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:15,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:15,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2340e5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15, skipping insertion in model container [2025-03-04 00:05:15,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:15,483 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_operatoramount_amount10_file-61.i[915,928] [2025-03-04 00:05:15,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:15,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:15,545 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_operatoramount_amount10_file-61.i[915,928] [2025-03-04 00:05:15,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:15,568 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:15,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15 WrapperNode [2025-03-04 00:05:15,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:15,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:15,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:15,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:15,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,593 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2025-03-04 00:05:15,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:15,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:15,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:15,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:15,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,611 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-04 00:05:15,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:15,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:15,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:15,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:15,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (1/1) ... [2025-03-04 00:05:15,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:15,659 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-04 00:05:15,663 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-04 00:05:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:05:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:15,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:15,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:15,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:15,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:26,075 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:26,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:26,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:26,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:26,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:26 BoogieIcfgContainer [2025-03-04 00:05:26,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:26,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:26,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:26,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:26,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:15" (1/3) ... [2025-03-04 00:05:26,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48edf24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:26, skipping insertion in model container [2025-03-04 00:05:26,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:15" (2/3) ... [2025-03-04 00:05:26,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48edf24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:26, skipping insertion in model container [2025-03-04 00:05:26,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:26" (3/3) ... [2025-03-04 00:05:26,090 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-61.i [2025-03-04 00:05:26,100 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:26,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-61.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:05:26,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:05:26,145 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;@6009da69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:05:26,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:05:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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-04 00:05:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:05:26,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:26,154 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, 1, 1] [2025-03-04 00:05:26,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:26,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 922767047, now seen corresponding path program 1 times [2025-03-04 00:05:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24701867] [2025-03-04 00:05:26,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:26,167 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-04 00:05:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:26,170 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-04 00:05:26,171 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-04 00:05:26,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:05:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:05:26,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:26,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:26,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:05:26,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 00:05:26,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:26,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24701867] [2025-03-04 00:05:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24701867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:26,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:05:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150610138] [2025-03-04 00:05:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:26,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:05:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:26,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:05:26,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:05:26,896 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:05:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:26,909 INFO L93 Difference]: Finished difference Result 68 states and 106 transitions. [2025-03-04 00:05:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:05:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2025-03-04 00:05:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:26,926 INFO L225 Difference]: With dead ends: 68 [2025-03-04 00:05:26,927 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 00:05:26,929 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-04 00:05:26,931 INFO L435 NwaCegarLoop]: 45 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, 45 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-04 00:05:26,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:05:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 00:05:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 00:05:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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-04 00:05:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-04 00:05:26,961 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 72 [2025-03-04 00:05:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:26,962 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-04 00:05:26,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:05:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-04 00:05:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 00:05:26,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:26,966 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, 1, 1] [2025-03-04 00:05:26,983 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-04 00:05:27,167 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-04 00:05:27,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1134929722, now seen corresponding path program 1 times [2025-03-04 00:05:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580484409] [2025-03-04 00:05:27,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:27,168 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-04 00:05:27,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:27,170 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-04 00:05:27,172 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-04 00:05:27,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 00:05:27,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 00:05:27,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:27,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:27,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:05:27,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:36,421 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:05:46,096 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:05:56,558 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:06:00,688 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0)) is different from false [2025-03-04 00:06:04,802 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0)) is different from true [2025-03-04 00:06:13,249 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:06:24,098 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:06:38,386 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:06:42,534 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0) (= ((_ sign_extend 24) c_~var_1_7~0) c_~var_1_8~0)) is different from false [2025-03-04 00:06:46,675 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0) (= ((_ sign_extend 24) c_~var_1_7~0) c_~var_1_8~0)) is different from true