./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.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-81.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 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:08:32,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:08:32,634 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:08:32,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:08:32,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:08:32,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:08:32,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:08:32,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:08:32,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:08:32,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:08:32,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:08:32,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:08:32,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:08:32,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:08:32,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:08:32,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:08:32,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:08:32,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:08:32,670 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 [2025-02-06 03:08:32,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:08:32,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:08:32,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:08:32,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:08:32,935 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:08:32,937 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-81.i [2025-02-06 03:08:34,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b484cb6c/c031ff8ca4474f07bd134bb7dbb1eca3/FLAGfdb7a9d90 [2025-02-06 03:08:34,463 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:08:34,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2025-02-06 03:08:34,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b484cb6c/c031ff8ca4474f07bd134bb7dbb1eca3/FLAGfdb7a9d90 [2025-02-06 03:08:34,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b484cb6c/c031ff8ca4474f07bd134bb7dbb1eca3 [2025-02-06 03:08:34,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:08:34,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:08:34,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:08:34,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:08:34,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:08:34,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3f7ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34, skipping insertion in model container [2025-02-06 03:08:34,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:08:34,629 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-81.i[913,926] [2025-02-06 03:08:34,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:08:34,687 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:08:34,695 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-81.i[913,926] [2025-02-06 03:08:34,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:08:34,727 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:08:34,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34 WrapperNode [2025-02-06 03:08:34,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:08:34,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:08:34,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:08:34,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:08:34,733 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:08:34" (1/1) ... [2025-02-06 03:08:34,742 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:08:34" (1/1) ... [2025-02-06 03:08:34,770 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-02-06 03:08:34,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:08:34,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:08:34,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:08:34,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:08:34,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,796 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:08:34,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:08:34,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:08:34,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:08:34,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:08:34,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (1/1) ... [2025-02-06 03:08:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:08:34,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:08:34,855 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:08:34,861 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:08:34,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:08:34,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:08:34,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:08:34,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:08:34,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:08:34,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:08:34,945 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:08:34,947 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:08:35,246 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~bitwise16#1;havoc property_#t~short17#1; [2025-02-06 03:08:35,272 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 03:08:35,272 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:08:35,287 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:08:35,287 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:08:35,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:08:35 BoogieIcfgContainer [2025-02-06 03:08:35,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:08:35,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:08:35,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:08:35,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:08:35,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:08:34" (1/3) ... [2025-02-06 03:08:35,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54361596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:08:35, skipping insertion in model container [2025-02-06 03:08:35,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:34" (2/3) ... [2025-02-06 03:08:35,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54361596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:08:35, skipping insertion in model container [2025-02-06 03:08:35,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:08:35" (3/3) ... [2025-02-06 03:08:35,301 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-81.i [2025-02-06 03:08:35,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:08:35,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-81.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:08:35,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:08:35,375 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;@28223a8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:08:35,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:08:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:08:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:08:35,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:08:35,391 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:35,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:08:35,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:08:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1562152994, now seen corresponding path program 1 times [2025-02-06 03:08:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:08:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853985308] [2025-02-06 03:08:35,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:08:35,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:08:35,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:08:35,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:35,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:08:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:08:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:08:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853985308] [2025-02-06 03:08:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853985308] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:08:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445565456] [2025-02-06 03:08:35,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:35,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:08:35,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:08:35,664 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:08:35,666 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:08:35,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:08:35,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:08:35,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:35,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:08:35,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:08:35,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:08:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:08:35,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:08:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445565456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:08:35,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:08:35,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:08:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573271347] [2025-02-06 03:08:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:08:35,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:08:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:08:35,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:08:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:08:35,855 INFO L87 Difference]: Start difference. First operand has 66 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:08:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:08:35,884 INFO L93 Difference]: Finished difference Result 126 states and 209 transitions. [2025-02-06 03:08:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:08:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-02-06 03:08:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:08:35,894 INFO L225 Difference]: With dead ends: 126 [2025-02-06 03:08:35,895 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 03:08:35,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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:08:35,902 INFO L435 NwaCegarLoop]: 91 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, 91 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:08:35,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:08:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 03:08:35,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 03:08:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:08:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2025-02-06 03:08:35,948 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 119 [2025-02-06 03:08:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:08:35,948 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2025-02-06 03:08:35,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:08:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2025-02-06 03:08:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:08:35,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:08:35,952 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:35,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:08:36,152 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:08:36,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:08:36,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:08:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1370152774, now seen corresponding path program 1 times [2025-02-06 03:08:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:08:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658977555] [2025-02-06 03:08:36,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:08:36,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:08:36,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:08:36,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:08:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:08:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:08:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658977555] [2025-02-06 03:08:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658977555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:08:36,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:08:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:08:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617233435] [2025-02-06 03:08:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:08:36,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:08:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:08:36,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:08:36,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:08:36,508 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:08:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:08:36,701 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2025-02-06 03:08:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:08:36,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-02-06 03:08:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:08:36,703 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:08:36,703 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 03:08:36,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:08:36,704 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 69 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:08:36,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:08:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 03:08:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2025-02-06 03:08:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:08:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-02-06 03:08:36,734 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 119 [2025-02-06 03:08:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:08:36,734 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-02-06 03:08:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:08:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-02-06 03:08:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:08:36,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:08:36,736 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:36,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:08:36,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:08:36,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:08:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 702943903, now seen corresponding path program 1 times [2025-02-06 03:08:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:08:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344180435] [2025-02-06 03:08:36,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:08:36,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:08:36,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:08:36,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:36,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:08:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:08:36,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:08:36,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344180435] [2025-02-06 03:08:36,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344180435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:08:36,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:08:36,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:08:36,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395848644] [2025-02-06 03:08:36,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:08:36,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:08:36,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:08:36,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:08:36,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:08:36,992 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:08:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:08:37,123 INFO L93 Difference]: Finished difference Result 197 states and 291 transitions. [2025-02-06 03:08:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:08:37,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-02-06 03:08:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:08:37,125 INFO L225 Difference]: With dead ends: 197 [2025-02-06 03:08:37,125 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 03:08:37,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:08:37,129 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 61 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:08:37,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 244 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:08:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 03:08:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2025-02-06 03:08:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:08:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2025-02-06 03:08:37,148 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 120 [2025-02-06 03:08:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:08:37,150 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2025-02-06 03:08:37,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:08:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2025-02-06 03:08:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:08:37,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:08:37,151 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:37,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:08:37,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:08:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:08:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash 175633907, now seen corresponding path program 1 times [2025-02-06 03:08:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:08:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713535172] [2025-02-06 03:08:37,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:08:37,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:08:37,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:08:37,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:37,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:08:37,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:08:37,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:08:37,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:08:37,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:37,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:08:37,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:08:37,357 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:08:37,358 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:08:37,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:08:37,363 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:08:37,434 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:08:37,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:08:37 BoogieIcfgContainer [2025-02-06 03:08:37,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:08:37,439 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:08:37,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:08:37,439 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:08:37,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:08:35" (3/4) ... [2025-02-06 03:08:37,441 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:08:37,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:08:37,444 INFO L158 Benchmark]: Toolchain (without parser) took 2948.56ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 88.5MB in the end (delta: 34.2MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-02-06 03:08:37,445 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:08:37,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.69ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:08:37,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.11ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:08:37,445 INFO L158 Benchmark]: Boogie Preprocessor took 44.33ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:08:37,445 INFO L158 Benchmark]: IcfgBuilder took 471.43ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 83.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:08:37,445 INFO L158 Benchmark]: TraceAbstraction took 2145.17ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 88.6MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:08:37,445 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 88.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:08:37,446 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.29ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.69ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.11ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.33ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 471.43ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 83.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2145.17ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 88.6MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 88.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of bitwiseOr at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; VAL [isInitial=0, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] last_1_var_1_13 = var_1_13 [L103] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] var_1_4 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] var_1_5 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L79] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L80] var_1_6 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L81] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L82] var_1_11 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L83] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L84] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L86] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L87] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L88] var_1_14 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L89] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L90] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L93] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L95] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L97] var_1_17 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L98] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L99] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L114] RET updateVariables() [L115] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-1] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=-1, var_1_12=-1, var_1_13=5, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-1] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-1] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=-1, var_1_11=-1, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-1] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=101, var_1_1=19999/2, var_1_2=1, var_1_7=-1] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=101, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-1] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=101, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-1] [L106-L107] return (((var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=101, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-1, var_1_12=-1, var_1_13=100, var_1_14=1, var_1_15=101, var_1_16=-49153, var_1_17=-32769, var_1_18=101, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 571 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 259 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 599 NumberOfCodeBlocks, 599 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2414/2448 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:08:37,463 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-81.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 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:08:39,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:08:39,516 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:08:39,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:08:39,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:08:39,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:08:39,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:08:39,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:08:39,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:08:39,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:08:39,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:08:39,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:08:39,543 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:08:39,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:08:39,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:08:39,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:08:39,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:08:39,545 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 -> 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 [2025-02-06 03:08:39,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:08:39,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:08:39,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:08:39,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:08:39,844 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:08:39,845 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-81.i [2025-02-06 03:08:41,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21958781/2479534b2b0e4f0c9c3dc77551944897/FLAG48326d094 [2025-02-06 03:08:41,319 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:08:41,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2025-02-06 03:08:41,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21958781/2479534b2b0e4f0c9c3dc77551944897/FLAG48326d094 [2025-02-06 03:08:41,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21958781/2479534b2b0e4f0c9c3dc77551944897 [2025-02-06 03:08:41,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:08:41,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:08:41,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:08:41,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:08:41,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:08:41,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c508d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41, skipping insertion in model container [2025-02-06 03:08:41,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:08:41,489 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-81.i[913,926] [2025-02-06 03:08:41,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:08:41,554 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:08:41,564 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-81.i[913,926] [2025-02-06 03:08:41,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:08:41,609 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:08:41,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41 WrapperNode [2025-02-06 03:08:41,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:08:41,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:08:41,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:08:41,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:08:41,617 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:08:41" (1/1) ... [2025-02-06 03:08:41,627 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:08:41" (1/1) ... [2025-02-06 03:08:41,656 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-02-06 03:08:41,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:08:41,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:08:41,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:08:41,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:08:41,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,682 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:08:41,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:08:41,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:08:41,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:08:41,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:08:41,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (1/1) ... [2025-02-06 03:08:41,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:08:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:08:41,738 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:08:41,742 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:08:41,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:08:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:08:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:08:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:08:41,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:08:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:08:41,830 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:08:41,833 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:08:43,769 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 03:08:43,769 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:08:43,778 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:08:43,779 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:08:43,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:08:43 BoogieIcfgContainer [2025-02-06 03:08:43,780 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:08:43,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:08:43,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:08:43,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:08:43,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:08:41" (1/3) ... [2025-02-06 03:08:43,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762788dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:08:43, skipping insertion in model container [2025-02-06 03:08:43,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:08:41" (2/3) ... [2025-02-06 03:08:43,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762788dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:08:43, skipping insertion in model container [2025-02-06 03:08:43,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:08:43" (3/3) ... [2025-02-06 03:08:43,790 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-81.i [2025-02-06 03:08:43,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:08:43,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-81.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:08:43,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:08:43,860 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;@11b7623f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:08:43,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:08:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:08:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:08:43,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:08:43,875 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:43,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:08:43,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:08:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1378519756, now seen corresponding path program 1 times [2025-02-06 03:08:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:08:43,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802458143] [2025-02-06 03:08:43,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:43,889 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:08:43,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:08:43,892 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:08:43,893 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:08:43,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:08:44,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:08:44,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:44,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:08:44,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:08:44,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:08:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2025-02-06 03:08:44,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:08:44,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:08:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802458143] [2025-02-06 03:08:44,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802458143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:08:44,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:08:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:08:44,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109516318] [2025-02-06 03:08:44,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:08:44,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:08:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:08:44,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:08:44,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:08:44,226 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:08:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:08:44,243 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2025-02-06 03:08:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:08:44,245 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-02-06 03:08:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:08:44,249 INFO L225 Difference]: With dead ends: 104 [2025-02-06 03:08:44,249 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 03:08:44,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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:08:44,253 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:08:44,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:08:44,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 03:08:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 03:08:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:08:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-02-06 03:08:44,290 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 116 [2025-02-06 03:08:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:08:44,290 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-02-06 03:08:44,290 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:08:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-02-06 03:08:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:08:44,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:08:44,294 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:44,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:08:44,494 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:08:44,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:08:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:08:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1419825624, now seen corresponding path program 1 times [2025-02-06 03:08:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:08:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062613364] [2025-02-06 03:08:44,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:44,496 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:08:44,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:08:44,498 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:08:44,500 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:08:44,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:08:44,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:08:44,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:44,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:08:44,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:08:44,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:08:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:08:45,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:08:45,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:08:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062613364] [2025-02-06 03:08:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062613364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:08:45,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:08:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:08:45,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571993594] [2025-02-06 03:08:45,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:08:45,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:08:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:08:45,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:08:45,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:08:45,744 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:08:48,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:08:49,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 03:08:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:08:49,712 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2025-02-06 03:08:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:08:49,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-02-06 03:08:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:08:49,728 INFO L225 Difference]: With dead ends: 151 [2025-02-06 03:08:49,728 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 03:08:49,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:08:49,730 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 41 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:08:49,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 236 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 03:08:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 03:08:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2025-02-06 03:08:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:08:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2025-02-06 03:08:49,749 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 116 [2025-02-06 03:08:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:08:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2025-02-06 03:08:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:08:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2025-02-06 03:08:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 03:08:49,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:08:49,753 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:49,763 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:08:49,953 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:08:49,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:08:49,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:08:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1254991485, now seen corresponding path program 1 times [2025-02-06 03:08:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:08:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231608099] [2025-02-06 03:08:49,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:08:49,956 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:08:49,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:08:49,958 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:08:49,959 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:08:49,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 03:08:50,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 03:08:50,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:08:50,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:08:50,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 03:08:50,208 INFO L279 TraceCheckSpWp]: Computing forward predicates...