./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:16:49,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:16:49,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:16:49,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:16:49,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:16:49,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:16:49,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:16:49,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:16:49,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:16:49,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:16:49,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:16:49,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:16:49,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:16:49,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:16:49,668 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:16:49,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:16:49,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:49,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:49,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:49,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:16:49,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:16:49,670 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-jdk21/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 -> afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab [2025-01-09 15:16:49,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:16:49,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:16:49,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:16:49,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:16:49,919 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:16:49,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-01-09 15:16:51,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c2c3c2b6/c2d58da4712e44f0b5569e8657d7226a/FLAGe2b525dc2 [2025-01-09 15:16:51,401 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:16:51,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-01-09 15:16:51,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c2c3c2b6/c2d58da4712e44f0b5569e8657d7226a/FLAGe2b525dc2 [2025-01-09 15:16:51,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c2c3c2b6/c2d58da4712e44f0b5569e8657d7226a [2025-01-09 15:16:51,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:16:51,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:16:51,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:51,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:16:51,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:16:51,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e50b171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51, skipping insertion in model container [2025-01-09 15:16:51,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:16:51,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i[913,926] [2025-01-09 15:16:51,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:51,581 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:16:51,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i[913,926] [2025-01-09 15:16:51,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:51,630 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:16:51,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51 WrapperNode [2025-01-09 15:16:51,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:51,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:51,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:16:51,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:16:51,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,675 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2025-01-09 15:16:51,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:51,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:16:51,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:16:51,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:16:51,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,709 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-01-09 15:16:51,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:16:51,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:16:51,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:16:51,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:16:51,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (1/1) ... [2025-01-09 15:16:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:51,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:51,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:16:51,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:16:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:16:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:16:51,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:16:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:16:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:16:51,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:16:51,830 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:16:51,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:16:52,080 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 15:16:52,080 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:16:52,088 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:16:52,089 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:16:52,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:52 BoogieIcfgContainer [2025-01-09 15:16:52,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:16:52,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:16:52,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:16:52,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:16:52,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:16:51" (1/3) ... [2025-01-09 15:16:52,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb24daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:52, skipping insertion in model container [2025-01-09 15:16:52,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:51" (2/3) ... [2025-01-09 15:16:52,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb24daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:52, skipping insertion in model container [2025-01-09 15:16:52,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:52" (3/3) ... [2025-01-09 15:16:52,098 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-95.i [2025-01-09 15:16:52,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:16:52,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-95.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:16:52,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:16:52,158 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;@28f986bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:16:52,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:16:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 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-01-09 15:16:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:16:52,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:52,172 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, 1, 1] [2025-01-09 15:16:52,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:52,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash 348631927, now seen corresponding path program 1 times [2025-01-09 15:16:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597750892] [2025-01-09 15:16:52,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:52,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:16:52,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:16:52,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:52,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 15:16:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597750892] [2025-01-09 15:16:52,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597750892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:16:52,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997246738] [2025-01-09 15:16:52,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:16:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:52,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:16:52,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:16:52,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:16:52,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:16:52,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:52,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:52,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:16:52,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:16:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 15:16:52,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:16:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997246738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:52,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:16:52,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:16:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129272136] [2025-01-09 15:16:52,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:52,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:16:52,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:52,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:16:52,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:16:52,612 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-01-09 15:16:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:52,632 INFO L93 Difference]: Finished difference Result 120 states and 193 transitions. [2025-01-09 15:16:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:16:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 107 [2025-01-09 15:16:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:52,638 INFO L225 Difference]: With dead ends: 120 [2025-01-09 15:16:52,638 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 15:16:52,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-01-09 15:16:52,645 INFO L435 NwaCegarLoop]: 86 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, 86 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-01-09 15:16:52,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:16:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 15:16:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 15:16:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 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-01-09 15:16:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2025-01-09 15:16:52,678 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 107 [2025-01-09 15:16:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:52,678 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2025-01-09 15:16:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-01-09 15:16:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2025-01-09 15:16:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:16:52,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:52,681 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, 1, 1] [2025-01-09 15:16:52,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:16:52,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:16:52,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:52,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash 364923503, now seen corresponding path program 1 times [2025-01-09 15:16:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037733862] [2025-01-09 15:16:52,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:52,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:16:52,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:16:52,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:52,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:16:53,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:53,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037733862] [2025-01-09 15:16:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037733862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:53,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:16:53,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:16:53,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275820927] [2025-01-09 15:16:53,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:53,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:16:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:53,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:16:53,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:16:53,206 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-01-09 15:16:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:53,229 INFO L93 Difference]: Finished difference Result 118 states and 171 transitions. [2025-01-09 15:16:53,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:16:53,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 107 [2025-01-09 15:16:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:53,232 INFO L225 Difference]: With dead ends: 118 [2025-01-09 15:16:53,232 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 15:16:53,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:16:53,233 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:16:53,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:16:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 15:16:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 15:16:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 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-01-09 15:16:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2025-01-09 15:16:53,243 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 107 [2025-01-09 15:16:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:53,245 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2025-01-09 15:16:53,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-01-09 15:16:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2025-01-09 15:16:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:16:53,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:53,249 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, 1, 1, 1] [2025-01-09 15:16:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:16:53,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1809606811, now seen corresponding path program 1 times [2025-01-09 15:16:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673686537] [2025-01-09 15:16:53,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:53,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:53,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:53,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:16:53,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525140798] [2025-01-09 15:16:53,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:53,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:16:53,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:53,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:16:53,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:16:53,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:53,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:53,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:53,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:16:53,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:16:53,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:53,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:53,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:16:53,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:16:53,549 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:16:53,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:16:53,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:16:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:16:53,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:16:53,810 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:16:53,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:16:53 BoogieIcfgContainer [2025-01-09 15:16:53,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:16:53,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:16:53,817 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:16:53,817 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:16:53,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:52" (3/4) ... [2025-01-09 15:16:53,819 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:16:53,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:16:53,820 INFO L158 Benchmark]: Toolchain (without parser) took 2393.19ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 97.9MB in the end (delta: 7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2025-01-09 15:16:53,820 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:16:53,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.88ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:16:53,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.32ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:16:53,821 INFO L158 Benchmark]: Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 85.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:16:53,821 INFO L158 Benchmark]: RCFGBuilder took 364.15ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 65.4MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:16:53,821 INFO L158 Benchmark]: TraceAbstraction took 1724.26ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 98.9MB in the end (delta: -33.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2025-01-09 15:16:53,821 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.9MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:16:53,822 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.88ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.5MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.32ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 85.1MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 364.15ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 65.4MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1724.26ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 98.9MB in the end (delta: -33.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.9MB in the end (delta: 37.0kB). 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 61, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] float var_1_3 = 1.8; [L24] float var_1_4 = 8.54; [L25] float var_1_5 = 255.8; [L26] float var_1_6 = 50.4; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 5; [L31] unsigned char var_1_12 = 2; [L32] signed short int var_1_13 = 0; [L33] unsigned long int var_1_14 = 16; [L34] signed char var_1_16 = -1; [L35] signed char var_1_17 = -16; [L36] unsigned char last_1_var_1_7 = 0; VAL [isInitial=0, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_4=427/50, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L92] isInitial = 1 [L93] FCALL initially() [L95] CALL updateLastVariables() [L85] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_4=427/50, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L58] var_1_4 = __VERIFIER_nondet_float() [L59] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L59] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L60] var_1_5 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L61] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L62] var_1_6 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L63] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L64] var_1_8 = __VERIFIER_nondet_ulong() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L66] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L67] var_1_10 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L68] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L69] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L69] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L70] var_1_11 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L71] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L72] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L72] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L73] var_1_12 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L74] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L75] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L75] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L76] var_1_14 = __VERIFIER_nondet_ulong() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L78] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L78] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L79] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L79] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L80] var_1_17 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L81] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L82] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L82] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=-2147483649] [L96] RET updateVariables() [L97] CALL step() [L40] var_1_1 = ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))) [L41] var_1_3 = ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f))))) [L42] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L43] EXPR var_1_16 & var_1_1 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L43] signed long int stepLocal_0 = var_1_16 & var_1_1; [L44] COND TRUE (- (3351680781u - var_1_8)) > stepLocal_0 [L45] var_1_7 = (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L47] EXPR var_1_7 >> var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L47] COND FALSE !((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) [L50] COND TRUE var_1_16 >= var_1_1 [L51] var_1_13 = (-5 + (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-6, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR ((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-6, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L88] EXPR (((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256)))) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-6, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L88-L89] return ((((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256))))) && (var_1_16 == ((signed char) var_1_17)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-6, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-6, var_1_14=-4294967295, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 171 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 248 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-01-09 15:16:53,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:16:55,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:16:55,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:16:55,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:16:55,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:16:55,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:16:55,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:16:55,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:16:55,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:16:55,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:16:55,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:16:55,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:16:55,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:16:55,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:16:55,807 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:16:55,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:16:55,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:55,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:55,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:55,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:16:55,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:16:55,811 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-jdk21/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 -> afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab [2025-01-09 15:16:56,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:16:56,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:16:56,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:16:56,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:16:56,078 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:16:56,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-01-09 15:16:57,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/523c986a9/59f86044605a40509414c158f2b5845f/FLAGf359cdf6b [2025-01-09 15:16:57,440 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:16:57,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-01-09 15:16:57,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/523c986a9/59f86044605a40509414c158f2b5845f/FLAGf359cdf6b [2025-01-09 15:16:57,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/523c986a9/59f86044605a40509414c158f2b5845f [2025-01-09 15:16:57,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:16:57,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:16:57,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:57,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:16:57,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:16:57,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:57" (1/1) ... [2025-01-09 15:16:57,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e5640a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:57, skipping insertion in model container [2025-01-09 15:16:57,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:57" (1/1) ... [2025-01-09 15:16:57,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:16:57,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i[913,926] [2025-01-09 15:16:57,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:57,990 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:16:57,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i[913,926] [2025-01-09 15:16:58,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:58,041 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:16:58,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58 WrapperNode [2025-01-09 15:16:58,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:58,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:58,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:16:58,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:16:58,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,081 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2025-01-09 15:16:58,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:58,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:16:58,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:16:58,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:16:58,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,105 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-01-09 15:16:58,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:16:58,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:16:58,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:16:58,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:16:58,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (1/1) ... [2025-01-09 15:16:58,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:58,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:58,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:16:58,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:16:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:16:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:16:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:16:58,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:16:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:16:58,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:16:58,235 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:16:58,236 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:16:59,935 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:16:59,936 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:16:59,948 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:16:59,948 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:16:59,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:59 BoogieIcfgContainer [2025-01-09 15:16:59,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:16:59,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:16:59,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:16:59,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:16:59,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:16:57" (1/3) ... [2025-01-09 15:16:59,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:59, skipping insertion in model container [2025-01-09 15:16:59,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:58" (2/3) ... [2025-01-09 15:16:59,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:59, skipping insertion in model container [2025-01-09 15:16:59,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:59" (3/3) ... [2025-01-09 15:16:59,956 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-95.i [2025-01-09 15:16:59,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:16:59,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-95.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:17:00,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:17:00,032 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;@e793374, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:17:00,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:17:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 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-01-09 15:17:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 15:17:00,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:00,043 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] [2025-01-09 15:17:00,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:00,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash -298504853, now seen corresponding path program 1 times [2025-01-09 15:17:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:17:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196576610] [2025-01-09 15:17:00,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:00,060 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-01-09 15:17:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:17:00,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 15:17:00,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:17:00,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 15:17:00,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 15:17:00,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:00,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:00,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:17:00,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:17:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-01-09 15:17:00,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:17:00,362 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:17:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196576610] [2025-01-09 15:17:00,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196576610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:17:00,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:17:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:17:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128965148] [2025-01-09 15:17:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:17:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:17:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:17:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:17:00,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:17:00,386 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-01-09 15:17:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:17:00,400 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2025-01-09 15:17:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:17:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 100 [2025-01-09 15:17:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:17:00,405 INFO L225 Difference]: With dead ends: 86 [2025-01-09 15:17:00,405 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 15:17:00,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-01-09 15:17:00,409 INFO L435 NwaCegarLoop]: 60 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, 60 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-01-09 15:17:00,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:17:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 15:17:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 15:17:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-01-09 15:17:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-01-09 15:17:00,468 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 100 [2025-01-09 15:17:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:17:00,468 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-01-09 15:17:00,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-01-09 15:17:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-01-09 15:17:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 15:17:00,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:17:00,471 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-01-09 15:17:00,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:17:00,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 15:17:00,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:17:00,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:17:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -860614619, now seen corresponding path program 1 times [2025-01-09 15:17:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:17:00,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595396985] [2025-01-09 15:17:00,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:17:00,673 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-01-09 15:17:00,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:17:00,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 15:17:00,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:17:00,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 15:17:00,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 15:17:00,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:17:00,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:17:00,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:17:00,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:17:57,077 WARN L286 SmtUtils]: Spent 24.26s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)