./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.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 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:07:19,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:07:19,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:07:19,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:07:19,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:07:19,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:07:19,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:07:19,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:07:19,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:07:19,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:07:19,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:07:19,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:07:19,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:07:19,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:07:19,930 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:07:19,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:07:19,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:07:19,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:07:19,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:07:19,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:07:19,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:07:19,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:07:19,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:07:19,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:07:19,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:07:19,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:07:19,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:07:19,933 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 -> 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 [2025-03-08 16:07:20,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:07:20,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:07:20,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:07:20,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:07:20,245 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:07:20,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2025-03-08 16:07:21,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e2d0707/158a5a0f5d124d3fb8245ff7c49fa44a/FLAG5feca898e [2025-03-08 16:07:21,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:07:21,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2025-03-08 16:07:21,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e2d0707/158a5a0f5d124d3fb8245ff7c49fa44a/FLAG5feca898e [2025-03-08 16:07:21,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e2d0707/158a5a0f5d124d3fb8245ff7c49fa44a [2025-03-08 16:07:21,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:07:21,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:07:21,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:07:21,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:07:21,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:07:21,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c8736c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21, skipping insertion in model container [2025-03-08 16:07:21,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:07:21,727 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_variablewrapping_normal_file-55.i[913,926] [2025-03-08 16:07:21,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:07:21,778 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:07:21,789 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_variablewrapping_normal_file-55.i[913,926] [2025-03-08 16:07:21,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:07:21,822 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:07:21,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21 WrapperNode [2025-03-08 16:07:21,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:07:21,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:07:21,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:07:21,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:07:21,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,864 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-03-08 16:07:21,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:07:21,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:07:21,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:07:21,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:07:21,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,891 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:07:21,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:07:21,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:07:21,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:07:21,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:07:21,910 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (1/1) ... [2025-03-08 16:07:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:07:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:07:21,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:07:21,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:07:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:07:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:07:21,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:07:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:07:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:07:21,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:07:22,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:07:22,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:07:22,223 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2025-03-08 16:07:22,246 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 16:07:22,247 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:07:22,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:07:22,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:07:22,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:07:22 BoogieIcfgContainer [2025-03-08 16:07:22,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:07:22,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:07:22,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:07:22,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:07:22,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:07:21" (1/3) ... [2025-03-08 16:07:22,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd55258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:07:22, skipping insertion in model container [2025-03-08 16:07:22,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:21" (2/3) ... [2025-03-08 16:07:22,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd55258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:07:22, skipping insertion in model container [2025-03-08 16:07:22,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:07:22" (3/3) ... [2025-03-08 16:07:22,268 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-55.i [2025-03-08 16:07:22,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:07:22,280 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-55.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:07:22,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:07:22,332 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;@1fba08ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:07:22,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:07:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:07:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 16:07:22,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:22,343 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:22,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:22,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:22,347 INFO L85 PathProgramCache]: Analyzing trace with hash 213479253, now seen corresponding path program 1 times [2025-03-08 16:07:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:07:22,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288554959] [2025-03-08 16:07:22,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:22,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:07:22,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 16:07:22,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 16:07:22,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:22,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:07:22,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:07:22,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288554959] [2025-03-08 16:07:22,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288554959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:22,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:22,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:07:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223591810] [2025-03-08 16:07:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:22,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:07:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:07:22,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:07:22,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:22,643 INFO L87 Difference]: Start difference. First operand has 61 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:22,697 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2025-03-08 16:07:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:07:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-08 16:07:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:22,703 INFO L225 Difference]: With dead ends: 144 [2025-03-08 16:07:22,703 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 16:07:22,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:22,706 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:22,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 144 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:07:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 16:07:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2025-03-08 16:07:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:07:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2025-03-08 16:07:22,732 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 86 [2025-03-08 16:07:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2025-03-08 16:07:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2025-03-08 16:07:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 16:07:22,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:22,735 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:22,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 16:07:22,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 342561972, now seen corresponding path program 1 times [2025-03-08 16:07:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:07:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266741274] [2025-03-08 16:07:22,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:07:22,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 16:07:22,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 16:07:22,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:22,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:07:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:07:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266741274] [2025-03-08 16:07:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266741274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:22,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:07:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294457529] [2025-03-08 16:07:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:22,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:07:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:07:22,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:07:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:22,905 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:22,950 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions. [2025-03-08 16:07:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:07:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-08 16:07:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:22,954 INFO L225 Difference]: With dead ends: 115 [2025-03-08 16:07:22,954 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 16:07:22,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:22,955 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:22,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:07:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 16:07:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 16:07:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:07:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2025-03-08 16:07:22,963 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 86 [2025-03-08 16:07:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:22,963 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2025-03-08 16:07:22,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2025-03-08 16:07:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 16:07:22,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:22,968 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:22,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:07:22,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:22,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash -708380172, now seen corresponding path program 1 times [2025-03-08 16:07:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:07:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482179701] [2025-03-08 16:07:22,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:07:22,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 16:07:23,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 16:07:23,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:23,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:07:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:07:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482179701] [2025-03-08 16:07:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482179701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:23,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:23,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:07:23,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014281906] [2025-03-08 16:07:23,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:23,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:07:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:07:23,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:07:23,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:07:23,646 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:23,769 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2025-03-08 16:07:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:07:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-08 16:07:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:23,772 INFO L225 Difference]: With dead ends: 142 [2025-03-08 16:07:23,772 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 16:07:23,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:07:23,773 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 29 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:23,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 229 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:07:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 16:07:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-03-08 16:07:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:07:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2025-03-08 16:07:23,780 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 88 [2025-03-08 16:07:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:23,780 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2025-03-08 16:07:23,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2025-03-08 16:07:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:07:23,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:23,781 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:23,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:07:23,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:23,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1314307000, now seen corresponding path program 1 times [2025-03-08 16:07:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:07:23,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334667338] [2025-03-08 16:07:23,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:23,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:07:23,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:07:23,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:07:23,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:23,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:07:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:07:23,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334667338] [2025-03-08 16:07:23,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334667338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:23,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:23,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:07:23,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682544546] [2025-03-08 16:07:23,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:23,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:07:23,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:07:23,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:07:23,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:23,896 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:23,961 INFO L93 Difference]: Finished difference Result 194 states and 271 transitions. [2025-03-08 16:07:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:07:23,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-08 16:07:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:23,966 INFO L225 Difference]: With dead ends: 194 [2025-03-08 16:07:23,966 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 16:07:23,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:23,967 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:23,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 148 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:07:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 16:07:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2025-03-08 16:07:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 96 states have internal predecessors, (121), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:07:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2025-03-08 16:07:23,987 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 89 [2025-03-08 16:07:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2025-03-08 16:07:23,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2025-03-08 16:07:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 16:07:23,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:23,991 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:23,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:07:23,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash 890314357, now seen corresponding path program 1 times [2025-03-08 16:07:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:07:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537221081] [2025-03-08 16:07:23,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:07:24,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 16:07:24,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 16:07:24,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:24,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:07:24,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:07:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537221081] [2025-03-08 16:07:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537221081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:07:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377583018] [2025-03-08 16:07:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:24,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:07:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:07:24,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:07:24,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:07:24,143 INFO L87 Difference]: Start difference. First operand 123 states and 169 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:24,276 INFO L93 Difference]: Finished difference Result 342 states and 467 transitions. [2025-03-08 16:07:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:07:24,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-03-08 16:07:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:24,280 INFO L225 Difference]: With dead ends: 342 [2025-03-08 16:07:24,281 INFO L226 Difference]: Without dead ends: 274 [2025-03-08 16:07:24,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:07:24,283 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 139 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:24,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 287 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:07:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-08 16:07:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 240. [2025-03-08 16:07:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 187 states have internal predecessors, (234), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:07:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 330 transitions. [2025-03-08 16:07:24,320 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 330 transitions. Word has length 90 [2025-03-08 16:07:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:24,320 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 330 transitions. [2025-03-08 16:07:24,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 330 transitions. [2025-03-08 16:07:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 16:07:24,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:24,321 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:24,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:07:24,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:24,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash 62396948, now seen corresponding path program 1 times [2025-03-08 16:07:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:07:24,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330674249] [2025-03-08 16:07:24,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:07:24,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 16:07:24,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 16:07:24,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:24,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:07:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:07:24,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330674249] [2025-03-08 16:07:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330674249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:24,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:07:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152615787] [2025-03-08 16:07:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:24,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:07:24,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:07:24,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:07:24,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:24,400 INFO L87 Difference]: Start difference. First operand 240 states and 330 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:24,443 INFO L93 Difference]: Finished difference Result 477 states and 657 transitions. [2025-03-08 16:07:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:07:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-08 16:07:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:24,446 INFO L225 Difference]: With dead ends: 477 [2025-03-08 16:07:24,446 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 16:07:24,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:24,447 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:24,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:07:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 16:07:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-08 16:07:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 187 states have (on average 1.2299465240641712) internal successors, (230), 187 states have internal predecessors, (230), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:07:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2025-03-08 16:07:24,470 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 91 [2025-03-08 16:07:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:24,471 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2025-03-08 16:07:24,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2025-03-08 16:07:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 16:07:24,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:24,473 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:24,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:07:24,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:24,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1787348288, now seen corresponding path program 1 times [2025-03-08 16:07:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:07:24,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46853896] [2025-03-08 16:07:24,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:07:24,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 16:07:24,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 16:07:24,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:24,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:07:24,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:07:24,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 16:07:24,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 16:07:24,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:24,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:07:24,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:07:24,561 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:07:24,562 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:07:24,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:07:24,565 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:24,623 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:07:24,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:07:24 BoogieIcfgContainer [2025-03-08 16:07:24,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:07:24,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:07:24,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:07:24,626 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:07:24,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:07:22" (3/4) ... [2025-03-08 16:07:24,628 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:07:24,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:07:24,629 INFO L158 Benchmark]: Toolchain (without parser) took 3018.50ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 55.6MB in the end (delta: 77.7MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2025-03-08 16:07:24,629 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:07:24,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.32ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:07:24,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.91ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 117.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:07:24,630 INFO L158 Benchmark]: Boogie Preprocessor took 43.46ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:07:24,630 INFO L158 Benchmark]: IcfgBuilder took 351.25ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 95.9MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:07:24,630 INFO L158 Benchmark]: TraceAbstraction took 2363.47ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 55.6MB in the end (delta: 39.9MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2025-03-08 16:07:24,630 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:07:24,631 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.20ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.32ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.91ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 117.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.46ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 351.25ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 95.9MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2363.47ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 55.6MB in the end (delta: 39.9MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 55.6MB in the end (delta: 50.8kB). 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 shiftRight at line 60, overapproximation of shiftRight at line 60, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] double var_1_7 = 256.75; [L26] double var_1_8 = 63.5; [L27] double var_1_9 = 1.8; [L28] double var_1_10 = 0.25; [L29] double var_1_11 = 16.5; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] float var_1_15 = 4.6; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; VAL [isInitial=0, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] last_1_var_1_12 = var_1_12 [L94] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_9=9/5] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_9=9/5] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L86] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L87] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L87] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L88] var_1_18 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L89] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L90] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L90] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L105] RET updateVariables() [L106] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L44] COND FALSE !(stepLocal_1 && var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4] [L54] COND TRUE \read(var_1_2) [L55] var_1_7 = (((var_1_8 + var_1_9) + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, stepLocal_3=-256, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L62] COND FALSE !((~ var_1_17) <= stepLocal_3) [L67] var_1_12 = (var_1_17 - var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L97-L98] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((float) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=0, var_1_8=505] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 99 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 1072 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 474 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 79 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 621 NumberOfCodeBlocks, 621 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 524 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1584/1584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:07:24,646 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_variablewrapping_normal_file-55.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 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:07:26,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:07:26,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:07:26,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:07:26,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:07:26,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:07:26,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:07:26,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:07:26,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:07:26,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:07:26,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:07:26,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:07:26,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:07:26,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:07:26,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:07:26,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:07:26,556 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 -> 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 [2025-03-08 16:07:26,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:07:26,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:07:26,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:07:26,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:07:26,818 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:07:26,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2025-03-08 16:07:27,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a674e55c4/8dcf26f91445444684cdc5ad221d6569/FLAG1340e57ef [2025-03-08 16:07:28,154 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:07:28,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2025-03-08 16:07:28,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a674e55c4/8dcf26f91445444684cdc5ad221d6569/FLAG1340e57ef [2025-03-08 16:07:28,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a674e55c4/8dcf26f91445444684cdc5ad221d6569 [2025-03-08 16:07:28,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:07:28,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:07:28,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:07:28,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:07:28,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:07:28,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b139411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28, skipping insertion in model container [2025-03-08 16:07:28,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:07:28,310 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_variablewrapping_normal_file-55.i[913,926] [2025-03-08 16:07:28,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:07:28,365 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:07:28,376 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_variablewrapping_normal_file-55.i[913,926] [2025-03-08 16:07:28,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:07:28,406 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:07:28,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28 WrapperNode [2025-03-08 16:07:28,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:07:28,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:07:28,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:07:28,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:07:28,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,443 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-08 16:07:28,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:07:28,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:07:28,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:07:28,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:07:28,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,469 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:07:28,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:07:28,488 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:07:28,488 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:07:28,488 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:07:28,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (1/1) ... [2025-03-08 16:07:28,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:07:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:07:28,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:07:28,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:07:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:07:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:07:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:07:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:07:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:07:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:07:28,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:07:28,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:07:33,563 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 16:07:33,563 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:07:33,569 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:07:33,570 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:07:33,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:07:33 BoogieIcfgContainer [2025-03-08 16:07:33,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:07:33,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:07:33,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:07:33,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:07:33,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:07:28" (1/3) ... [2025-03-08 16:07:33,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e8f8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:07:33, skipping insertion in model container [2025-03-08 16:07:33,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:07:28" (2/3) ... [2025-03-08 16:07:33,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e8f8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:07:33, skipping insertion in model container [2025-03-08 16:07:33,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:07:33" (3/3) ... [2025-03-08 16:07:33,579 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-55.i [2025-03-08 16:07:33,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:07:33,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-55.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:07:33,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:07:33,631 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;@54d2eb06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:07:33,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:07:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:07:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 16:07:33,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:33,639 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:33,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:33,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -15879887, now seen corresponding path program 1 times [2025-03-08 16:07:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:07:33,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852259403] [2025-03-08 16:07:33,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:07:33,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:07:33,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:07:33,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:07:33,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:07:33,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:07:33,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:33,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:33,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:07:33,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:07:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 16:07:33,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:07:33,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:07:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852259403] [2025-03-08 16:07:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852259403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:33,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:07:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815009851] [2025-03-08 16:07:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:07:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:07:33,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:07:33,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:07:34,000 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:07:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:34,019 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-03-08 16:07:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:07:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-03-08 16:07:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:34,025 INFO L225 Difference]: With dead ends: 84 [2025-03-08 16:07:34,025 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 16:07:34,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:07:34,029 INFO L435 NwaCegarLoop]: 59 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, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:34,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:07:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 16:07:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 16:07:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:07:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-03-08 16:07:34,069 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 81 [2025-03-08 16:07:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:34,070 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-03-08 16:07:34,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:07:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-03-08 16:07:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 16:07:34,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:34,072 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:34,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:07:34,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:07:34,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:34,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1707551187, now seen corresponding path program 1 times [2025-03-08 16:07:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:07:34,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243060342] [2025-03-08 16:07:34,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:34,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:07:34,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:07:34,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:07:34,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:07:34,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:07:34,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:07:34,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:34,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:34,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 16:07:34,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:07:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:07:34,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:07:34,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:07:34,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243060342] [2025-03-08 16:07:34,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243060342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:07:34,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:07:34,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:07:34,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756128354] [2025-03-08 16:07:34,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:07:34,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:07:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:07:34,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:07:34,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:34,584 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:37,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:07:41,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:07:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:07:41,113 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2025-03-08 16:07:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:07:41,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-03-08 16:07:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:07:41,140 INFO L225 Difference]: With dead ends: 93 [2025-03-08 16:07:41,140 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 16:07:41,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:07:41,141 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:07:41,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 105 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-08 16:07:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 16:07:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2025-03-08 16:07:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:07:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-03-08 16:07:41,146 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 81 [2025-03-08 16:07:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:07:41,146 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-03-08 16:07:41,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:07:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-03-08 16:07:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 16:07:41,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:07:41,148 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:07:41,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:07:41,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:07:41,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:07:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:07:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash -820047506, now seen corresponding path program 1 times [2025-03-08 16:07:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:07:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215491170] [2025-03-08 16:07:41,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:07:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:07:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:07:41,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:07:41,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:07:41,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 16:07:41,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 16:07:41,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:07:41,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:07:41,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 16:07:41,655 INFO L279 TraceCheckSpWp]: Computing forward predicates...