./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-64.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 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:06:16,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:06:16,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:06:16,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:06:16,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:06:16,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:06:16,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:06:16,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:06:16,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:06:16,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:06:16,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:06:16,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:06:16,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:06:16,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:06:16,374 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:06:16,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:06:16,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:06:16,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:06:16,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:06:16,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:06:16,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:06:16,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:06:16,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:06:16,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:06:16,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:16,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:06:16,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:06:16,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:06:16,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:06:16,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:06:16,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:06:16,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:06:16,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:06:16,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:06:16,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:06:16,378 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 -> 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 [2025-02-06 03:06:16,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:06:16,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:06:16,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:06:16,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:06:16,690 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:06:16,691 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-64.i [2025-02-06 03:06:18,204 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e40045a2a/bd0c77df229e48a281c9faf5c2ba348c/FLAGd0ba4a616 [2025-02-06 03:06:18,604 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:06:18,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2025-02-06 03:06:18,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e40045a2a/bd0c77df229e48a281c9faf5c2ba348c/FLAGd0ba4a616 [2025-02-06 03:06:18,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e40045a2a/bd0c77df229e48a281c9faf5c2ba348c [2025-02-06 03:06:18,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:06:18,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:06:18,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:18,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:06:18,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:06:18,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:18" (1/1) ... [2025-02-06 03:06:18,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8303e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:18, skipping insertion in model container [2025-02-06 03:06:18,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:18" (1/1) ... [2025-02-06 03:06:18,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:06:18,963 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-64.i[913,926] [2025-02-06 03:06:19,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:19,036 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:06:19,046 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-64.i[913,926] [2025-02-06 03:06:19,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:19,089 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:06:19,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19 WrapperNode [2025-02-06 03:06:19,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:19,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:19,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:06:19,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:06:19,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,145 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-02-06 03:06:19,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:19,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:06:19,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:06:19,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:06:19,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,197 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-02-06 03:06:19,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:06:19,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:06:19,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:06:19,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:06:19,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (1/1) ... [2025-02-06 03:06:19,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:19,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:19,263 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-02-06 03:06:19,269 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-02-06 03:06:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:06:19,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:06:19,288 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:06:19,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:06:19,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:06:19,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:06:19,362 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:06:19,364 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:06:19,693 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~bitwise16#1;havoc property_#t~short17#1; [2025-02-06 03:06:19,736 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-06 03:06:19,736 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:06:19,753 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:06:19,757 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:06:19,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:19 BoogieIcfgContainer [2025-02-06 03:06:19,757 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:06:19,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:06:19,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:06:19,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:06:19,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:06:18" (1/3) ... [2025-02-06 03:06:19,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b30bb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:19, skipping insertion in model container [2025-02-06 03:06:19,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:19" (2/3) ... [2025-02-06 03:06:19,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b30bb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:19, skipping insertion in model container [2025-02-06 03:06:19,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:19" (3/3) ... [2025-02-06 03:06:19,770 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-64.i [2025-02-06 03:06:19,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:06:19,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-64.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:06:19,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:06:19,864 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;@2fda29c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:06:19,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:06:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:06:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:06:19,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:19,883 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:06:19,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:19,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1961734652, now seen corresponding path program 1 times [2025-02-06 03:06:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:06:19,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548724221] [2025-02-06 03:06:19,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:19,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:06:19,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:06:20,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:06:20,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:20,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 03:06:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:06:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548724221] [2025-02-06 03:06:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548724221] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:06:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55729361] [2025-02-06 03:06:20,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:20,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:06:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:20,152 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-02-06 03:06:20,154 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-02-06 03:06:20,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:06:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:06:20,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:20,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:20,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:06:20,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:06:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 03:06:20,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:06:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55729361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:06:20,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:06:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:06:20,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812008037] [2025-02-06 03:06:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:06:20,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:06:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:06:20,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:06:20,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:06:20,408 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:06:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:06:20,441 INFO L93 Difference]: Finished difference Result 128 states and 217 transitions. [2025-02-06 03:06:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:06:20,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-02-06 03:06:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:06:20,452 INFO L225 Difference]: With dead ends: 128 [2025-02-06 03:06:20,453 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 03:06:20,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-02-06 03:06:20,461 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:06:20,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:06:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 03:06:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-06 03:06:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:06:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2025-02-06 03:06:20,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 128 [2025-02-06 03:06:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:06:20,509 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2025-02-06 03:06:20,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:06:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2025-02-06 03:06:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:06:20,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:20,517 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:06:20,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:06:20,721 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-02-06 03:06:20,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1851805334, now seen corresponding path program 1 times [2025-02-06 03:06:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:06:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678607984] [2025-02-06 03:06:20,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:20,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:06:20,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:06:20,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:06:20,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:20,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:06:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:06:22,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678607984] [2025-02-06 03:06:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678607984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:06:22,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:06:22,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:06:22,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095960410] [2025-02-06 03:06:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:06:22,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:06:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:06:22,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:06:22,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:06:22,449 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:06:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:06:23,339 INFO L93 Difference]: Finished difference Result 244 states and 363 transitions. [2025-02-06 03:06:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:06:23,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-02-06 03:06:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:06:23,343 INFO L225 Difference]: With dead ends: 244 [2025-02-06 03:06:23,343 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 03:06:23,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:06:23,349 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 224 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:06:23,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 530 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:06:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 03:06:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2025-02-06 03:06:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:06:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2025-02-06 03:06:23,393 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 128 [2025-02-06 03:06:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:06:23,393 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2025-02-06 03:06:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:06:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2025-02-06 03:06:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:06:23,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:23,398 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:06:23,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:06:23,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:23,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash 646210603, now seen corresponding path program 1 times [2025-02-06 03:06:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:06:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133058185] [2025-02-06 03:06:23,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:06:23,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:06:23,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:06:23,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:23,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 03:06:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:06:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133058185] [2025-02-06 03:06:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133058185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:06:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11667922] [2025-02-06 03:06:24,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:24,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:06:24,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:24,100 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-02-06 03:06:24,103 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-02-06 03:06:24,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:06:24,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:06:24,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:24,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:24,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:06:24,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:06:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 429 proven. 39 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-02-06 03:06:27,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:06:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 69 proven. 42 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-06 03:06:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11667922] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:06:29,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:06:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2025-02-06 03:06:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491871017] [2025-02-06 03:06:29,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:06:29,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 03:06:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:06:29,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 03:06:29,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:06:29,021 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2025-02-06 03:06:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:06:30,695 INFO L93 Difference]: Finished difference Result 245 states and 349 transitions. [2025-02-06 03:06:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 03:06:30,696 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 128 [2025-02-06 03:06:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:06:30,699 INFO L225 Difference]: With dead ends: 245 [2025-02-06 03:06:30,699 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 03:06:30,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=600, Invalid=2156, Unknown=0, NotChecked=0, Total=2756 [2025-02-06 03:06:30,705 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 595 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:06:30,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 742 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:06:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 03:06:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 131. [2025-02-06 03:06:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.180722891566265) internal successors, (98), 83 states have internal predecessors, (98), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:06:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2025-02-06 03:06:30,738 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 128 [2025-02-06 03:06:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:06:30,739 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2025-02-06 03:06:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2025-02-06 03:06:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2025-02-06 03:06:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:06:30,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:30,743 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:06:30,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:06:30,944 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-02-06 03:06:30,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:30,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:30,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2050625285, now seen corresponding path program 1 times [2025-02-06 03:06:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:06:30,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573693603] [2025-02-06 03:06:30,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:30,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:06:30,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:06:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:06:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:06:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313479247] [2025-02-06 03:06:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:31,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:06:31,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:31,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:06:31,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:06:31,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:06:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:06:31,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:06:31,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:06:31,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:06:31,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:06:31,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:31,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:06:31,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:06:31,264 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:06:31,265 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:06:31,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:06:31,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:06:31,470 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:06:31,548 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:06:31,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:06:31 BoogieIcfgContainer [2025-02-06 03:06:31,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:06:31,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:06:31,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:06:31,552 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:06:31,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:19" (3/4) ... [2025-02-06 03:06:31,556 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:06:31,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:06:31,557 INFO L158 Benchmark]: Toolchain (without parser) took 12756.63ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 105.2MB in the beginning and 476.8MB in the end (delta: -371.6MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2025-02-06 03:06:31,557 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:31,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.86ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:06:31,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.97ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:31,559 INFO L158 Benchmark]: Boogie Preprocessor took 72.66ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:31,560 INFO L158 Benchmark]: IcfgBuilder took 533.45ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 65.6MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:06:31,560 INFO L158 Benchmark]: TraceAbstraction took 11791.70ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 64.7MB in the beginning and 476.9MB in the end (delta: -412.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:31,560 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 553.6MB. Free memory was 476.9MB in the beginning and 476.8MB in the end (delta: 175.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:06:31,562 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.86ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.97ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.66ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 533.45ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 65.6MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11791.70ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 64.7MB in the beginning and 476.9MB in the end (delta: -412.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 553.6MB. Free memory was 476.9MB in the beginning and 476.8MB in the end (delta: 175.4kB). Peak memory consumption was 8.4MB. 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 85, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_2 = 128; [L24] unsigned long int var_1_3 = 2941876006; [L25] unsigned long int var_1_5 = 256; [L26] float var_1_6 = 63.5; [L27] float var_1_7 = -0.151; [L28] float var_1_8 = 0.8; [L29] double var_1_9 = 9.5; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] signed short int var_1_13 = -2; [L34] unsigned char var_1_16 = 10; [L35] unsigned short int var_1_17 = 8; [L36] unsigned char var_1_18 = 16; [L37] unsigned char last_1_var_1_16 = 10; VAL [isInitial=0, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_2=128, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_2=128, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L75] var_1_3 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L78] var_1_5 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L79] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L82] var_1_6 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L84] var_1_7 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L86] var_1_8 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_9=19/2] [L87] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_9=19/2] [L88] var_1_9 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L91] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L93] var_1_12 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L94] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L95] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L95] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L96] var_1_17 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L98] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L98] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L99] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L99] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L102] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L102] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L116] RET updateVariables() [L117] CALL step() [L41] signed long int stepLocal_1 = last_1_var_1_16; [L42] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, stepLocal_1=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L43] COND TRUE stepLocal_1 <= (var_1_3 - last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L44] COND FALSE !(stepLocal_0 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) [L49] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L52] COND TRUE var_1_1 < var_1_1 [L53] var_1_10 = (! (var_1_11 && var_1_12)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L55] EXPR var_1_2 & (var_1_5 / var_1_17) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L55] unsigned long int stepLocal_2 = var_1_2 & (var_1_5 / var_1_17); [L56] COND FALSE !(stepLocal_2 > var_1_3) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L108-L109] return ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 819 mSDsluCounter, 1366 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1246 IncrementalHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 289 mSDtfsCounter, 1246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 112 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 3185 SizeOfPredicates, 10 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4390/4560 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-02-06 03:06:31,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-64.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 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:06:33,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:06:34,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:06:34,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:06:34,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:06:34,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:06:34,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:06:34,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:06:34,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:06:34,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:06:34,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:06:34,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:06:34,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:06:34,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:06:34,147 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:06:34,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:06:34,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:06:34,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:06:34,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:34,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:06:34,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:06:34,150 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 -> 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 [2025-02-06 03:06:34,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:06:34,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:06:34,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:06:34,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:06:34,492 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:06:34,493 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-64.i [2025-02-06 03:06:35,792 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fb45d3e0/f2e41601fb0848acaff5126b4a776599/FLAGd6f22acba [2025-02-06 03:06:36,016 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:06:36,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2025-02-06 03:06:36,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fb45d3e0/f2e41601fb0848acaff5126b4a776599/FLAGd6f22acba [2025-02-06 03:06:36,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fb45d3e0/f2e41601fb0848acaff5126b4a776599 [2025-02-06 03:06:36,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:06:36,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:06:36,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:36,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:06:36,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:06:36,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60177a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36, skipping insertion in model container [2025-02-06 03:06:36,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:06:36,499 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-64.i[913,926] [2025-02-06 03:06:36,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:36,571 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:06:36,580 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-64.i[913,926] [2025-02-06 03:06:36,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:36,617 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:06:36,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36 WrapperNode [2025-02-06 03:06:36,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:36,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:36,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:06:36,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:06:36,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,658 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-02-06 03:06:36,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:36,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:06:36,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:06:36,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:06:36,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,702 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-02-06 03:06:36,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:06:36,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:06:36,725 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:06:36,725 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:06:36,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (1/1) ... [2025-02-06 03:06:36,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:36,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:36,760 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-02-06 03:06:36,764 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-02-06 03:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:06:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:06:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:06:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:06:36,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:06:36,846 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:06:36,848 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:06:38,330 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 03:06:38,331 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:06:38,345 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:06:38,346 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:06:38,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:38 BoogieIcfgContainer [2025-02-06 03:06:38,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:06:38,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:06:38,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:06:38,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:06:38,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:06:36" (1/3) ... [2025-02-06 03:06:38,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a1c664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:38, skipping insertion in model container [2025-02-06 03:06:38,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:36" (2/3) ... [2025-02-06 03:06:38,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a1c664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:38, skipping insertion in model container [2025-02-06 03:06:38,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:38" (3/3) ... [2025-02-06 03:06:38,358 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-64.i [2025-02-06 03:06:38,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:06:38,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-64.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:06:38,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:06:38,443 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;@3e809ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:06:38,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:06:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:06:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:06:38,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:38,455 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:06:38,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:38,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2535233, now seen corresponding path program 1 times [2025-02-06 03:06:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:06:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993736564] [2025-02-06 03:06:38,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:38,469 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-02-06 03:06:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:06:38,474 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-02-06 03:06:38,477 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-02-06 03:06:38,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:06:38,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:06:38,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:38,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:38,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:06:38,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:06:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-02-06 03:06:38,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:06:38,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:06:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993736564] [2025-02-06 03:06:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993736564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:06:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:06:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:06:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240385584] [2025-02-06 03:06:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:06:38,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:06:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:06:38,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:06:38,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:06:38,983 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:06:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:06:39,002 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2025-02-06 03:06:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:06:39,005 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-02-06 03:06:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:06:39,012 INFO L225 Difference]: With dead ends: 110 [2025-02-06 03:06:39,012 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 03:06:39,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-02-06 03:06:39,019 INFO L435 NwaCegarLoop]: 81 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, 81 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-02-06 03:06:39,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:06:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 03:06:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 03:06:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:06:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-02-06 03:06:39,065 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 125 [2025-02-06 03:06:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:06:39,066 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-02-06 03:06:39,066 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:06:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-02-06 03:06:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:06:39,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:39,069 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:06:39,087 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 03:06:39,270 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-02-06 03:06:39,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -830102918, now seen corresponding path program 1 times [2025-02-06 03:06:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:06:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901114348] [2025-02-06 03:06:39,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:39,272 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-02-06 03:06:39,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:06:39,274 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-02-06 03:06:39,277 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-02-06 03:06:39,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:06:39,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:06:39,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:39,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:39,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:06:39,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:07:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:07:00,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:07:00,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:07:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901114348] [2025-02-06 03:07:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901114348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:07:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:07:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:07:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028485797] [2025-02-06 03:07:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:07:00,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:07:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:07:00,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:07:00,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:07:00,821 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:07:04,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:07:06,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:07:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:07:07,424 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2025-02-06 03:07:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:07:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2025-02-06 03:07:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:07:07,462 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:07:07,462 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 03:07:07,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:07:07,464 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 84 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:07:07,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 421 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-02-06 03:07:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 03:07:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2025-02-06 03:07:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:07:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-02-06 03:07:07,488 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 125 [2025-02-06 03:07:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:07:07,488 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-02-06 03:07:07,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:07:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2025-02-06 03:07:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:07:07,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:07:07,492 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:07:07,507 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 (3)] Ended with exit code 0 [2025-02-06 03:07:07,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-02-06 03:07:07,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:07:07,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:07:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash 161034544, now seen corresponding path program 1 times [2025-02-06 03:07:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:07:07,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441599850] [2025-02-06 03:07:07,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:07:07,694 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-02-06 03:07:07,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:07:07,696 INFO L229 MonitoredProcess]: Starting monitored process 4 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-02-06 03:07:07,698 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 (4)] Waiting until timeout for monitored process [2025-02-06 03:07:07,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:07:08,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:07:08,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:07:08,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:07:08,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:07:08,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:07:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-06 03:07:26,643 INFO L312 TraceCheckSpWp]: Computing backward predicates...