./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.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_floatingpointinfluence_no-floats_file-46.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 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:10,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:10,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:36:10,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:10,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:10,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:10,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:10,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:10,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:10,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:10,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:10,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:10,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:10,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:10,677 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:10,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:10,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:10,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:10,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:36:10,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:10,678 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:10,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:10,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:10,679 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 [2025-03-03 22:36:10,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:10,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:10,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:10,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:10,908 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:10,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2025-03-03 22:36:12,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52eda2701/27927d3d5b7f42eeb23282f3da825630/FLAGdc9b480a2 [2025-03-03 22:36:12,223 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:12,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2025-03-03 22:36:12,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52eda2701/27927d3d5b7f42eeb23282f3da825630/FLAGdc9b480a2 [2025-03-03 22:36:12,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52eda2701/27927d3d5b7f42eeb23282f3da825630 [2025-03-03 22:36:12,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:12,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:12,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:12,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:12,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:12,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12, skipping insertion in model container [2025-03-03 22:36:12,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:12,692 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_no-floats_file-46.i[916,929] [2025-03-03 22:36:12,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:12,737 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:12,745 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_no-floats_file-46.i[916,929] [2025-03-03 22:36:12,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:12,771 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:12,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12 WrapperNode [2025-03-03 22:36:12,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:12,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:12,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:12,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:12,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,804 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-03 22:36:12,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:12,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:12,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:12,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:12,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,829 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-03 22:36:12,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:12,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:12,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:12,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:12,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (1/1) ... [2025-03-03 22:36:12,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:12,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:12,865 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-03 22:36:12,872 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-03 22:36:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:12,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:12,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:12,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:36:12,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:12,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:12,944 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:12,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:13,120 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~bitwise12#1;havoc property_#t~short13#1; [2025-03-03 22:36:13,137 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:13,137 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:13,148 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:13,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:13,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:13 BoogieIcfgContainer [2025-03-03 22:36:13,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:13,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:13,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:13,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:13,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:12" (1/3) ... [2025-03-03 22:36:13,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7103d4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:13, skipping insertion in model container [2025-03-03 22:36:13,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:12" (2/3) ... [2025-03-03 22:36:13,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7103d4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:13, skipping insertion in model container [2025-03-03 22:36:13,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:13" (3/3) ... [2025-03-03 22:36:13,155 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-46.i [2025-03-03 22:36:13,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:13,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-46.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:13,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:13,210 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;@1c2b6b2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:13,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 22:36:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 22:36:13,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:13,222 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:13,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:13,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash 207415209, now seen corresponding path program 1 times [2025-03-03 22:36:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:13,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660996273] [2025-03-03 22:36:13,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:13,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:13,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:13,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:13,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 22:36:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660996273] [2025-03-03 22:36:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660996273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:36:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128520385] [2025-03-03 22:36:13,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:13,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:36:13,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:13,436 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-03 22:36:13,438 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-03 22:36:13,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:13,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:13,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:13,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:13,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:13,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 22:36:13,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128520385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:13,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:36:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:36:13,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961981539] [2025-03-03 22:36:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:13,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:13,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:13,604 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 22:36:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:13,622 INFO L93 Difference]: Finished difference Result 108 states and 180 transitions. [2025-03-03 22:36:13,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:13,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-03 22:36:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:13,628 INFO L225 Difference]: With dead ends: 108 [2025-03-03 22:36:13,628 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 22:36:13,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-03 22:36:13,632 INFO L435 NwaCegarLoop]: 75 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, 75 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-03 22:36:13,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 22:36:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-03 22:36:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 22:36:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-03 22:36:13,662 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 100 [2025-03-03 22:36:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:13,663 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-03 22:36:13,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 22:36:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-03-03 22:36:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 22:36:13,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:13,666 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:13,672 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-03 22:36:13,866 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-03 22:36:13,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:13,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash 395761960, now seen corresponding path program 1 times [2025-03-03 22:36:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:13,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205542017] [2025-03-03 22:36:13,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:13,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:13,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:13,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:13,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 22:36:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205542017] [2025-03-03 22:36:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205542017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:36:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103941061] [2025-03-03 22:36:14,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:36:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:36:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:36:14,169 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 22:36:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:14,232 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2025-03-03 22:36:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:36:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2025-03-03 22:36:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:14,235 INFO L225 Difference]: With dead ends: 121 [2025-03-03 22:36:14,235 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 22:36:14,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:36:14,236 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:14,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 185 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 22:36:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-03-03 22:36:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 50 states have internal predecessors, (61), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 22:36:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2025-03-03 22:36:14,251 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 100 [2025-03-03 22:36:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2025-03-03 22:36:14,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 22:36:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2025-03-03 22:36:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 22:36:14,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:14,255 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:14,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:36:14,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:14,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1283265641, now seen corresponding path program 1 times [2025-03-03 22:36:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765751348] [2025-03-03 22:36:14,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:14,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:14,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:14,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:14,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:36:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528050588] [2025-03-03 22:36:14,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:14,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:36:14,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:14,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:36:14,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:36:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:14,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:14,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:14,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:14,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:36:14,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:14,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:14,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:14,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:14,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:36:14,534 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:36:14,534 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:36:14,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:36:14,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 22:36:14,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:36:14,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:36:14,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:36:14 BoogieIcfgContainer [2025-03-03 22:36:14,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:36:14,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:36:14,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:36:14,813 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:36:14,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:13" (3/4) ... [2025-03-03 22:36:14,817 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:36:14,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:36:14,818 INFO L158 Benchmark]: Toolchain (without parser) took 2233.10ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 110.4MB in the end (delta: 3.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2025-03-03 22:36:14,818 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:14,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.08ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 101.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:36:14,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.34ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:36:14,820 INFO L158 Benchmark]: Boogie Preprocessor took 31.72ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:14,820 INFO L158 Benchmark]: IcfgBuilder took 310.76ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 79.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:36:14,820 INFO L158 Benchmark]: TraceAbstraction took 1662.43ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 110.4MB in the end (delta: -31.3MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2025-03-03 22:36:14,821 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 110.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:14,822 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.13ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.08ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 101.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.34ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.72ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 310.76ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 79.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1662.43ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 110.4MB in the end (delta: -31.3MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 110.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed long int var_1_2 = 31; [L24] signed char var_1_4 = -8; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 1; [L29] signed short int var_1_10 = -4; [L30] signed short int var_1_12 = 32; [L31] signed char var_1_13 = -25; [L32] signed char var_1_16 = 4; [L33] unsigned char last_1_var_1_1 = 1; [L34] signed short int last_1_var_1_10 = -4; VAL [isInitial=0, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=31, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_1 = var_1_1 [L98] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=31, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L76] var_1_4 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L78] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L80] var_1_6 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_7=0, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_7=0, var_1_8=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L83] var_1_7 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_8=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_8=1, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L86] var_1_9 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L89] var_1_12 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L90] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L109] RET updateVariables() [L110] CALL step() [L38] COND FALSE !(last_1_var_1_10 <= (var_1_12 / var_1_4)) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L43] signed long int stepLocal_1 = (((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13)); [L44] signed long int stepLocal_0 = var_1_13 / var_1_4; VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L45] COND FALSE !((- var_1_2) >= 16.75) [L60] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L62] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, stepLocal_2=-25, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L63] EXPR var_1_13 | var_1_13 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, stepLocal_2=-25, var_1_10=-4, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L63] COND TRUE ((var_1_13 | var_1_13) + var_1_4) < stepLocal_2 [L64] var_1_10 = (var_1_12 - 256) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=1, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L68] COND FALSE !(1 == var_1_4) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=5, stepLocal_1=-25, var_1_10=1, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((((- var_1_2) >= 16.75) ? (((var_1_13 / var_1_4) >= var_1_13) ? ((((((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) (var_1_6 || var_1_7)))) : (var_1_6 ? (var_1_1 == ((unsigned char) 1)) : (var_1_1 == ((unsigned char) var_1_7)))) : (var_1_1 == ((unsigned char) 1))) && ((1 == var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && ((((var_1_13 | var_1_13) + var_1_4) < var_1_13) ? (var_1_10 == ((signed short int) (var_1_12 - 256))) : (var_1_10 == ((signed short int) 128))) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=1, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L101-L102] return (((((- var_1_2) >= 16.75) ? (((var_1_13 / var_1_4) >= var_1_13) ? ((((((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) (var_1_6 || var_1_7)))) : (var_1_6 ? (var_1_1 == ((unsigned char) 1)) : (var_1_1 == ((unsigned char) var_1_7)))) : (var_1_1 == ((unsigned char) 1))) && ((1 == var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && ((((var_1_13 | var_1_13) + var_1_4) < var_1_13) ? (var_1_10 == ((signed short int) (var_1_12 - 256))) : (var_1_10 == ((signed short int) 128)))) && ((last_1_var_1_10 <= (var_1_12 / var_1_4)) ? (last_1_var_1_1 ? (var_1_13 == ((signed char) var_1_16)) : 1) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=1, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=1, var_1_12=257, var_1_13=-25, var_1_16=0, var_1_1=1, var_1_2=-2147483648, var_1_4=-5, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 143 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1232/1260 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-03 22:36:14,836 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_no-floats_file-46.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 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:16,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:16,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:36:16,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:16,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:16,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:16,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:16,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:16,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:16,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:16,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:16,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:16,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:16,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:16,784 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:16,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:16,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:16,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:16,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:16,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:16,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:16,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:16,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:16,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:36:16,785 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:36:16,785 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:16,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:16,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:16,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:16,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:16,788 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 -> 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 [2025-03-03 22:36:17,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:17,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:17,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:17,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:17,032 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:17,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2025-03-03 22:36:18,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a336d9/9e25037196de42569ace38cd55fd3237/FLAG722d83b2e [2025-03-03 22:36:18,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:18,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2025-03-03 22:36:18,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a336d9/9e25037196de42569ace38cd55fd3237/FLAG722d83b2e [2025-03-03 22:36:18,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a336d9/9e25037196de42569ace38cd55fd3237 [2025-03-03 22:36:18,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:18,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:18,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:18,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:18,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:18,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680220b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18, skipping insertion in model container [2025-03-03 22:36:18,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:18,531 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_no-floats_file-46.i[916,929] [2025-03-03 22:36:18,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:18,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:18,597 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_no-floats_file-46.i[916,929] [2025-03-03 22:36:18,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:18,635 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:18,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18 WrapperNode [2025-03-03 22:36:18,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:18,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:18,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:18,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:18,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,660 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-03-03 22:36:18,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:18,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:18,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:18,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:18,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,683 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-03 22:36:18,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:18,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:18,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:18,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:18,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (1/1) ... [2025-03-03 22:36:18,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:18,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:18,730 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-03 22:36:18,731 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-03 22:36:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:36:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:18,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:18,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:18,809 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:18,810 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:19,493 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:19,494 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:19,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:19,503 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:19,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:19 BoogieIcfgContainer [2025-03-03 22:36:19,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:19,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:19,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:19,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:19,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:18" (1/3) ... [2025-03-03 22:36:19,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521aab63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:19, skipping insertion in model container [2025-03-03 22:36:19,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:18" (2/3) ... [2025-03-03 22:36:19,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521aab63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:19, skipping insertion in model container [2025-03-03 22:36:19,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:19" (3/3) ... [2025-03-03 22:36:19,510 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-46.i [2025-03-03 22:36:19,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:19,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-46.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:19,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:19,564 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;@35bca45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:19,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 22:36:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:36:19,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:19,573 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:19,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:19,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2014494293, now seen corresponding path program 1 times [2025-03-03 22:36:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:19,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269372280] [2025-03-03 22:36:19,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:19,587 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-03 22:36:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:19,590 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-03 22:36:19,591 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-03 22:36:19,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:36:19,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:36:19,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:19,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:19,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:19,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-03 22:36:19,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:19,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269372280] [2025-03-03 22:36:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269372280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:36:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521274890] [2025-03-03 22:36:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:19,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:19,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:19,799 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 22:36:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:19,820 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2025-03-03 22:36:19,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:19,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-03 22:36:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:19,827 INFO L225 Difference]: With dead ends: 94 [2025-03-03 22:36:19,828 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 22:36:19,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-03 22:36:19,835 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 22:36:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 22:36:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 22:36:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2025-03-03 22:36:19,889 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 97 [2025-03-03 22:36:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:19,890 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2025-03-03 22:36:19,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 22:36:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2025-03-03 22:36:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:36:19,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:19,895 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:19,901 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 22:36:20,095 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-03 22:36:20,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash -739289802, now seen corresponding path program 1 times [2025-03-03 22:36:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:20,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320112991] [2025-03-03 22:36:20,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:20,097 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-03 22:36:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:20,100 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-03 22:36:20,101 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-03 22:36:20,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:36:20,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:36:20,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:20,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:20,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:36:20,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 22:36:20,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:20,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:20,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320112991] [2025-03-03 22:36:20,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320112991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:36:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305179921] [2025-03-03 22:36:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:20,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:36:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:20,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:36:20,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:36:20,529 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 22:36:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:21,159 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2025-03-03 22:36:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:36:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-03 22:36:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:21,176 INFO L225 Difference]: With dead ends: 151 [2025-03-03 22:36:21,176 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 22:36:21,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:36:21,177 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 40 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:21,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 201 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:36:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 22:36:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2025-03-03 22:36:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 22:36:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2025-03-03 22:36:21,214 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 97 [2025-03-03 22:36:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:21,214 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2025-03-03 22:36:21,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 22:36:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2025-03-03 22:36:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:36:21,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:21,217 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:21,223 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-03 22:36:21,421 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-03 22:36:21,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -738366281, now seen corresponding path program 1 times [2025-03-03 22:36:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874625047] [2025-03-03 22:36:21,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:21,423 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-03 22:36:21,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:21,425 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-03 22:36:21,425 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-03 22:36:21,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:36:21,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:36:21,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:21,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 22:36:21,531 INFO L279 TraceCheckSpWp]: Computing forward predicates...