./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.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 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:22:05,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:22:05,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:22:05,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:22:05,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:22:05,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:22:05,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:22:05,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:22:05,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:22:05,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:22:05,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:22:05,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:22:05,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:22:05,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:22:05,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:22:05,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:22:05,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:22:05,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:22:05,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:22:05,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:22:05,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:22:05,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:22:05,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:22:05,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:22:05,793 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 -> 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 [2025-02-06 01:22:06,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:22:06,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:22:06,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:22:06,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:22:06,166 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:22:06,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-02-06 01:22:07,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b75c0287/bc1e1229c6bf40be94910b29249f1de1/FLAGb3bee3303 [2025-02-06 01:22:07,769 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:22:07,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-02-06 01:22:07,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b75c0287/bc1e1229c6bf40be94910b29249f1de1/FLAGb3bee3303 [2025-02-06 01:22:07,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b75c0287/bc1e1229c6bf40be94910b29249f1de1 [2025-02-06 01:22:07,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:22:07,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:22:07,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:22:07,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:22:07,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:22:07,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:07" (1/1) ... [2025-02-06 01:22:07,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0644f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:07, skipping insertion in model container [2025-02-06 01:22:07,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:07" (1/1) ... [2025-02-06 01:22:07,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:22:07,970 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_25-while_file-33.i[915,928] [2025-02-06 01:22:08,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:22:08,039 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:22:08,053 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_25-while_file-33.i[915,928] [2025-02-06 01:22:08,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:22:08,102 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:22:08,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08 WrapperNode [2025-02-06 01:22:08,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:22:08,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:22:08,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:22:08,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:22:08,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,147 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-02-06 01:22:08,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:22:08,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:22:08,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:22:08,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:22:08,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,185 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:22:08,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:22:08,207 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:22:08,207 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:22:08,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:22:08,208 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (1/1) ... [2025-02-06 01:22:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:22:08,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:22:08,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:22:08,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:22:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:22:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:22:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:22:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:22:08,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:22:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:22:08,342 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:22:08,344 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:22:08,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: havoc property_#t~bitwise10#1; [2025-02-06 01:22:08,574 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 01:22:08,575 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:22:08,593 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:22:08,593 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:22:08,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:08 BoogieIcfgContainer [2025-02-06 01:22:08,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:22:08,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:22:08,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:22:08,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:22:08,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:07" (1/3) ... [2025-02-06 01:22:08,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b50bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:08, skipping insertion in model container [2025-02-06 01:22:08,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:08" (2/3) ... [2025-02-06 01:22:08,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b50bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:08, skipping insertion in model container [2025-02-06 01:22:08,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:08" (3/3) ... [2025-02-06 01:22:08,603 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-33.i [2025-02-06 01:22:08,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:22:08,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-33.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:22:08,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:22:08,695 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;@376c80c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:22:08,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:22:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 01:22:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 01:22:08,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:08,708 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:08,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:08,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1547355872, now seen corresponding path program 1 times [2025-02-06 01:22:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643766357] [2025-02-06 01:22:08,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:08,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:22:08,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:22:08,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:08,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-06 01:22:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643766357] [2025-02-06 01:22:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643766357] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:22:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630831493] [2025-02-06 01:22:08,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:22:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:22:08,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:22:08,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:22:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:22:09,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:22:09,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:09,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:09,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:22:09,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-06 01:22:09,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:22:09,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630831493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:09,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:22:09,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:22:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843717852] [2025-02-06 01:22:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:09,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:22:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:09,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:22:09,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:22:09,108 INFO L87 Difference]: Start difference. First operand has 50 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 01:22:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:09,131 INFO L93 Difference]: Finished difference Result 92 states and 143 transitions. [2025-02-06 01:22:09,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:22:09,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-02-06 01:22:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:09,141 INFO L225 Difference]: With dead ends: 92 [2025-02-06 01:22:09,142 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 01:22:09,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:22:09,150 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:09,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:22:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 01:22:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 01:22:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 01:22:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2025-02-06 01:22:09,193 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 65 [2025-02-06 01:22:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:09,194 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2025-02-06 01:22:09,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 01:22:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2025-02-06 01:22:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 01:22:09,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:09,198 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:09,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:22:09,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:22:09,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:09,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash 836353918, now seen corresponding path program 1 times [2025-02-06 01:22:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722960565] [2025-02-06 01:22:09,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:09,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 01:22:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 01:22:09,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722960565] [2025-02-06 01:22:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722960565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:09,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:09,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:22:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986684899] [2025-02-06 01:22:09,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:09,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:22:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:09,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:22:09,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:22:09,641 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:09,772 INFO L93 Difference]: Finished difference Result 140 states and 190 transitions. [2025-02-06 01:22:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:22:09,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2025-02-06 01:22:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:09,775 INFO L225 Difference]: With dead ends: 140 [2025-02-06 01:22:09,777 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 01:22:09,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:22:09,779 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 80 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:09,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 154 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:22:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 01:22:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-02-06 01:22:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:22:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2025-02-06 01:22:09,799 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 65 [2025-02-06 01:22:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:09,800 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2025-02-06 01:22:09,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2025-02-06 01:22:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 01:22:09,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:09,804 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:09,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:22:09,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:09,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -358646876, now seen corresponding path program 1 times [2025-02-06 01:22:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771884915] [2025-02-06 01:22:09,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:09,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 01:22:09,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 01:22:09,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:09,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771884915] [2025-02-06 01:22:10,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771884915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:10,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:10,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:22:10,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204884083] [2025-02-06 01:22:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:22:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:10,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:22:10,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:22:10,085 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:10,236 INFO L93 Difference]: Finished difference Result 183 states and 240 transitions. [2025-02-06 01:22:10,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:22:10,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-02-06 01:22:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:10,238 INFO L225 Difference]: With dead ends: 183 [2025-02-06 01:22:10,238 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 01:22:10,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:22:10,240 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 75 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:10,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 232 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:22:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 01:22:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-02-06 01:22:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 69 states have internal predecessors, (84), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:22:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2025-02-06 01:22:10,259 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 69 [2025-02-06 01:22:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:10,259 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2025-02-06 01:22:10,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2025-02-06 01:22:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 01:22:10,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:10,262 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:10,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:22:10,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:10,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1148904933, now seen corresponding path program 1 times [2025-02-06 01:22:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071513219] [2025-02-06 01:22:10,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:10,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 01:22:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 01:22:10,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:10,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071513219] [2025-02-06 01:22:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071513219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:22:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153782587] [2025-02-06 01:22:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:11,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:22:11,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:11,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:22:11,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:22:11,119 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:11,379 INFO L93 Difference]: Finished difference Result 225 states and 293 transitions. [2025-02-06 01:22:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:22:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-02-06 01:22:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:11,382 INFO L225 Difference]: With dead ends: 225 [2025-02-06 01:22:11,382 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 01:22:11,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:22:11,383 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:11,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 224 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:22:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 01:22:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2025-02-06 01:22:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 88 states have internal predecessors, (103), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 01:22:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2025-02-06 01:22:11,413 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 69 [2025-02-06 01:22:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:11,413 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2025-02-06 01:22:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2025-02-06 01:22:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 01:22:11,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:11,415 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:11,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:22:11,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:11,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -648046426, now seen corresponding path program 1 times [2025-02-06 01:22:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650579546] [2025-02-06 01:22:11,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:11,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 01:22:11,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 01:22:11,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:11,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:14,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:14,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650579546] [2025-02-06 01:22:14,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650579546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:14,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:14,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 01:22:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695041454] [2025-02-06 01:22:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:14,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 01:22:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:14,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 01:22:14,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:22:14,354 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:15,480 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2025-02-06 01:22:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 01:22:15,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-02-06 01:22:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:15,482 INFO L225 Difference]: With dead ends: 163 [2025-02-06 01:22:15,482 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 01:22:15,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2025-02-06 01:22:15,483 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 128 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:15,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 290 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 01:22:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 01:22:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 125. [2025-02-06 01:22:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 97 states have internal predecessors, (113), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 01:22:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 161 transitions. [2025-02-06 01:22:15,507 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 161 transitions. Word has length 69 [2025-02-06 01:22:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:15,508 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 161 transitions. [2025-02-06 01:22:15,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 161 transitions. [2025-02-06 01:22:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 01:22:15,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:15,511 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:15,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:22:15,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:15,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1394752738, now seen corresponding path program 1 times [2025-02-06 01:22:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:15,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450536271] [2025-02-06 01:22:15,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:15,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 01:22:15,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 01:22:15,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:15,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450536271] [2025-02-06 01:22:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450536271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:17,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 01:22:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81620206] [2025-02-06 01:22:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:17,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 01:22:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:17,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 01:22:17,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:22:17,856 INFO L87 Difference]: Start difference. First operand 125 states and 161 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:19,016 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2025-02-06 01:22:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 01:22:19,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2025-02-06 01:22:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:19,018 INFO L225 Difference]: With dead ends: 157 [2025-02-06 01:22:19,018 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 01:22:19,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-02-06 01:22:19,019 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 195 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:19,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 254 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:22:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 01:22:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2025-02-06 01:22:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 106 states have (on average 1.169811320754717) internal successors, (124), 106 states have internal predecessors, (124), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 01:22:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2025-02-06 01:22:19,050 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 70 [2025-02-06 01:22:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:19,052 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2025-02-06 01:22:19,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2025-02-06 01:22:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 01:22:19,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:19,059 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:19,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:22:19,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:19,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1637046944, now seen corresponding path program 1 times [2025-02-06 01:22:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571278830] [2025-02-06 01:22:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:19,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 01:22:19,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 01:22:19,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:19,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-02-06 01:22:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:19,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571278830] [2025-02-06 01:22:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571278830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:22:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761460913] [2025-02-06 01:22:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:19,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:22:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:19,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:22:19,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:22:19,159 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:22:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:19,178 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2025-02-06 01:22:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:22:19,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-02-06 01:22:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:19,180 INFO L225 Difference]: With dead ends: 138 [2025-02-06 01:22:19,181 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 01:22:19,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:22:19,185 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:19,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:22:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 01:22:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-02-06 01:22:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:22:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2025-02-06 01:22:19,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 133 [2025-02-06 01:22:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:19,206 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2025-02-06 01:22:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 01:22:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2025-02-06 01:22:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 01:22:19,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:19,211 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:19,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 01:22:19,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1485043914, now seen corresponding path program 1 times [2025-02-06 01:22:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788988508] [2025-02-06 01:22:19,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:19,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 01:22:19,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 01:22:19,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:19,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-02-06 01:22:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:22:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788988508] [2025-02-06 01:22:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788988508] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:22:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899035038] [2025-02-06 01:22:19,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:19,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:22:19,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:22:19,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:22:19,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:22:19,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 01:22:19,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 01:22:19,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:19,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 01:22:19,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 332 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-02-06 01:22:25,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:22:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 51 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 01:22:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899035038] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:22:27,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:22:27,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2025-02-06 01:22:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424193347] [2025-02-06 01:22:27,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:22:27,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 01:22:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:22:27,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 01:22:27,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:22:27,900 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 01:22:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:28,111 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2025-02-06 01:22:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 01:22:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 135 [2025-02-06 01:22:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:28,113 INFO L225 Difference]: With dead ends: 157 [2025-02-06 01:22:28,113 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 01:22:28,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-02-06 01:22:28,114 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 72 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:28,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 238 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:22:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 01:22:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-02-06 01:22:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:22:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-02-06 01:22:28,133 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 135 [2025-02-06 01:22:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:28,134 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-02-06 01:22:28,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-02-06 01:22:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-02-06 01:22:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 01:22:28,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:28,135 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:28,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:22:28,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:22:28,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:28,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash -17046654, now seen corresponding path program 1 times [2025-02-06 01:22:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:22:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006000975] [2025-02-06 01:22:28,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:22:28,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:22:28,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:22:28,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:28,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:22:28,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761713725] [2025-02-06 01:22:28,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:28,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:22:28,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:22:28,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:22:28,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 01:22:28,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:22:28,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:22:28,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:28,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:22:28,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:22:28,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:22:28,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:22:28,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:28,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:22:28,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:22:28,784 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:22:28,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:22:28,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 01:22:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:22:28,995 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:29,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:22:29,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:22:29 BoogieIcfgContainer [2025-02-06 01:22:29,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:22:29,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:22:29,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:22:29,081 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:22:29,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:08" (3/4) ... [2025-02-06 01:22:29,084 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:22:29,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:22:29,085 INFO L158 Benchmark]: Toolchain (without parser) took 21290.12ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 111.3MB in the beginning and 601.5MB in the end (delta: -490.3MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-02-06 01:22:29,086 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:22:29,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.11ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 98.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:22:29,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.59ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:22:29,087 INFO L158 Benchmark]: Boogie Preprocessor took 58.27ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:22:29,087 INFO L158 Benchmark]: IcfgBuilder took 386.63ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 77.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:22:29,088 INFO L158 Benchmark]: TraceAbstraction took 20484.04ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 76.9MB in the beginning and 605.9MB in the end (delta: -529.0MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2025-02-06 01:22:29,088 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 687.9MB. Free memory was 605.9MB in the beginning and 601.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:22:29,090 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.32ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.11ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 98.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.59ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.27ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 386.63ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 77.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20484.04ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 76.9MB in the beginning and 605.9MB in the end (delta: -529.0MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 687.9MB. Free memory was 605.9MB in the beginning and 601.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] unsigned char var_1_7 = 200; [L24] unsigned char var_1_8 = 4; [L25] signed char var_1_9 = 50; [L26] signed char var_1_12 = -5; [L27] float var_1_13 = 999999999999.8; [L28] float var_1_14 = 100.5; [L29] float var_1_15 = 32.75; [L30] unsigned char var_1_16 = 1; [L31] unsigned char var_1_17 = 1; [L32] unsigned char var_1_18 = 128; [L33] unsigned char last_1_var_1_7 = 200; [L34] signed char last_1_var_1_9 = 50; VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=4, var_1_9=50] [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=4, var_1_9=50] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-272, var_1_7=200, var_1_8=1, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=200, var_1_8=1, var_1_9=50] [L46] COND TRUE var_1_18 == var_1_18 [L47] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L49] signed short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_3=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L50] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L53] signed short int stepLocal_2 = var_1_1; [L54] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L55] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L56] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND FALSE !(!(cond)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L93] RET __VERIFIER_assert(property()) [L94] isInitial = 0 VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=-130, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=126, var_1_7=1, var_1_8=-130, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=1, var_1_8=-130, var_1_9=50] [L46] COND TRUE var_1_18 == var_1_18 [L47] var_1_7 = var_1_8 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L49] signed short int stepLocal_3 = var_1_1; VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_3=126, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L50] COND TRUE var_1_18 == stepLocal_3 [L51] var_1_13 = (var_1_14 - var_1_15) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L53] signed short int stepLocal_2 = var_1_1; [L54] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=126, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L55] COND TRUE \read(var_1_16) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=126, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L56] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_2=126, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] [L19] reach_error() VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=-130, var_1_1=126, var_1_7=-130, var_1_8=-130, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 635 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 1550 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1153 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 397 mSDtfsCounter, 789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=6, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 107 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1149 NumberOfCodeBlocks, 1149 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 5163 SizeOfPredicates, 15 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 2761/2832 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 01:22:29,146 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_25-while_file-33.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 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:22:31,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:22:31,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:22:31,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:22:31,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:22:31,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:22:31,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:22:31,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:22:31,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:22:31,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:22:31,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:22:31,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:22:31,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:22:31,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:22:31,680 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:22:31,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:22:31,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:22:31,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:22:31,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:22:31,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:22:31,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:22:31,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:22:31,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:22:31,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:22:31,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:22:31,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:22:31,684 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 -> 4d07f6d4eb00f77dbf0a6f761a1dfb43bb3a584f994c1eafe03cf0135e1262b3 [2025-02-06 01:22:31,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:22:31,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:22:31,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:22:31,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:22:31,970 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:22:31,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-02-06 01:22:33,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94de7a16d/3f45f0cb27984928911bccd8e59eebbf/FLAGd5d652d68 [2025-02-06 01:22:33,618 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:22:33,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2025-02-06 01:22:33,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94de7a16d/3f45f0cb27984928911bccd8e59eebbf/FLAGd5d652d68 [2025-02-06 01:22:33,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94de7a16d/3f45f0cb27984928911bccd8e59eebbf [2025-02-06 01:22:33,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:22:33,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:22:33,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:22:33,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:22:33,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:22:33,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:33" (1/1) ... [2025-02-06 01:22:33,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f65e988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:33, skipping insertion in model container [2025-02-06 01:22:33,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:33" (1/1) ... [2025-02-06 01:22:33,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:22:34,131 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_25-while_file-33.i[915,928] [2025-02-06 01:22:34,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:22:34,210 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:22:34,220 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_25-while_file-33.i[915,928] [2025-02-06 01:22:34,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:22:34,271 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:22:34,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34 WrapperNode [2025-02-06 01:22:34,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:22:34,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:22:34,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:22:34,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:22:34,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,316 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-02-06 01:22:34,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:22:34,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:22:34,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:22:34,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:22:34,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,355 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:22:34,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:22:34,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:22:34,376 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:22:34,376 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:22:34,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (1/1) ... [2025-02-06 01:22:34,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:22:34,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:22:34,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:22:34,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:22:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:22:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:22:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:22:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:22:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:22:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:22:34,505 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:22:34,508 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:22:34,878 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 01:22:34,879 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:22:34,891 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:22:34,891 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:22:34,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:34 BoogieIcfgContainer [2025-02-06 01:22:34,892 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:22:34,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:22:34,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:22:34,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:22:34,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:33" (1/3) ... [2025-02-06 01:22:34,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e33f731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:34, skipping insertion in model container [2025-02-06 01:22:34,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:34" (2/3) ... [2025-02-06 01:22:34,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e33f731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:34, skipping insertion in model container [2025-02-06 01:22:34,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:34" (3/3) ... [2025-02-06 01:22:34,901 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-33.i [2025-02-06 01:22:34,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:22:34,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-33.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:22:34,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:22:34,978 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;@7289952d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:22:34,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:22:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 01:22:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 01:22:34,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:34,987 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:34,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:34,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1218629726, now seen corresponding path program 1 times [2025-02-06 01:22:35,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:22:35,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044771837] [2025-02-06 01:22:35,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:35,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:35,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:22:35,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:22:35,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 01:22:35,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 01:22:35,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 01:22:35,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:35,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:35,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:22:35,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 01:22:35,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:22:35,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:22:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044771837] [2025-02-06 01:22:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044771837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:22:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596699247] [2025-02-06 01:22:35,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:35,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:22:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:22:35,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:22:35,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:22:35,242 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 01:22:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:35,263 INFO L93 Difference]: Finished difference Result 74 states and 113 transitions. [2025-02-06 01:22:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:22:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2025-02-06 01:22:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:35,269 INFO L225 Difference]: With dead ends: 74 [2025-02-06 01:22:35,269 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 01:22:35,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:22:35,273 INFO L435 NwaCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:35,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:22:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 01:22:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 01:22:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 01:22:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-02-06 01:22:35,303 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 61 [2025-02-06 01:22:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:35,303 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-02-06 01:22:35,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 01:22:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-02-06 01:22:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 01:22:35,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:35,309 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:35,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 01:22:35,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:35,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:35,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:35,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1952630780, now seen corresponding path program 1 times [2025-02-06 01:22:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:22:35,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882280201] [2025-02-06 01:22:35,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:35,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:22:35,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:22:35,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 01:22:35,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 01:22:35,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 01:22:35,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:35,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:35,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 01:22:35,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:35,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:22:35,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:22:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882280201] [2025-02-06 01:22:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882280201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:35,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:35,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:22:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361352390] [2025-02-06 01:22:35,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:22:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:22:35,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:22:35,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:22:35,938 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:36,218 INFO L93 Difference]: Finished difference Result 112 states and 148 transitions. [2025-02-06 01:22:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:22:36,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-06 01:22:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:36,224 INFO L225 Difference]: With dead ends: 112 [2025-02-06 01:22:36,224 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 01:22:36,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:22:36,225 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:36,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:22:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 01:22:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2025-02-06 01:22:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:22:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-02-06 01:22:36,244 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 61 [2025-02-06 01:22:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:36,244 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-02-06 01:22:36,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-02-06 01:22:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 01:22:36,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:36,246 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:36,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 01:22:36,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:36,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:36,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 155679421, now seen corresponding path program 1 times [2025-02-06 01:22:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:22:36,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488467931] [2025-02-06 01:22:36,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:36,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:36,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:22:36,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:22:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 01:22:36,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 01:22:36,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 01:22:36,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:36,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:36,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 01:22:36,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:36,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:22:36,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:22:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488467931] [2025-02-06 01:22:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488467931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:36,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:22:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181219881] [2025-02-06 01:22:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:22:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:22:36,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:22:36,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:22:36,822 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:37,193 INFO L93 Difference]: Finished difference Result 213 states and 288 transitions. [2025-02-06 01:22:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:22:37,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-06 01:22:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:37,196 INFO L225 Difference]: With dead ends: 213 [2025-02-06 01:22:37,196 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 01:22:37,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:22:37,197 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 73 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:37,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 254 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:22:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 01:22:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 93. [2025-02-06 01:22:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 01:22:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2025-02-06 01:22:37,219 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 61 [2025-02-06 01:22:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:37,220 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2025-02-06 01:22:37,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2025-02-06 01:22:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 01:22:37,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:37,221 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:37,227 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-02-06 01:22:37,421 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-02-06 01:22:37,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:37,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1043183102, now seen corresponding path program 1 times [2025-02-06 01:22:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:22:37,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881155188] [2025-02-06 01:22:37,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:22:37,425 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-02-06 01:22:37,426 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-02-06 01:22:37,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 01:22:37,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 01:22:37,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:37,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:37,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 01:22:37,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 01:22:37,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:22:37,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:22:37,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881155188] [2025-02-06 01:22:37,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881155188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:37,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:37,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:22:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108095737] [2025-02-06 01:22:37,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:37,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:22:37,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:22:37,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:22:37,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:22:37,689 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 01:22:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:38,076 INFO L93 Difference]: Finished difference Result 189 states and 238 transitions. [2025-02-06 01:22:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:22:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2025-02-06 01:22:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:38,083 INFO L225 Difference]: With dead ends: 189 [2025-02-06 01:22:38,083 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 01:22:38,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-02-06 01:22:38,084 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:38,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 88 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:22:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 01:22:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2025-02-06 01:22:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.108433734939759) internal successors, (92), 83 states have internal predecessors, (92), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 01:22:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2025-02-06 01:22:38,113 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 61 [2025-02-06 01:22:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:38,113 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2025-02-06 01:22:38,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 01:22:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2025-02-06 01:22:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 01:22:38,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:38,115 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:38,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-02-06 01:22:38,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:38,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:38,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2045935732, now seen corresponding path program 1 times [2025-02-06 01:22:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:22:38,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887934061] [2025-02-06 01:22:38,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:38,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:22:38,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:22:38,322 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 (6)] Waiting until timeout for monitored process [2025-02-06 01:22:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 01:22:38,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 01:22:38,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:38,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:38,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 01:22:38,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:51,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:22:51,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:22:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887934061] [2025-02-06 01:22:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887934061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:51,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:22:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458095534] [2025-02-06 01:22:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:51,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:22:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:22:51,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:22:51,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:22:51,633 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:52,082 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2025-02-06 01:22:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:22:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 62 [2025-02-06 01:22:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:52,084 INFO L225 Difference]: With dead ends: 128 [2025-02-06 01:22:52,084 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 01:22:52,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-06 01:22:52,085 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:52,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 192 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:22:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 01:22:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-02-06 01:22:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 90 states have internal predecessors, (101), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 01:22:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2025-02-06 01:22:52,105 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 62 [2025-02-06 01:22:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:52,106 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2025-02-06 01:22:52,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2025-02-06 01:22:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 01:22:52,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:52,107 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:52,113 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 (6)] Ended with exit code 0 [2025-02-06 01:22:52,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:52,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:52,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:52,308 INFO L85 PathProgramCache]: Analyzing trace with hash 972857659, now seen corresponding path program 1 times [2025-02-06 01:22:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:22:52,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245822828] [2025-02-06 01:22:52,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:52,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:52,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:22:52,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:22:52,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 01:22:52,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 01:22:52,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 01:22:52,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:52,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:52,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:22:52,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:22:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 01:22:52,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:22:52,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:22:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245822828] [2025-02-06 01:22:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245822828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:22:52,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:22:52,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:22:52,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505773024] [2025-02-06 01:22:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:22:52,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:22:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:22:52,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:22:52,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:22:52,439 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:22:52,554 INFO L93 Difference]: Finished difference Result 128 states and 152 transitions. [2025-02-06 01:22:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:22:52,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2025-02-06 01:22:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:22:52,559 INFO L225 Difference]: With dead ends: 128 [2025-02-06 01:22:52,560 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 01:22:52,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:22:52,561 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:22:52,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:22:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 01:22:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-02-06 01:22:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 01:22:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-02-06 01:22:52,578 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 63 [2025-02-06 01:22:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:22:52,578 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-02-06 01:22:52,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-06 01:22:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-02-06 01:22:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 01:22:52,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:22:52,580 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:22:52,587 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 (7)] Ended with exit code 0 [2025-02-06 01:22:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:52,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:22:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:22:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1135928111, now seen corresponding path program 1 times [2025-02-06 01:22:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:22:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786299018] [2025-02-06 01:22:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:22:52,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:22:52,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:22:52,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:22:52,785 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 (8)] Waiting until timeout for monitored process [2025-02-06 01:22:52,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 01:22:52,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 01:22:52,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:22:52,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:22:52,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 01:22:52,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:23:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 347 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 01:23:15,017 INFO L312 TraceCheckSpWp]: Computing backward predicates...