./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-26.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-26.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 083c818f1746871af8e554be10a031d23ddeababa4f5d912dd8e11565e94e97f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:52:06,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:52:06,644 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:52:06,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:52:06,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:52:06,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:52:06,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:52:06,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:52:06,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:52:06,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:52:06,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:52:06,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:52:06,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:52:06,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:52:06,673 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:52:06,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:52:06,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:52:06,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:52:06,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:52:06,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:52:06,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:52:06,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:52:06,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:52:06,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:52:06,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:52:06,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:52:06,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:52:06,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:52:06,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:52:06,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:52:06,677 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 -> 083c818f1746871af8e554be10a031d23ddeababa4f5d912dd8e11565e94e97f [2025-01-09 13:52:06,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:52:06,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:52:06,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:52:06,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:52:06,950 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:52:06,951 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-26.i [2025-01-09 13:52:08,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f57ca0015/0d372936f61c4de3b7808e546a38b644/FLAG6bf9ce90e [2025-01-09 13:52:08,546 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:52:08,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-26.i [2025-01-09 13:52:08,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f57ca0015/0d372936f61c4de3b7808e546a38b644/FLAG6bf9ce90e [2025-01-09 13:52:08,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f57ca0015/0d372936f61c4de3b7808e546a38b644 [2025-01-09 13:52:08,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:52:08,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:52:08,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:52:08,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:52:08,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:52:08,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:08,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bec93e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08, skipping insertion in model container [2025-01-09 13:52:08,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:08,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:52:08,779 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-26.i[915,928] [2025-01-09 13:52:08,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:52:08,865 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:52:08,873 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-26.i[915,928] [2025-01-09 13:52:08,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:52:08,909 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:52:08,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08 WrapperNode [2025-01-09 13:52:08,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:52:08,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:52:08,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:52:08,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:52:08,918 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:52:08" (1/1) ... [2025-01-09 13:52:08,931 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:52:08" (1/1) ... [2025-01-09 13:52:08,969 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-01-09 13:52:08,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:52:08,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:52:08,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:52:08,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:52:08,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:08,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:08,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,003 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:52:09,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:52:09,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:52:09,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:52:09,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:52:09,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (1/1) ... [2025-01-09 13:52:09,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:52:09,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:52:09,057 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:52:09,064 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:52:09,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:52:09,084 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:52:09,084 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:52:09,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:52:09,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:52:09,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:52:09,155 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:52:09,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:52:09,433 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 13:52:09,433 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:52:09,445 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:52:09,446 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:52:09,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:52:09 BoogieIcfgContainer [2025-01-09 13:52:09,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:52:09,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:52:09,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:52:09,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:52:09,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:52:08" (1/3) ... [2025-01-09 13:52:09,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b22208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:52:09, skipping insertion in model container [2025-01-09 13:52:09,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:08" (2/3) ... [2025-01-09 13:52:09,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b22208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:52:09, skipping insertion in model container [2025-01-09 13:52:09,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:52:09" (3/3) ... [2025-01-09 13:52:09,459 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-26.i [2025-01-09 13:52:09,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:52:09,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-26.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:52:09,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:52:09,543 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;@38ecf59b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:52:09,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:52:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:52:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:52:09,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:52:09,558 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:52:09,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:52:09,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:52:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1193522991, now seen corresponding path program 1 times [2025-01-09 13:52:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:52:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388578804] [2025-01-09 13:52:09,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:52:09,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:52:09,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:52:09,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:09,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:52:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:52:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:52:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388578804] [2025-01-09 13:52:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388578804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:52:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581272298] [2025-01-09 13:52:09,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:09,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:52:09,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:52:09,920 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:52:09,923 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:52:10,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:52:10,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:52:10,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:10,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:52:10,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:52:10,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:52:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:52:10,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:52:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581272298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:52:10,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:52:10,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:52:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381310804] [2025-01-09 13:52:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:52:10,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:52:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:52:10,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:52:10,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:52:10,192 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:52:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:52:10,213 INFO L93 Difference]: Finished difference Result 112 states and 189 transitions. [2025-01-09 13:52:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:52:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2025-01-09 13:52:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:52:10,222 INFO L225 Difference]: With dead ends: 112 [2025-01-09 13:52:10,223 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 13:52:10,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:52:10,231 INFO L435 NwaCegarLoop]: 83 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, 83 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:52:10,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:52:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 13:52:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 13:52:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:52:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-01-09 13:52:10,277 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 118 [2025-01-09 13:52:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:52:10,277 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-01-09 13:52:10,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:52:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-01-09 13:52:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:52:10,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:52:10,280 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:52:10,287 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:52:10,481 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:52:10,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:52:10,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:52:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash 343092915, now seen corresponding path program 1 times [2025-01-09 13:52:10,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:52:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528714949] [2025-01-09 13:52:10,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:52:10,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:52:10,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:52:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:52:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:52:11,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:52:11,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528714949] [2025-01-09 13:52:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528714949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:52:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:52:11,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:52:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316255730] [2025-01-09 13:52:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:52:11,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:52:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:52:11,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:52:11,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:52:11,175 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:52:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:52:11,260 INFO L93 Difference]: Finished difference Result 136 states and 200 transitions. [2025-01-09 13:52:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:52:11,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-01-09 13:52:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:52:11,263 INFO L225 Difference]: With dead ends: 136 [2025-01-09 13:52:11,265 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 13:52:11,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:52:11,267 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 34 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:52:11,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 194 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:52:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 13:52:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-01-09 13:52:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:52:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2025-01-09 13:52:11,289 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 118 [2025-01-09 13:52:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:52:11,290 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2025-01-09 13:52:11,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:52:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2025-01-09 13:52:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:52:11,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:52:11,295 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:52:11,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:52:11,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:52:11,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:52:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1476035691, now seen corresponding path program 1 times [2025-01-09 13:52:11,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:52:11,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231637012] [2025-01-09 13:52:11,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:52:11,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:52:11,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:52:11,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:11,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:52:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:52:11,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:52:11,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231637012] [2025-01-09 13:52:11,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231637012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:52:11,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:52:11,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:52:11,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521178838] [2025-01-09 13:52:11,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:52:11,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:52:11,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:52:11,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:52:11,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:52:11,844 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:52:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:52:12,193 INFO L93 Difference]: Finished difference Result 236 states and 351 transitions. [2025-01-09 13:52:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:52:12,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:52:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:52:12,198 INFO L225 Difference]: With dead ends: 236 [2025-01-09 13:52:12,198 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 13:52:12,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:52:12,203 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 72 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:52:12,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 266 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:52:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 13:52:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 122. [2025-01-09 13:52:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 80 states have internal predecessors, (101), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:52:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2025-01-09 13:52:12,254 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 119 [2025-01-09 13:52:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:52:12,254 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2025-01-09 13:52:12,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:52:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2025-01-09 13:52:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:52:12,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:52:12,259 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:52:12,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:52:12,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:52:12,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:52:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2117867027, now seen corresponding path program 1 times [2025-01-09 13:52:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:52:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958099650] [2025-01-09 13:52:12,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:52:12,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:52:12,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:52:12,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:12,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:52:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830576076] [2025-01-09 13:52:12,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:52:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:52:12,408 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:52:12,410 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:52:12,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:52:12,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:52:12,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:12,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:52:12,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:52:12,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:52:12,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:52:12,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:12,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:52:12,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:52:12,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:52:12,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:52:12,980 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:52:13,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:52:13,174 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 13:52:13,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:52:13,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:52:13 BoogieIcfgContainer [2025-01-09 13:52:13,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:52:13,277 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:52:13,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:52:13,277 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:52:13,278 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:52:09" (3/4) ... [2025-01-09 13:52:13,280 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:52:13,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:52:13,282 INFO L158 Benchmark]: Toolchain (without parser) took 4663.78ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 57.8MB in the end (delta: 48.3MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2025-01-09 13:52:13,283 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:52:13,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.52ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:52:13,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.37ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:52:13,285 INFO L158 Benchmark]: Boogie Preprocessor took 49.16ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:52:13,285 INFO L158 Benchmark]: RCFGBuilder took 426.96ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 63.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:52:13,285 INFO L158 Benchmark]: TraceAbstraction took 3825.77ms. Allocated memory is still 142.6MB. Free memory was 62.7MB in the beginning and 57.9MB in the end (delta: 4.8MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2025-01-09 13:52:13,285 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:52:13,287 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.31ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.52ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.37ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.16ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 426.96ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 63.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3825.77ms. Allocated memory is still 142.6MB. Free memory was 62.7MB in the beginning and 57.9MB in the end (delta: 4.8MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned long int last_1_var_1_1 = 16; [L39] signed char last_1_var_1_9 = 10; [L40] unsigned short int last_1_var_1_12 = 10000; [L41] double last_1_var_1_20 = 1.5; [L42] unsigned char last_1_var_1_22 = 5; [L43] signed short int last_1_var_1_25 = 10; VAL [isInitial=0, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=-64, var_1_9=10] [L137] isInitial = 1 [L138] FCALL initially() [L140] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_12 = var_1_12 [L128] last_1_var_1_20 = var_1_20 [L129] last_1_var_1_22 = var_1_22 [L130] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=-64, var_1_9=10] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L98] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L100] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L101] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L102] var_1_11 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L103] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L104] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L104] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L105] var_1_13 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L109] var_1_18 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L111] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L114] var_1_23 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L115] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L116] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L116] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L117] var_1_24 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L118] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L119] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L119] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_4=3, var_1_9=10] [L120] var_1_26 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=10] [L121] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=10] [L122] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=10] [L122] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=10] [L141] RET updateVariables() [L142] CALL step() [L47] COND FALSE !(! var_1_10) [L54] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=4] [L56] unsigned char stepLocal_2 = var_1_10; [L57] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=4] [L58] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=4, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=4] [L59] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L62] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=4] [L65] unsigned long int stepLocal_5 = last_1_var_1_1; [L66] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L67] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=13, stepLocal_5=16, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=4] [L68] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L79] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=13, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=4] [L81] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L82] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=13, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_4=3, var_1_9=4] [L84] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L85] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=13, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_4=3, var_1_9=4] [L89] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=2, stepLocal_3=0, stepLocal_4=13, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_4=3, var_1_9=4] [L90] COND TRUE stepLocal_0 == var_1_25 [L91] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=13, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_4=3, var_1_9=4] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_4=3, var_1_9=4] [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_4=3, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=4, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_4=3, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 262 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2414/2448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:52:13,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-26.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 083c818f1746871af8e554be10a031d23ddeababa4f5d912dd8e11565e94e97f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:52:15,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:52:15,777 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:52:15,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:52:15,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:52:15,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:52:15,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:52:15,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:52:15,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:52:15,817 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:52:15,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:52:15,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:52:15,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:52:15,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:52:15,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:52:15,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:52:15,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:52:15,820 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:52:15,820 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:52:15,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:52:15,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:52:15,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:52:15,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:52:15,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:52:15,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:52:15,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:52:15,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:52:15,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:52:15,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:52:15,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:52:15,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:52:15,822 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 -> 083c818f1746871af8e554be10a031d23ddeababa4f5d912dd8e11565e94e97f [2025-01-09 13:52:16,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:52:16,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:52:16,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:52:16,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:52:16,114 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:52:16,115 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-26.i [2025-01-09 13:52:17,496 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/717de0eaa/c3ad1df7480c45218207d790d3643241/FLAG9856f44d7 [2025-01-09 13:52:17,779 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:52:17,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-26.i [2025-01-09 13:52:17,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/717de0eaa/c3ad1df7480c45218207d790d3643241/FLAG9856f44d7 [2025-01-09 13:52:18,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/717de0eaa/c3ad1df7480c45218207d790d3643241 [2025-01-09 13:52:18,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:52:18,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:52:18,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:52:18,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:52:18,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:52:18,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe856e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18, skipping insertion in model container [2025-01-09 13:52:18,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:52:18,258 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-26.i[915,928] [2025-01-09 13:52:18,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:52:18,328 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:52:18,337 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-26.i[915,928] [2025-01-09 13:52:18,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:52:18,375 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:52:18,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18 WrapperNode [2025-01-09 13:52:18,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:52:18,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:52:18,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:52:18,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:52:18,382 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:52:18" (1/1) ... [2025-01-09 13:52:18,391 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:52:18" (1/1) ... [2025-01-09 13:52:18,411 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-01-09 13:52:18,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:52:18,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:52:18,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:52:18,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:52:18,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,448 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:52:18,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:52:18,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:52:18,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:52:18,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:52:18,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (1/1) ... [2025-01-09 13:52:18,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:52:18,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:52:18,514 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:52:18,517 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:52:18,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:52:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:52:18,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:52:18,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:52:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:52:18,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:52:18,651 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:52:18,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:52:31,885 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 13:52:31,885 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:52:31,894 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:52:31,894 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:52:31,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:52:31 BoogieIcfgContainer [2025-01-09 13:52:31,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:52:31,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:52:31,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:52:31,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:52:31,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:52:18" (1/3) ... [2025-01-09 13:52:31,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff1adf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:52:31, skipping insertion in model container [2025-01-09 13:52:31,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:52:18" (2/3) ... [2025-01-09 13:52:31,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff1adf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:52:31, skipping insertion in model container [2025-01-09 13:52:31,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:52:31" (3/3) ... [2025-01-09 13:52:31,903 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-26.i [2025-01-09 13:52:31,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:52:31,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-26.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:52:31,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:52:31,964 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;@47df5c0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:52:31,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:52:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:52:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:52:31,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:52:31,978 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:52:31,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:52:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:52:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1193522991, now seen corresponding path program 1 times [2025-01-09 13:52:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:52:31,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118576091] [2025-01-09 13:52:31,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:31,997 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:52:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:52:32,000 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:52:32,001 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:52:32,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:52:32,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:52:32,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:32,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:52:32,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:52:32,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:52:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 13:52:32,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:52:32,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:52:32,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118576091] [2025-01-09 13:52:32,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118576091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:52:32,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:52:32,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:52:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980576796] [2025-01-09 13:52:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:52:32,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:52:32,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:52:32,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:52:32,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:52:32,976 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:52:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:52:33,002 INFO L93 Difference]: Finished difference Result 112 states and 189 transitions. [2025-01-09 13:52:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:52:33,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2025-01-09 13:52:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:52:33,013 INFO L225 Difference]: With dead ends: 112 [2025-01-09 13:52:33,013 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 13:52:33,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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:52:33,022 INFO L435 NwaCegarLoop]: 83 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, 83 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:52:33,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:52:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 13:52:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 13:52:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:52:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-01-09 13:52:33,068 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 118 [2025-01-09 13:52:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:52:33,068 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-01-09 13:52:33,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:52:33,069 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-01-09 13:52:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:52:33,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:52:33,072 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:52:33,095 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:52:33,273 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:52:33,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:52:33,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:52:33,275 INFO L85 PathProgramCache]: Analyzing trace with hash 343092915, now seen corresponding path program 1 times [2025-01-09 13:52:33,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:52:33,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377987573] [2025-01-09 13:52:33,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:33,276 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:52:33,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:52:33,280 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:52:33,281 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:52:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:52:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:52:34,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:34,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:52:34,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:52:34,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:52:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-01-09 13:52:36,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:52:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:52:37,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:52:37,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377987573] [2025-01-09 13:52:37,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377987573] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 13:52:37,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:52:37,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 13:52:37,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766205160] [2025-01-09 13:52:37,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:52:37,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:52:37,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:52:37,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:52:37,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:52:37,656 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:52:42,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:52:46,594 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:52:50,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:52:54,609 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:52:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:52:54,715 INFO L93 Difference]: Finished difference Result 136 states and 200 transitions. [2025-01-09 13:52:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:52:54,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-01-09 13:52:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:52:54,718 INFO L225 Difference]: With dead ends: 136 [2025-01-09 13:52:54,718 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 13:52:54,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:52:54,719 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:52:54,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 258 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2025-01-09 13:52:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 13:52:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-01-09 13:52:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:52:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2025-01-09 13:52:54,734 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 118 [2025-01-09 13:52:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:52:54,734 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2025-01-09 13:52:54,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:52:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2025-01-09 13:52:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:52:54,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:52:54,737 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:52:54,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:52:54,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:52:54,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:52:54,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:52:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1476035691, now seen corresponding path program 1 times [2025-01-09 13:52:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:52:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276775965] [2025-01-09 13:52:54,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:52:54,939 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:52:54,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:52:54,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:52:54,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:52:54,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:52:55,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:52:55,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:52:55,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:52:55,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 13:52:55,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:52:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:52:58,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:52:58,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:52:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276775965] [2025-01-09 13:52:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276775965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:52:58,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:52:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:52:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836310761] [2025-01-09 13:52:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:52:58,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:52:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:52:58,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:52:58,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:52:58,501 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:53:05,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:53:09,324 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:53:13,334 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:53:17,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:53:21,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:53:25,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:53:29,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:53:33,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:53:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:33,826 INFO L93 Difference]: Finished difference Result 241 states and 356 transitions. [2025-01-09 13:53:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:53:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 13:53:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:33,913 INFO L225 Difference]: With dead ends: 241 [2025-01-09 13:53:33,913 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 13:53:33,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:53:33,914 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 37 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:33,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 275 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 72 Invalid, 8 Unknown, 0 Unchecked, 35.1s Time] [2025-01-09 13:53:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 13:53:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. [2025-01-09 13:53:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 92 states have internal predecessors, (120), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:53:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 198 transitions. [2025-01-09 13:53:33,952 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 198 transitions. Word has length 119 [2025-01-09 13:53:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:33,952 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 198 transitions. [2025-01-09 13:53:33,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:53:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 198 transitions. [2025-01-09 13:53:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:53:33,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:33,954 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:33,978 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 (4)] Ended with exit code 0 [2025-01-09 13:53:34,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:53:34,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:34,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2117867027, now seen corresponding path program 1 times [2025-01-09 13:53:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:53:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307879191] [2025-01-09 13:53:34,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:34,157 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:53:34,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:53:34,160 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:53:34,161 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:53:34,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:53:34,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:53:34,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:34,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:34,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 13:53:34,962 INFO L279 TraceCheckSpWp]: Computing forward predicates...