./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.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 da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:54:23,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:54:23,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:54:23,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:54:23,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:54:23,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:54:23,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:54:23,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:54:23,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:54:23,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:54:23,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:54:23,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:54:23,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:54:23,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:54:23,815 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:54:23,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:54:23,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:54:23,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:54:23,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:54:23,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:54:23,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:54:23,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:54:23,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:54:23,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:54:23,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:54:23,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:54:23,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:54:23,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:54:23,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:54:23,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:54:23,819 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 -> da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 [2025-01-09 12:54:24,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:54:24,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:54:24,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:54:24,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:54:24,123 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:54:24,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-01-09 12:54:25,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de4350247/3e934479299341b09779acfd01f602bc/FLAG100f556cc [2025-01-09 12:54:25,763 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:54:25,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-01-09 12:54:25,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de4350247/3e934479299341b09779acfd01f602bc/FLAG100f556cc [2025-01-09 12:54:25,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de4350247/3e934479299341b09779acfd01f602bc [2025-01-09 12:54:25,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:54:25,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:54:25,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:54:25,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:54:25,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:54:25,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:54:25" (1/1) ... [2025-01-09 12:54:25,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4414e23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:25, skipping insertion in model container [2025-01-09 12:54:25,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:54:25" (1/1) ... [2025-01-09 12:54:25,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:54:25,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i[916,929] [2025-01-09 12:54:26,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:54:26,066 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:54:26,075 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_loopvsstraightlinecode_100-1loop_file-49.i[916,929] [2025-01-09 12:54:26,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:54:26,143 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:54:26,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26 WrapperNode [2025-01-09 12:54:26,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:54:26,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:54:26,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:54:26,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:54:26,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,214 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-01-09 12:54:26,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:54:26,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:54:26,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:54:26,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:54:26,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:54:26,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:54:26,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:54:26,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:54:26,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:54:26,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (1/1) ... [2025-01-09 12:54:26,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:54:26,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:54:26,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:54:26,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:54:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:54:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:54:26,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:54:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:54:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:54:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:54:26,429 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:54:26,430 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:54:26,804 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 12:54:26,805 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:54:26,816 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:54:26,816 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:54:26,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:54:26 BoogieIcfgContainer [2025-01-09 12:54:26,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:54:26,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:54:26,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:54:26,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:54:26,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:54:25" (1/3) ... [2025-01-09 12:54:26,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e635ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:54:26, skipping insertion in model container [2025-01-09 12:54:26,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:26" (2/3) ... [2025-01-09 12:54:26,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e635ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:54:26, skipping insertion in model container [2025-01-09 12:54:26,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:54:26" (3/3) ... [2025-01-09 12:54:26,825 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-01-09 12:54:26,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:54:26,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:54:26,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:54:26,919 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;@7d4daaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:54:26,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:54:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:54:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 12:54:26,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:26,934 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:54:26,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:26,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash 972549223, now seen corresponding path program 1 times [2025-01-09 12:54:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:54:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901104117] [2025-01-09 12:54:26,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:54:27,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:54:27,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:54:27,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:27,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 12:54:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:54:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901104117] [2025-01-09 12:54:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901104117] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:54:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242158085] [2025-01-09 12:54:27,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:27,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:54:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:54:27,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:54:27,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:54:27,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:54:27,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:54:27,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:27,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:54:27,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:54:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 12:54:27,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:54:27,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242158085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:27,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:54:27,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:54:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151771168] [2025-01-09 12:54:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:27,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:54:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:54:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:54:27,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:54:27,610 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:54:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:27,634 INFO L93 Difference]: Finished difference Result 167 states and 287 transitions. [2025-01-09 12:54:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:54:27,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-01-09 12:54:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:27,641 INFO L225 Difference]: With dead ends: 167 [2025-01-09 12:54:27,641 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 12:54:27,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:54:27,648 INFO L435 NwaCegarLoop]: 130 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, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:54:27,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:54:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 12:54:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 12:54:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:54:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2025-01-09 12:54:27,684 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 171 [2025-01-09 12:54:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:27,685 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-01-09 12:54:27,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:54:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2025-01-09 12:54:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 12:54:27,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:27,688 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:54:27,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:54:27,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:54:27,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:27,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1239179415, now seen corresponding path program 1 times [2025-01-09 12:54:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:54:27,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937985822] [2025-01-09 12:54:27,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:27,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:54:27,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:54:28,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:54:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:54:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:54:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937985822] [2025-01-09 12:54:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937985822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:54:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:54:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428003598] [2025-01-09 12:54:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:29,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:54:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:54:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:54:29,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:54:29,418 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:54:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:30,085 INFO L93 Difference]: Finished difference Result 269 states and 414 transitions. [2025-01-09 12:54:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:54:30,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 12:54:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:30,092 INFO L225 Difference]: With dead ends: 269 [2025-01-09 12:54:30,092 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 12:54:30,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-01-09 12:54:30,094 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 178 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:54:30,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 448 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:54:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 12:54:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2025-01-09 12:54:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 120 states have (on average 1.375) internal successors, (165), 122 states have internal predecessors, (165), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 12:54:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 285 transitions. [2025-01-09 12:54:30,141 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 285 transitions. Word has length 171 [2025-01-09 12:54:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:30,144 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 285 transitions. [2025-01-09 12:54:30,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:54:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 285 transitions. [2025-01-09 12:54:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 12:54:30,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:30,147 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:54:30,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:54:30,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:30,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1940243993, now seen corresponding path program 1 times [2025-01-09 12:54:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:54:30,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377957340] [2025-01-09 12:54:30,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:54:30,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:54:30,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:54:30,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:30,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:54:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:54:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377957340] [2025-01-09 12:54:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377957340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:30,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:54:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:54:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090306106] [2025-01-09 12:54:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:30,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:54:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:54:30,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:54:30,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:54:30,490 INFO L87 Difference]: Start difference. First operand 184 states and 285 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:54:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:30,671 INFO L93 Difference]: Finished difference Result 507 states and 782 transitions. [2025-01-09 12:54:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:54:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 12:54:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:30,680 INFO L225 Difference]: With dead ends: 507 [2025-01-09 12:54:30,680 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 12:54:30,682 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-01-09 12:54:30,684 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 71 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:54:30,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 305 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:54:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 12:54:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 240. [2025-01-09 12:54:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 163 states have (on average 1.392638036809816) internal successors, (227), 166 states have internal predecessors, (227), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:54:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 371 transitions. [2025-01-09 12:54:30,747 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 371 transitions. Word has length 171 [2025-01-09 12:54:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 371 transitions. [2025-01-09 12:54:30,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:54:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 371 transitions. [2025-01-09 12:54:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 12:54:30,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:30,753 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:54:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:54:30,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:30,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1148350729, now seen corresponding path program 1 times [2025-01-09 12:54:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:54:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798961567] [2025-01-09 12:54:30,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:54:30,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:54:30,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:54:30,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:30,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:54:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:54:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798961567] [2025-01-09 12:54:32,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798961567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:32,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:54:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:54:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851573580] [2025-01-09 12:54:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:32,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:54:32,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:54:32,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:54:32,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:54:32,011 INFO L87 Difference]: Start difference. First operand 240 states and 371 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:54:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:33,107 INFO L93 Difference]: Finished difference Result 624 states and 954 transitions. [2025-01-09 12:54:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:54:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-01-09 12:54:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:33,112 INFO L225 Difference]: With dead ends: 624 [2025-01-09 12:54:33,114 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 12:54:33,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:54:33,116 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 298 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:54:33,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 544 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:54:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 12:54:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2025-01-09 12:54:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 172 states have (on average 1.3953488372093024) internal successors, (240), 175 states have internal predecessors, (240), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:54:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 384 transitions. [2025-01-09 12:54:33,178 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 384 transitions. Word has length 172 [2025-01-09 12:54:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 384 transitions. [2025-01-09 12:54:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:54:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 384 transitions. [2025-01-09 12:54:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 12:54:33,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:33,183 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:54:33,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:54:33,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -890185291, now seen corresponding path program 1 times [2025-01-09 12:54:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:54:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111939641] [2025-01-09 12:54:33,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:54:33,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:54:33,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:54:33,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:33,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:54:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560851941] [2025-01-09 12:54:33,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:33,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:54:33,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:54:33,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:54:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:54:33,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:54:34,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:54:34,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:34,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:54:34,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:54:34,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:54:34,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:54:34,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:34,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:54:34,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:54:34,258 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:54:34,259 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:54:34,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:54:34,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:54:34,464 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 12:54:34,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:54:34,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:54:34 BoogieIcfgContainer [2025-01-09 12:54:34,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:54:34,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:54:34,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:54:34,571 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:54:34,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:54:26" (3/4) ... [2025-01-09 12:54:34,575 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:54:34,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:54:34,576 INFO L158 Benchmark]: Toolchain (without parser) took 8770.68ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.7MB in the beginning and 155.4MB in the end (delta: -50.7MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. [2025-01-09 12:54:34,577 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:54:34,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.70ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 88.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:54:34,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:54:34,578 INFO L158 Benchmark]: Boogie Preprocessor took 72.74ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 79.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:54:34,578 INFO L158 Benchmark]: RCFGBuilder took 528.42ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 52.7MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:54:34,579 INFO L158 Benchmark]: TraceAbstraction took 7751.05ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 52.7MB in the beginning and 155.5MB in the end (delta: -102.8MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2025-01-09 12:54:34,579 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 335.5MB. Free memory was 155.5MB in the beginning and 155.4MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:54:34,580 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.70ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 88.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 85.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.74ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 79.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 528.42ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 52.7MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7751.05ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 52.7MB in the beginning and 155.5MB in the end (delta: -102.8MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 335.5MB. Free memory was 155.5MB in the beginning and 155.4MB in the end (delta: 106.2kB). 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 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] signed char var_1_3 = -5; [L24] double var_1_5 = 2.65; [L25] double var_1_6 = 100.375; [L26] double var_1_7 = 5.7; [L27] double var_1_8 = 0.1; [L28] double var_1_9 = 9999.4; [L29] double var_1_10 = 63.375; [L30] signed char var_1_11 = 1; [L31] double var_1_12 = 3.875; [L32] unsigned long int var_1_13 = 2; [L33] double var_1_14 = 1.375; [L34] float var_1_16 = 32.4; [L35] double var_1_17 = 255.25; [L36] unsigned char var_1_19 = 1; [L37] unsigned char var_1_20 = 1; [L38] unsigned char var_1_21 = 50; [L39] unsigned char var_1_22 = 1; [L40] unsigned char var_1_23 = 0; [L41] unsigned char var_1_24 = 0; [L42] double var_1_25 = -0.8; [L43] unsigned short int var_1_26 = 16; [L44] signed short int var_1_28 = -32; [L45] signed short int var_1_29 = 5; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] float last_1_var_1_16 = 32.4; [L49] unsigned char last_1_var_1_19 = 1; [L50] unsigned char last_1_var_1_30 = 0; VAL [isInitial=0, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L192] isInitial = 1 [L193] FCALL initially() [L194] int k_loop; [L195] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L195] COND TRUE k_loop < 1 [L196] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_19 = var_1_19 [L185] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L141] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L144] var_1_6 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L146] var_1_7 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L148] var_1_8 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_9=49997/5] [L149] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20, var_1_9=49997/5] [L150] var_1_9 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L151] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L152] var_1_11 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L153] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L154] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L154] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L155] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L155] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L156] var_1_12 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L158] var_1_14 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L159] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L160] var_1_20 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L161] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L162] CALL assume_abort_if_not(var_1_20 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L162] RET assume_abort_if_not(var_1_20 <= 128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L163] var_1_21 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L164] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L165] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L165] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L166] var_1_22 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L167] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L168] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L168] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L169] var_1_23 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L170] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L171] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L171] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L172] var_1_24 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L173] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L174] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L174] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L175] var_1_29 = __VERIFIER_nondet_short() [L176] CALL assume_abort_if_not(var_1_29 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L176] RET assume_abort_if_not(var_1_29 >= -16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L177] CALL assume_abort_if_not(var_1_29 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L177] RET assume_abort_if_not(var_1_29 <= 16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=0, var_1_3=4, var_1_5=53/20] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L179] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L197] RET updateVariables() [L198] CALL step() [L54] unsigned char stepLocal_6 = var_1_24; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_6=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L55] COND FALSE !(last_1_var_1_30 || stepLocal_6) [L66] var_1_26 = var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L68] COND FALSE !((var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14)) [L71] var_1_13 = var_1_26 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L73] unsigned short int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_0=29, var_1_10=507/8, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L74] COND TRUE (-32 * (var_1_13 / var_1_3)) >= stepLocal_0 [L75] var_1_1 = ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L77] signed long int stepLocal_7 = - 1000; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_7=-1000, var_1_10=507/8, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-32, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L78] COND TRUE stepLocal_7 <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) [L79] var_1_28 = (var_1_29 + var_1_1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L83] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_1=33, var_1_10=507/8, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_5=53/20] [L84] COND TRUE stepLocal_1 >= 32 [L85] var_1_5 = (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4] [L89] COND TRUE var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) [L90] var_1_10 = (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4] [L94] signed long int stepLocal_2 = var_1_26 % (var_1_20 + var_1_21); VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_2=29, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4] [L95] COND FALSE !(stepLocal_2 <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) [L98] var_1_19 = (! var_1_22) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4] [L100] signed char stepLocal_5 = var_1_11; [L101] unsigned short int stepLocal_4 = var_1_26; [L102] unsigned char stepLocal_3 = var_1_20; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-995, stepLocal_4=29, stepLocal_5=-16, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4] [L103] COND TRUE stepLocal_4 >= var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-995, stepLocal_5=-16, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4] [L104] COND FALSE !(stepLocal_5 > var_1_26) [L113] var_1_25 = var_1_8 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-995, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_8=2] [L116] signed long int stepLocal_8 = (0 ^ var_1_1) + var_1_29; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-995, stepLocal_8=-17, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=0, var_1_31=1, var_1_3=4, var_1_8=2] [L117] COND TRUE stepLocal_8 < var_1_11 [L118] var_1_30 = (var_1_22 && (var_1_19 || var_1_31)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-995, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=1, var_1_31=1, var_1_3=4, var_1_8=2] [L122] COND FALSE !(var_1_25 >= var_1_9) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-995, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=1, var_1_31=1, var_1_3=4, var_1_8=2] [L127] COND FALSE !((var_1_5 != var_1_12) && var_1_30) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-995, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=1, var_1_31=1, var_1_3=4, var_1_8=2] [L198] RET step() [L199] CALL, EXPR property() [L188-L189] return ((((((((((((-32 * (var_1_13 / var_1_3)) >= var_1_26) ? (var_1_1 == ((signed long int) ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))))) : 1) && ((var_1_1 >= 32) ? (var_1_5 == ((double) (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)))) : (var_1_5 == ((double) 0.8)))) && ((var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10 == ((double) (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))))) : (var_1_10 == ((double) ((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))))))) && (((var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14)) ? (var_1_13 == ((unsigned long int) (128u + var_1_26))) : (var_1_13 == ((unsigned long int) var_1_26)))) && ((var_1_25 >= var_1_9) ? ((var_1_9 < var_1_14) ? (var_1_16 == ((float) var_1_8)) : 1) : 1)) && (((var_1_5 != var_1_12) && var_1_30) ? ((var_1_12 >= (var_1_9 * var_1_7)) ? ((var_1_11 >= var_1_26) ? (var_1_17 == ((double) var_1_12)) : (var_1_17 == ((double) var_1_7))) : (var_1_17 == ((double) var_1_6))) : 1)) && (((var_1_26 % (var_1_20 + var_1_21)) <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_19 == ((unsigned char) (((! var_1_22) || var_1_23) || var_1_24))) : (var_1_19 == ((unsigned char) (! var_1_22))))) && ((var_1_26 >= var_1_20) ? ((var_1_11 > var_1_26) ? (((((((10) > (var_1_3)) ? (10) : (var_1_3))) + var_1_28) >= var_1_20) ? ((! var_1_19) ? (var_1_25 == ((double) (var_1_9 - var_1_8))) : 1) : (var_1_25 == ((double) var_1_9))) : (var_1_25 == ((double) var_1_8))) : 1)) && ((last_1_var_1_30 || var_1_24) ? (last_1_var_1_19 ? (var_1_26 == ((unsigned short int) ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) : ((var_1_12 == last_1_var_1_16) ? (var_1_23 ? (var_1_26 == ((unsigned short int) var_1_20)) : 1) : 1)) : (var_1_26 == ((unsigned short int) var_1_20)))) && (((- 1000) <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_28 == ((signed short int) (var_1_29 + var_1_1))) : (var_1_28 == ((signed short int) -5)))) && ((((0 ^ var_1_1) + var_1_29) < var_1_11) ? (var_1_30 == ((unsigned char) (var_1_22 && (var_1_19 || var_1_31)))) : (var_1_30 == ((unsigned char) var_1_22))) ; VAL [\result=0, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=1, var_1_31=1, var_1_3=4, var_1_8=2] [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=1, var_1_31=1, var_1_3=4, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-16, var_1_13=29, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=33, var_1_20=-995, var_1_21=-255, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=29, var_1_28=-17, var_1_29=-50, var_1_30=1, var_1_31=1, var_1_3=4, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 1427 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 807 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 620 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 230 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 1756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6450/6500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:54:34,608 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_loopvsstraightlinecode_100-1loop_file-49.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 da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:54:36,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:54:36,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:54:36,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:54:36,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:54:36,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:54:36,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:54:36,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:54:36,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:54:36,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:54:36,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:54:36,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:54:36,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:54:36,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:54:36,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:54:36,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:54:36,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:54:36,980 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:54:36,980 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:54:36,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:54:36,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:54:36,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:54:36,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:54:36,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:54:36,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:54:36,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:54:36,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:54:36,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:54:36,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:54:36,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:54:36,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:54:36,983 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 -> da9b723eb6764db01c7e9bf3efd61044ec19f10f8fa82b3808d599b247834486 [2025-01-09 12:54:37,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:54:37,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:54:37,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:54:37,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:54:37,283 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:54:37,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-01-09 12:54:38,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/631d67563/0f14b36fd4fa46388874e589feb4f8dc/FLAGcb0a45e1b [2025-01-09 12:54:38,956 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:54:38,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-01-09 12:54:38,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/631d67563/0f14b36fd4fa46388874e589feb4f8dc/FLAGcb0a45e1b [2025-01-09 12:54:39,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/631d67563/0f14b36fd4fa46388874e589feb4f8dc [2025-01-09 12:54:39,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:54:39,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:54:39,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:54:39,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:54:39,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:54:39,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b09c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39, skipping insertion in model container [2025-01-09 12:54:39,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:54:39,419 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_loopvsstraightlinecode_100-1loop_file-49.i[916,929] [2025-01-09 12:54:39,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:54:39,509 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:54:39,518 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_loopvsstraightlinecode_100-1loop_file-49.i[916,929] [2025-01-09 12:54:39,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:54:39,571 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:54:39,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39 WrapperNode [2025-01-09 12:54:39,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:54:39,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:54:39,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:54:39,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:54:39,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,629 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-01-09 12:54:39,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:54:39,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:54:39,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:54:39,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:54:39,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,674 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:54:39,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:54:39,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:54:39,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:54:39,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:54:39,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (1/1) ... [2025-01-09 12:54:39,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:54:39,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:54:39,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:54:39,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:54:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:54:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:54:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:54:39,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:54:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:54:39,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:54:39,855 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:54:39,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:55:00,776 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 12:55:00,776 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:55:00,785 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:55:00,785 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:55:00,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:00 BoogieIcfgContainer [2025-01-09 12:55:00,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:55:00,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:55:00,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:55:00,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:55:00,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:54:39" (1/3) ... [2025-01-09 12:55:00,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3618573a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:00, skipping insertion in model container [2025-01-09 12:55:00,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:54:39" (2/3) ... [2025-01-09 12:55:00,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3618573a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:00, skipping insertion in model container [2025-01-09 12:55:00,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:00" (3/3) ... [2025-01-09 12:55:00,795 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i [2025-01-09 12:55:00,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:55:00,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-49.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:55:00,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:55:00,859 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;@1326a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:55:00,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:55:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:55:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 12:55:00,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:00,878 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:00,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 972549223, now seen corresponding path program 1 times [2025-01-09 12:55:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:55:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469167530] [2025-01-09 12:55:00,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:55:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:55:00,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:55:00,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 12:55:01,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:55:01,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:55:01,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:01,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:01,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:55:01,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:55:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-01-09 12:55:02,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:55:02,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:55:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469167530] [2025-01-09 12:55:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469167530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:55:02,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816622701] [2025-01-09 12:55:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:02,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:55:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:55:02,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:55:02,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:55:02,038 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:55:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:02,070 INFO L93 Difference]: Finished difference Result 167 states and 287 transitions. [2025-01-09 12:55:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:55:02,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-01-09 12:55:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:02,078 INFO L225 Difference]: With dead ends: 167 [2025-01-09 12:55:02,079 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 12:55:02,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:55:02,084 INFO L435 NwaCegarLoop]: 130 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, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:02,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:55:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 12:55:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 12:55:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:55:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2025-01-09 12:55:02,119 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 171 [2025-01-09 12:55:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:02,119 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-01-09 12:55:02,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:55:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2025-01-09 12:55:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 12:55:02,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:02,122 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:02,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:55:02,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:55:02,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:02,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1239179415, now seen corresponding path program 1 times [2025-01-09 12:55:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:55:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029741525] [2025-01-09 12:55:02,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:02,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:55:02,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:55:02,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:55:02,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:55:02,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:55:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:55:04,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:04,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:04,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:55:04,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:55:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 675 proven. 36 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-01-09 12:55:08,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:55:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:55:10,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:55:10,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029741525] [2025-01-09 12:55:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029741525] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:55:10,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:55:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 12:55:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92756194] [2025-01-09 12:55:10,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:10,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:55:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:55:10,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:55:10,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:55:10,672 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:55:15,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:19,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:23,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:27,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:31,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:36,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:40,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:44,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:48,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:52,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:53,152 INFO L93 Difference]: Finished difference Result 215 states and 332 transitions. [2025-01-09 12:55:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:55:53,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 12:55:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:53,155 INFO L225 Difference]: With dead ends: 215 [2025-01-09 12:55:53,155 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 12:55:53,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:55:53,157 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 71 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:53,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 310 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 10 Unknown, 0 Unchecked, 42.3s Time] [2025-01-09 12:55:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 12:55:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-01-09 12:55:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 93 states have internal predecessors, (129), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 12:55:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2025-01-09 12:55:53,174 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 171 [2025-01-09 12:55:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:53,175 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2025-01-09 12:55:53,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:55:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2025-01-09 12:55:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 12:55:53,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:53,178 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:53,219 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-01-09 12:55:53,378 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-01-09 12:55:53,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:53,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:53,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1148350729, now seen corresponding path program 1 times [2025-01-09 12:55:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:55:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56310989] [2025-01-09 12:55:53,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:53,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:55:53,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:55:53,382 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-01-09 12:55:53,383 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-01-09 12:55:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 12:55:57,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 12:55:57,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:57,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:57,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 12:55:57,531 INFO L279 TraceCheckSpWp]: Computing forward predicates...