./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-73.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_50-while_file-73.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 dd696787521d9c3ddf5ae81c2d28a536d7bb928069254150de785574965695c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:58:40,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:58:40,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:58:40,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:58:40,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:58:40,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:58:40,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:58:40,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:58:40,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:58:40,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:58:40,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:58:40,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:58:40,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:58:40,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:58:40,857 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:58:40,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:58:40,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:58:40,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:58:40,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:58:40,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:58:40,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:58:40,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:58:40,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:58:40,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:58:40,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:58:40,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:58:40,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:58:40,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:58:40,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:58:40,860 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 -> dd696787521d9c3ddf5ae81c2d28a536d7bb928069254150de785574965695c3 [2025-01-09 13:58:41,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:58:41,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:58:41,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:58:41,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:58:41,104 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:58:41,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-73.i [2025-01-09 13:58:42,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef85d848/fcda6292296340e380e24590d0f74bb5/FLAG1ad966c77 [2025-01-09 13:58:42,469 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:58:42,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-73.i [2025-01-09 13:58:42,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef85d848/fcda6292296340e380e24590d0f74bb5/FLAG1ad966c77 [2025-01-09 13:58:42,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef85d848/fcda6292296340e380e24590d0f74bb5 [2025-01-09 13:58:42,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:58:42,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:58:42,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:58:42,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:58:42,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:58:42,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:58:42" (1/1) ... [2025-01-09 13:58:42,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632cfcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:42, skipping insertion in model container [2025-01-09 13:58:42,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:58:42" (1/1) ... [2025-01-09 13:58:42,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:58:42,934 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_50-while_file-73.i[915,928] [2025-01-09 13:58:42,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:58:42,986 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:58:42,993 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_50-while_file-73.i[915,928] [2025-01-09 13:58:43,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:58:43,025 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:58:43,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43 WrapperNode [2025-01-09 13:58:43,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:58:43,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:58:43,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:58:43,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:58:43,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,074 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-09 13:58:43,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:58:43,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:58:43,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:58:43,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:58:43,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,102 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 13:58:43,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,110 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:58:43,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:58:43,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:58:43,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:58:43,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (1/1) ... [2025-01-09 13:58:43,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:58:43,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:58:43,151 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 13:58:43,154 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 13:58:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:58:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:58:43,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:58:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:58:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:58:43,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:58:43,224 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:58:43,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:58:43,495 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:58:43,495 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:58:43,506 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:58:43,507 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:58:43,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:58:43 BoogieIcfgContainer [2025-01-09 13:58:43,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:58:43,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:58:43,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:58:43,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:58:43,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:58:42" (1/3) ... [2025-01-09 13:58:43,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d37d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:58:43, skipping insertion in model container [2025-01-09 13:58:43,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:43" (2/3) ... [2025-01-09 13:58:43,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d37d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:58:43, skipping insertion in model container [2025-01-09 13:58:43,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:58:43" (3/3) ... [2025-01-09 13:58:43,515 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-73.i [2025-01-09 13:58:43,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:58:43,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-73.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:58:43,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:58:43,587 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;@6a8c3d29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:58:43,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:58:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:58:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 13:58:43,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:58:43,602 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:43,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:58:43,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:58:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1908203776, now seen corresponding path program 1 times [2025-01-09 13:58:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:58:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632699036] [2025-01-09 13:58:43,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:58:43,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 13:58:43,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 13:58:43,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:43,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 13:58:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:58:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632699036] [2025-01-09 13:58:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632699036] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:58:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841332629] [2025-01-09 13:58:43,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:43,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:58:43,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:58:43,880 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 13:58:43,882 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 13:58:43,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 13:58:44,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 13:58:44,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:44,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:44,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:58:44,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:58:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 13:58:44,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:58:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841332629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:58:44,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:58:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:58:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964949400] [2025-01-09 13:58:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:58:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:58:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:58:44,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:58:44,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:58:44,099 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:58:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:58:44,115 INFO L93 Difference]: Finished difference Result 134 states and 224 transitions. [2025-01-09 13:58:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:58:44,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-01-09 13:58:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:58:44,120 INFO L225 Difference]: With dead ends: 134 [2025-01-09 13:58:44,120 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 13:58:44,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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 13:58:44,124 INFO L435 NwaCegarLoop]: 99 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, 99 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 13:58:44,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:58:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 13:58:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 13:58:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:58:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2025-01-09 13:58:44,150 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 139 [2025-01-09 13:58:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:58:44,150 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2025-01-09 13:58:44,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:58:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2025-01-09 13:58:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 13:58:44,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:58:44,154 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:44,160 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 13:58:44,355 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 13:58:44,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:58:44,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:58:44,357 INFO L85 PathProgramCache]: Analyzing trace with hash 562805950, now seen corresponding path program 1 times [2025-01-09 13:58:44,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:58:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193350598] [2025-01-09 13:58:44,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:58:44,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 13:58:44,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 13:58:44,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:44,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:58:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:58:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193350598] [2025-01-09 13:58:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193350598] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:58:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049587530] [2025-01-09 13:58:45,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:58:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:58:45,732 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 13:58:45,733 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 13:58:45,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 13:58:45,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 13:58:45,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:45,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:58:45,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 13:58:45,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:58:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 13:58:46,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:58:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:58:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049587530] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:58:47,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:58:47,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-01-09 13:58:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313570208] [2025-01-09 13:58:47,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:58:47,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 13:58:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:58:47,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 13:58:47,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:58:47,836 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 13:58:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:58:49,236 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2025-01-09 13:58:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 13:58:49,237 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) Word has length 139 [2025-01-09 13:58:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:58:49,242 INFO L225 Difference]: With dead ends: 356 [2025-01-09 13:58:49,244 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 13:58:49,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 13:58:49,245 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 491 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:58:49,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 657 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 13:58:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 13:58:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 202. [2025-01-09 13:58:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 124 states have (on average 1.2258064516129032) internal successors, (152), 125 states have internal predecessors, (152), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 13:58:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 296 transitions. [2025-01-09 13:58:49,289 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 296 transitions. Word has length 139 [2025-01-09 13:58:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:58:49,290 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 296 transitions. [2025-01-09 13:58:49,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 13:58:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2025-01-09 13:58:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 13:58:49,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:58:49,293 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:49,300 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 13:58:49,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:58:49,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:58:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:58:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2143813444, now seen corresponding path program 1 times [2025-01-09 13:58:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:58:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469405686] [2025-01-09 13:58:49,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:58:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:58:49,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 13:58:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 13:58:49,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:49,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:58:49,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:58:49,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 13:58:49,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 13:58:49,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:58:49,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:58:49,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:58:49,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:58:49,622 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:58:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:58:49,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:58:49,711 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:58:49,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:58:49 BoogieIcfgContainer [2025-01-09 13:58:49,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:58:49,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:58:49,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:58:49,722 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:58:49,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:58:43" (3/4) ... [2025-01-09 13:58:49,726 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:58:49,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:58:49,728 INFO L158 Benchmark]: Toolchain (without parser) took 6909.98ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 111.9MB in the beginning and 203.2MB in the end (delta: -91.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2025-01-09 13:58:49,728 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:58:49,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.83ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 97.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:58:49,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.51ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:58:49,729 INFO L158 Benchmark]: Boogie Preprocessor took 47.66ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:58:49,729 INFO L158 Benchmark]: RCFGBuilder took 381.84ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 71.7MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:58:49,729 INFO L158 Benchmark]: TraceAbstraction took 6212.32ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 71.2MB in the beginning and 203.3MB in the end (delta: -132.1MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2025-01-09 13:58:49,730 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 234.9MB. Free memory was 203.3MB in the beginning and 203.2MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:58:49,731 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.83ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 97.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.51ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.66ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.84ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 71.7MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6212.32ms. Allocated memory was 142.6MB in the beginning and 234.9MB in the end (delta: 92.3MB). Free memory was 71.2MB in the beginning and 203.3MB in the end (delta: -132.1MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 234.9MB. Free memory was 203.3MB in the beginning and 203.2MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 7.325; [L23] double var_1_3 = 63.8; [L24] double var_1_4 = 256.6; [L25] double var_1_5 = 2.375; [L26] double var_1_6 = 25.8; [L27] unsigned char var_1_7 = 1; [L28] double var_1_8 = 1.5; [L29] unsigned long int var_1_9 = 32; [L30] unsigned long int var_1_10 = 3567543019; [L31] float var_1_12 = 31.875; [L32] signed long int var_1_13 = 128; [L33] unsigned char var_1_16 = 4; [L34] unsigned char var_1_18 = 16; [L35] signed long int var_1_19 = 64; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = 1897833385; [L38] unsigned char var_1_22 = 2; [L39] signed char var_1_23 = -5; [L40] signed char var_1_24 = -4; [L41] signed char var_1_25 = 2; [L42] signed long int var_1_26 = -1000000; [L43] float last_1_var_1_12 = 31.875; [L44] signed long int last_1_var_1_13 = 128; [L45] unsigned char last_1_var_1_16 = 4; [L46] signed long int last_1_var_1_19 = 64; VAL [isInitial=0, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_3=319/5, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L135] isInitial = 1 [L136] FCALL initially() [L138] CALL updateLastVariables() [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_13 = var_1_13 [L127] last_1_var_1_16 = var_1_16 [L128] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_3=319/5, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L90] var_1_3 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L91] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L92] var_1_4 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L93] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L94] var_1_5 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L95] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L96] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L96] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L97] var_1_6 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L98] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L99] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L99] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L100] var_1_7 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L102] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L102] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L103] var_1_8 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L104] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L105] var_1_10 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_10 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L106] RET assume_abort_if_not(var_1_10 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L107] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L107] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L108] var_1_18 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L109] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L110] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L110] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L111] var_1_20 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L112] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L113] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L113] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L114] var_1_21 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_21 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L115] RET assume_abort_if_not(var_1_21 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L116] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L116] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L117] var_1_24 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_24 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L118] RET assume_abort_if_not(var_1_24 >= -126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L119] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L119] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L120] var_1_25 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_25 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L121] RET assume_abort_if_not(var_1_25 >= -126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L122] CALL assume_abort_if_not(var_1_25 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L122] RET assume_abort_if_not(var_1_25 <= 126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L139] RET updateVariables() [L140] CALL step() [L50] COND TRUE (((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10 [L51] var_1_12 = var_1_8 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L53] COND FALSE !(var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) [L60] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L62] COND TRUE var_1_3 >= (last_1_var_1_12 * var_1_4) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L65] var_1_22 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L66] COND TRUE var_1_1 > var_1_5 [L67] var_1_23 = (((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) < 0 ) ? -((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) : ((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L71] var_1_26 = var_1_25 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L72] EXPR var_1_26 >> var_1_10 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L72] signed long int stepLocal_0 = var_1_26 >> var_1_10; [L73] COND TRUE stepLocal_0 < last_1_var_1_13 [L74] var_1_13 = ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L76] COND TRUE var_1_1 < (var_1_4 - var_1_3) [L77] var_1_9 = (var_1_10 - var_1_16) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L79] COND TRUE var_1_7 && var_1_20 [L80] var_1_19 = ((1827081742 - var_1_13) - (var_1_21 - (var_1_18 + var_1_16))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR ((((var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_7 ? (var_1_1 == ((double) var_1_8)) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_8))) && ((var_1_1 < (var_1_4 - var_1_3)) ? (var_1_9 == ((unsigned long int) (var_1_10 - var_1_16))) : 1)) && (((((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10) ? (var_1_12 == ((float) var_1_8)) : 1)) && (((var_1_26 >> var_1_10) < last_1_var_1_13) ? (var_1_13 == ((signed long int) ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))))) : 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L131-L132] return (((((((((var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_7 ? (var_1_1 == ((double) var_1_8)) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_8))) && ((var_1_1 < (var_1_4 - var_1_3)) ? (var_1_9 == ((unsigned long int) (var_1_10 - var_1_16))) : 1)) && (((((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10) ? (var_1_12 == ((float) var_1_8)) : 1)) && (((var_1_26 >> var_1_10) < last_1_var_1_13) ? (var_1_13 == ((signed long int) ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))))) : 1)) && ((var_1_3 >= (last_1_var_1_12 * var_1_4)) ? (var_1_16 == ((unsigned char) var_1_18)) : 1)) && ((var_1_7 && var_1_20) ? (var_1_19 == ((signed long int) ((1827081742 - var_1_13) - (var_1_21 - (var_1_18 + var_1_16))))) : ((2u >= ((((var_1_21) > (var_1_9)) ? (var_1_21) : (var_1_9)))) ? (var_1_19 == ((signed long int) var_1_22)) : (var_1_19 == ((signed long int) var_1_22))))) && (var_1_22 == ((unsigned char) ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))) && ((var_1_1 > var_1_5) ? (var_1_23 == ((signed char) (((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) < 0 ) ? -((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) : ((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) : (var_1_23 == ((signed char) var_1_24)))) && (var_1_26 == ((signed long int) var_1_25)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 301 mSolverCounterUnsat, 188 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 90 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 3536 SizeOfPredicates, 3 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4061/4200 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 13:58:49,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-73.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 dd696787521d9c3ddf5ae81c2d28a536d7bb928069254150de785574965695c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:58:51,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:58:51,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:58:51,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:58:51,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:58:51,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:58:51,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:58:51,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:58:51,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:58:51,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:58:51,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:58:51,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:58:51,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:58:51,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:58:51,648 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:58:51,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:58:51,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:58:51,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:58:51,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:58:51,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:58:51,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:58:51,650 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 -> dd696787521d9c3ddf5ae81c2d28a536d7bb928069254150de785574965695c3 [2025-01-09 13:58:51,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:58:51,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:58:51,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:58:51,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:58:51,899 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:58:51,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-73.i [2025-01-09 13:58:53,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0e375e47/8d2423ceb30b4f198a38d37fdd530899/FLAG27b19b52b [2025-01-09 13:58:53,250 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:58:53,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-73.i [2025-01-09 13:58:53,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0e375e47/8d2423ceb30b4f198a38d37fdd530899/FLAG27b19b52b [2025-01-09 13:58:53,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0e375e47/8d2423ceb30b4f198a38d37fdd530899 [2025-01-09 13:58:53,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:58:53,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:58:53,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:58:53,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:58:53,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:58:53,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7b1be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53, skipping insertion in model container [2025-01-09 13:58:53,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:58:53,404 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_50-while_file-73.i[915,928] [2025-01-09 13:58:53,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:58:53,462 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:58:53,472 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_50-while_file-73.i[915,928] [2025-01-09 13:58:53,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:58:53,501 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:58:53,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53 WrapperNode [2025-01-09 13:58:53,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:58:53,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:58:53,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:58:53,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:58:53,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,542 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-01-09 13:58:53,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:58:53,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:58:53,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:58:53,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:58:53,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,574 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 13:58:53,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:58:53,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:58:53,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:58:53,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:58:53,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (1/1) ... [2025-01-09 13:58:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:58:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:58:53,631 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 13:58:53,635 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 13:58:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:58:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:58:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:58:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:58:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:58:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:58:53,715 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:58:53,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:59:09,203 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 13:59:09,204 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:59:09,211 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:59:09,212 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:59:09,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:59:09 BoogieIcfgContainer [2025-01-09 13:59:09,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:59:09,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:59:09,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:59:09,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:59:09,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:58:53" (1/3) ... [2025-01-09 13:59:09,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:59:09, skipping insertion in model container [2025-01-09 13:59:09,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:58:53" (2/3) ... [2025-01-09 13:59:09,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:59:09, skipping insertion in model container [2025-01-09 13:59:09,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:59:09" (3/3) ... [2025-01-09 13:59:09,220 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-73.i [2025-01-09 13:59:09,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:59:09,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-73.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:59:09,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:59:09,272 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;@631523d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:59:09,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:59:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:59:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 13:59:09,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:09,282 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:59:09,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:09,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1354739497, now seen corresponding path program 1 times [2025-01-09 13:59:09,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:59:09,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206650247] [2025-01-09 13:59:09,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:09,298 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 13:59:09,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:59:09,301 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 13:59:09,302 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 13:59:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:59:10,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:59:10,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:10,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:59:10,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-01-09 13:59:10,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:59:10,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:59:10,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206650247] [2025-01-09 13:59:10,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206650247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:10,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:10,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:59:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689951471] [2025-01-09 13:59:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:10,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:59:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:59:10,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:59:10,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:59:10,359 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:59:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:10,376 INFO L93 Difference]: Finished difference Result 118 states and 202 transitions. [2025-01-09 13:59:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:59:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-01-09 13:59:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:10,383 INFO L225 Difference]: With dead ends: 118 [2025-01-09 13:59:10,383 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 13:59:10,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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 13:59:10,387 INFO L435 NwaCegarLoop]: 88 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, 88 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 13:59:10,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:59:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 13:59:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 13:59:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:59:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-01-09 13:59:10,413 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 135 [2025-01-09 13:59:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:10,413 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-01-09 13:59:10,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:59:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-01-09 13:59:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 13:59:10,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:10,415 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:59:10,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 13:59:10,616 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 13:59:10,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:10,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1621222937, now seen corresponding path program 1 times [2025-01-09 13:59:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:59:10,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492799032] [2025-01-09 13:59:10,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:10,618 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 13:59:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:59:10,619 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 13:59:10,620 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 13:59:10,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:59:11,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:59:11,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:11,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:11,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:59:11,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 13:59:15,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:59:16,323 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:59:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492799032] [2025-01-09 13:59:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492799032] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:59:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1251280474] [2025-01-09 13:59:16,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:59:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:59:16,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:59:16,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 13:59:16,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:59:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:59:17,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:17,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:17,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:59:17,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:59:20,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:59:20,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1251280474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:20,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:59:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 13:59:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907875373] [2025-01-09 13:59:20,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:20,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:59:20,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:59:20,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:59:20,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:59:20,849 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:59:26,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:30,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:59:34,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:38,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:59:42,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:42,300 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2025-01-09 13:59:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:59:42,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2025-01-09 13:59:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:42,343 INFO L225 Difference]: With dead ends: 172 [2025-01-09 13:59:42,344 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 13:59:42,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:59:42,344 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 43 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:42,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 286 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 21.2s Time] [2025-01-09 13:59:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 13:59:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2025-01-09 13:59:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:59:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2025-01-09 13:59:42,366 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 135 [2025-01-09 13:59:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:42,367 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2025-01-09 13:59:42,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:59:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2025-01-09 13:59:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 13:59:42,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:42,369 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:59:42,395 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 (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:59:42,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 13:59:42,769 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 13:59:42,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:42,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash 898736997, now seen corresponding path program 1 times [2025-01-09 13:59:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:59:42,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622806748] [2025-01-09 13:59:42,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:42,771 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 13:59:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:59:42,773 INFO L229 MonitoredProcess]: Starting monitored process 5 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 13:59:42,774 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 (5)] Waiting until timeout for monitored process [2025-01-09 13:59:42,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:59:43,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:59:43,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:43,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:43,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:59:43,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 13:59:47,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:59:48,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:59:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622806748] [2025-01-09 13:59:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622806748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:59:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [405438644] [2025-01-09 13:59:48,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:48,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:59:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:59:48,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:59:48,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 13:59:48,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 13:59:50,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 13:59:50,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:50,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:50,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 13:59:50,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 13:59:53,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:59:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [405438644] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:59:54,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:59:54,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-01-09 13:59:54,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334365998] [2025-01-09 13:59:54,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:59:54,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:59:54,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:59:54,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:59:54,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:59:54,173 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 14:00:00,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:04,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:00:04,944 INFO L93 Difference]: Finished difference Result 185 states and 274 transitions. [2025-01-09 14:00:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:00:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-01-09 14:00:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:00:04,988 INFO L225 Difference]: With dead ends: 185 [2025-01-09 14:00:04,988 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 14:00:04,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:00:04,989 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 94 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 66 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:00:04,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 295 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2025-01-09 14:00:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 14:00:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2025-01-09 14:00:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 14:00:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2025-01-09 14:00:05,005 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 135 [2025-01-09 14:00:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:00:05,005 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2025-01-09 14:00:05,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 14:00:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2025-01-09 14:00:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 14:00:05,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:00:05,006 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:00:05,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 14:00:05,233 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 (5)] Ended with exit code 0 [2025-01-09 14:00:05,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /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 14:00:05,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:00:05,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:00:05,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1485543011, now seen corresponding path program 1 times [2025-01-09 14:00:05,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:00:05,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635320255] [2025-01-09 14:00:05,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:00:05,411 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 14:00:05,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:00:05,417 INFO L229 MonitoredProcess]: Starting monitored process 7 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 14:00:05,418 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 (7)] Waiting until timeout for monitored process [2025-01-09 14:00:05,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 14:00:06,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 14:00:06,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:00:06,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:00:06,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 14:00:06,330 INFO L279 TraceCheckSpWp]: Computing forward predicates...