./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.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-39.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 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:05:13,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:05:13,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:05:13,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:05:13,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:05:13,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:05:13,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:05:13,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:05:13,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:05:13,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:05:13,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:05:13,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:05:13,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:05:13,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:05:13,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:05:13,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:05:13,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:05:13,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:05:13,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:05:13,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:05:13,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:05:13,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:05:13,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:05:13,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:13,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:05:13,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:05:13,626 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 -> 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 [2025-03-08 16:05:13,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:05:13,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:05:13,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:05:13,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:05:13,872 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:05:13,873 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-39.i [2025-03-08 16:05:15,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff85944bd/bc4e38940d9f4f019770d69ed94e56e1/FLAGd47c42398 [2025-03-08 16:05:15,300 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:05:15,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.i [2025-03-08 16:05:15,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff85944bd/bc4e38940d9f4f019770d69ed94e56e1/FLAGd47c42398 [2025-03-08 16:05:15,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff85944bd/bc4e38940d9f4f019770d69ed94e56e1 [2025-03-08 16:05:15,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:05:15,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:05:15,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:15,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:05:15,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:05:15,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3e1446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15, skipping insertion in model container [2025-03-08 16:05:15,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:05:15,709 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-39.i[913,926] [2025-03-08 16:05:15,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:15,752 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:05:15,760 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-39.i[913,926] [2025-03-08 16:05:15,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:15,791 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:05:15,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15 WrapperNode [2025-03-08 16:05:15,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:15,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:15,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:05:15,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:05:15,797 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:05:15" (1/1) ... [2025-03-08 16:05:15,802 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:05:15" (1/1) ... [2025-03-08 16:05:15,816 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-08 16:05:15,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:15,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:05:15,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:05:15,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:05:15,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,831 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:05:15,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:05:15,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:05:15,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:05:15,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:05:15,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (1/1) ... [2025-03-08 16:05:15,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:15,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:05:15,870 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:05:15,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:05:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:05:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:05:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:05:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:05:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:05:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:05:15,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:05:15,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:05:16,113 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-08 16:05:16,136 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 16:05:16,136 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:05:16,145 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:05:16,146 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:05:16,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:16 BoogieIcfgContainer [2025-03-08 16:05:16,146 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:05:16,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:05:16,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:05:16,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:05:16,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:05:15" (1/3) ... [2025-03-08 16:05:16,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94d87a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:16, skipping insertion in model container [2025-03-08 16:05:16,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:15" (2/3) ... [2025-03-08 16:05:16,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94d87a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:16, skipping insertion in model container [2025-03-08 16:05:16,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:16" (3/3) ... [2025-03-08 16:05:16,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-39.i [2025-03-08 16:05:16,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:05:16,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-39.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:05:16,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:05:16,222 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;@6c1b7452, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:05:16,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:05:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:05:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:05:16,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:16,235 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:16,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1919820165, now seen corresponding path program 1 times [2025-03-08 16:05:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:05:16,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987486224] [2025-03-08 16:05:16,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:05:16,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:05:16,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:05:16,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:16,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 16:05:16,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:05:16,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987486224] [2025-03-08 16:05:16,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987486224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:05:16,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584730827] [2025-03-08 16:05:16,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:16,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:05:16,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:05:16,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:05:16,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:05:16,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:05:16,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:05:16,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:16,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:16,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:05:16,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:05:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 16:05:16,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:05:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584730827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:05:16,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:05:16,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:05:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605636253] [2025-03-08 16:05:16,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:05:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:05:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:05:16,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:05:16,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:05:16,618 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:05:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:16,637 INFO L93 Difference]: Finished difference Result 104 states and 169 transitions. [2025-03-08 16:05:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:05:16,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-03-08 16:05:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:16,643 INFO L225 Difference]: With dead ends: 104 [2025-03-08 16:05:16,644 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 16:05:16,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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:05:16,647 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:05:16,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:05:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 16:05:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 16:05:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:05:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-08 16:05:16,674 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 104 [2025-03-08 16:05:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:16,674 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-08 16:05:16,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:05:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-08 16:05:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:05:16,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:16,680 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:16,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:05:16,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:05:16,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:16,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash -308363255, now seen corresponding path program 1 times [2025-03-08 16:05:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:05:16,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477950710] [2025-03-08 16:05:16,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:05:16,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:05:16,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:05:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:16,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 16:05:17,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:05:17,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477950710] [2025-03-08 16:05:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477950710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:05:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:05:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:05:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507099415] [2025-03-08 16:05:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:05:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:05:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:05:17,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:05:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:05:17,889 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:05:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:18,159 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2025-03-08 16:05:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:05:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-03-08 16:05:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:18,161 INFO L225 Difference]: With dead ends: 121 [2025-03-08 16:05:18,161 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 16:05:18,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:05:18,162 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:05:18,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 291 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:05:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 16:05:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2025-03-08 16:05:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:05:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2025-03-08 16:05:18,174 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 104 [2025-03-08 16:05:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:18,176 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2025-03-08 16:05:18,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 16:05:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2025-03-08 16:05:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 16:05:18,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:18,177 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:18,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:05:18,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:18,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash 823530688, now seen corresponding path program 1 times [2025-03-08 16:05:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:05:18,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480956678] [2025-03-08 16:05:18,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:05:18,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 16:05:18,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 16:05:18,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:18,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:05:18,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:05:18,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 16:05:18,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 16:05:18,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:18,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:05:18,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:05:18,311 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:05:18,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:05:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:05:18,316 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 16:05:18,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:05:18,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:05:18 BoogieIcfgContainer [2025-03-08 16:05:18,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:05:18,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:05:18,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:05:18,371 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:05:18,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:16" (3/4) ... [2025-03-08 16:05:18,373 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:05:18,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:05:18,375 INFO L158 Benchmark]: Toolchain (without parser) took 2773.60ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 38.6MB in the end (delta: 68.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-08 16:05:18,375 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 126.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:05:18,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.80ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 93.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:05:18,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.52ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:05:18,376 INFO L158 Benchmark]: Boogie Preprocessor took 23.23ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:05:18,376 INFO L158 Benchmark]: IcfgBuilder took 305.58ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 73.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:05:18,376 INFO L158 Benchmark]: TraceAbstraction took 2221.80ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 38.6MB in the end (delta: 33.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-03-08 16:05:18,377 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 142.6MB. Free memory was 38.6MB in the beginning and 38.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:05:18,378 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.17ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 126.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.80ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 93.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.52ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.23ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 305.58ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 73.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2221.80ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 38.6MB in the end (delta: 33.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 142.6MB. Free memory was 38.6MB in the beginning and 38.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] float var_1_7 = 1.1; [L29] float var_1_8 = 7.8; [L30] float var_1_9 = 1.75; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L72] var_1_7 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L73] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L74] var_1_8 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_9=7/4] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5, var_1_9=7/4] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L80] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L80] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L83] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L97] RET updateVariables() [L98] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L38] COND TRUE var_1_2 >= var_1_1 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=5] [L39] COND TRUE ((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9 [L40] var_1_6 = var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=0] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=0] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073741806, stepLocal_1=17, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=0] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073741806, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=0] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=0] [L89-L90] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=0, var_1_4=17, var_1_5=17, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 95 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 138 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 1561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1410/1440 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:05:18,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.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 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:05:20,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:05:20,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:05:20,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:05:20,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:05:20,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:05:20,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:05:20,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:05:20,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:05:20,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:05:20,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:05:20,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:05:20,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:05:20,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:05:20,344 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:05:20,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:05:20,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:05:20,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:05:20,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:05:20,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:05:20,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:05:20,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:05:20,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:20,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:05:20,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:05:20,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:05:20,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:05:20,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:05:20,347 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 -> 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 [2025-03-08 16:05:20,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:05:20,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:05:20,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:05:20,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:05:20,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:05:20,586 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-39.i [2025-03-08 16:05:21,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba22638e/ff583aa2881542bd82a14982b140c295/FLAG2dc78f1e8 [2025-03-08 16:05:21,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:05:21,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.i [2025-03-08 16:05:21,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba22638e/ff583aa2881542bd82a14982b140c295/FLAG2dc78f1e8 [2025-03-08 16:05:22,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba22638e/ff583aa2881542bd82a14982b140c295 [2025-03-08 16:05:22,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:05:22,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:05:22,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:22,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:05:22,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:05:22,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e00362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22, skipping insertion in model container [2025-03-08 16:05:22,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:05:22,420 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-39.i[913,926] [2025-03-08 16:05:22,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:22,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:05:22,472 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-39.i[913,926] [2025-03-08 16:05:22,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:22,504 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:05:22,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22 WrapperNode [2025-03-08 16:05:22,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:22,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:22,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:05:22,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:05:22,512 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:05:22" (1/1) ... [2025-03-08 16:05:22,526 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:05:22" (1/1) ... [2025-03-08 16:05:22,552 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-03-08 16:05:22,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:22,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:05:22,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:05:22,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:05:22,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,577 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:05:22,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:05:22,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:05:22,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:05:22,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:05:22,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (1/1) ... [2025-03-08 16:05:22,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:22,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:05:22,633 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:05:22,637 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:05:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:05:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:05:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:05:22,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:05:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:05:22,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:05:22,726 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:05:22,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:05:23,234 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 16:05:23,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:05:23,244 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:05:23,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:05:23,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:23 BoogieIcfgContainer [2025-03-08 16:05:23,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:05:23,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:05:23,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:05:23,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:05:23,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:05:22" (1/3) ... [2025-03-08 16:05:23,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4685becc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:23, skipping insertion in model container [2025-03-08 16:05:23,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:22" (2/3) ... [2025-03-08 16:05:23,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4685becc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:23, skipping insertion in model container [2025-03-08 16:05:23,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:23" (3/3) ... [2025-03-08 16:05:23,252 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-39.i [2025-03-08 16:05:23,261 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:05:23,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-39.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:05:23,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:05:23,308 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;@6a77a8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:05:23,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:05:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:05:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:05:23,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:23,318 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:23,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:23,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:23,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1321987164, now seen corresponding path program 1 times [2025-03-08 16:05:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:05:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767513623] [2025-03-08 16:05:23,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:23,328 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:05:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:05:23,330 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:05:23,331 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:05:23,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:05:23,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:05:23,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:23,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:23,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:05:23,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:05:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-03-08 16:05:23,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:05:23,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:05:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767513623] [2025-03-08 16:05:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767513623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:05:23,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:05:23,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:05:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702481187] [2025-03-08 16:05:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:05:23,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:05:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:05:23,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:05:23,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:05:23,599 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:05:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:23,619 INFO L93 Difference]: Finished difference Result 90 states and 149 transitions. [2025-03-08 16:05:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:05:23,620 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2025-03-08 16:05:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:23,624 INFO L225 Difference]: With dead ends: 90 [2025-03-08 16:05:23,625 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 16:05:23,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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:05:23,629 INFO L435 NwaCegarLoop]: 64 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, 64 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:05:23,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:05:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 16:05:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-08 16:05:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:05:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-03-08 16:05:23,662 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 101 [2025-03-08 16:05:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:23,664 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-03-08 16:05:23,664 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 16:05:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-03-08 16:05:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:05:23,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:23,668 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:23,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:05:23,868 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:05:23,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:23,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1238401960, now seen corresponding path program 1 times [2025-03-08 16:05:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:05:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33552981] [2025-03-08 16:05:23,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:23,870 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:05:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:05:23,875 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:05:23,876 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:05:23,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:05:24,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:05:24,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:24,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:24,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:05:24,042 INFO L279 TraceCheckSpWp]: Computing forward predicates...