./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:42:03,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:42:03,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:42:03,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:42:03,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:42:03,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:42:03,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:42:03,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:42:03,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:42:03,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:42:03,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:42:03,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:42:03,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:42:03,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:42:03,471 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:42:03,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:42:03,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:42:03,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:42:03,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:42:03,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:42:03,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:42:03,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:03,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:42:03,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:42:03,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:42:03,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:03,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:42:03,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:42:03,474 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2025-01-09 12:42:03,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:42:03,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:42:03,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:42:03,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:42:03,706 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:42:03,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-01-09 12:42:04,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c259558c/8b16aeb423d74c0d9818763c3fada9ca/FLAG4fed90ef5 [2025-01-09 12:42:05,033 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:42:05,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-01-09 12:42:05,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c259558c/8b16aeb423d74c0d9818763c3fada9ca/FLAG4fed90ef5 [2025-01-09 12:42:05,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c259558c/8b16aeb423d74c0d9818763c3fada9ca [2025-01-09 12:42:05,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:42:05,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:42:05,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:42:05,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:42:05,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:42:05,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f0e96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05, skipping insertion in model container [2025-01-09 12:42:05,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:42:05,521 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_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-01-09 12:42:05,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:42:05,572 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:42:05,581 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_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-01-09 12:42:05,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:42:05,621 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:42:05,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05 WrapperNode [2025-01-09 12:42:05,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:42:05,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:42:05,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:42:05,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:42:05,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,675 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2025-01-09 12:42:05,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:42:05,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:42:05,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:42:05,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:42:05,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,690 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:42:05,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:42:05,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:42:05,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:42:05,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:42:05,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (1/1) ... [2025-01-09 12:42:05,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:05,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:42:05,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:42:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:42:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:42:05,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:42:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:42:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:42:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:42:05,805 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:42:05,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:42:06,024 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 12:42:06,024 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:42:06,029 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:42:06,030 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:42:06,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:42:06 BoogieIcfgContainer [2025-01-09 12:42:06,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:42:06,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:42:06,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:42:06,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:42:06,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:42:05" (1/3) ... [2025-01-09 12:42:06,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cee001b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:42:06, skipping insertion in model container [2025-01-09 12:42:06,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:05" (2/3) ... [2025-01-09 12:42:06,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cee001b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:42:06, skipping insertion in model container [2025-01-09 12:42:06,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:42:06" (3/3) ... [2025-01-09 12:42:06,036 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2025-01-09 12:42:06,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:42:06,047 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-43.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:42:06,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:42:06,107 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;@46514653, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:42:06,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:42:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:42:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:42:06,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:06,121 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:06,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:06,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1955824334, now seen corresponding path program 1 times [2025-01-09 12:42:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643817956] [2025-01-09 12:42:06,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:06,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:42:06,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:42:06,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:06,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:42:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:06,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643817956] [2025-01-09 12:42:06,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643817956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:42:06,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268440543] [2025-01-09 12:42:06,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:06,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:06,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:06,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:42:06,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:42:06,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:42:06,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:42:06,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:06,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:06,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:42:06,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:42:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:42:06,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:42:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268440543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:42:06,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:42:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387110664] [2025-01-09 12:42:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:06,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:42:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:06,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:42:06,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:42:06,528 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:42:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:06,552 INFO L93 Difference]: Finished difference Result 154 states and 261 transitions. [2025-01-09 12:42:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:42:06,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2025-01-09 12:42:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:06,560 INFO L225 Difference]: With dead ends: 154 [2025-01-09 12:42:06,560 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 12:42:06,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:42:06,568 INFO L435 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:06,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:42:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 12:42:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 12:42:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:42:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2025-01-09 12:42:06,604 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 153 [2025-01-09 12:42:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:06,605 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2025-01-09 12:42:06,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:42:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2025-01-09 12:42:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:42:06,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:06,612 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:06,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:42:06,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:42:06,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:06,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1747766578, now seen corresponding path program 1 times [2025-01-09 12:42:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253413745] [2025-01-09 12:42:06,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:06,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:06,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:42:06,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:42:06,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:06,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253413745] [2025-01-09 12:42:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253413745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:42:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148808893] [2025-01-09 12:42:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:42:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:09,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:42:09,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:42:09,263 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:09,487 INFO L93 Difference]: Finished difference Result 174 states and 258 transitions. [2025-01-09 12:42:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:42:09,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2025-01-09 12:42:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:09,490 INFO L225 Difference]: With dead ends: 174 [2025-01-09 12:42:09,492 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 12:42:09,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:42:09,493 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:09,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 407 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:42:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 12:42:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2025-01-09 12:42:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:42:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2025-01-09 12:42:09,506 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 153 [2025-01-09 12:42:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:09,508 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2025-01-09 12:42:09,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2025-01-09 12:42:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:42:09,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:09,511 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:09,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:42:09,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:09,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1315050446, now seen corresponding path program 1 times [2025-01-09 12:42:09,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:09,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942232368] [2025-01-09 12:42:09,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:09,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:09,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:42:09,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:42:09,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:09,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:10,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942232368] [2025-01-09 12:42:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942232368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:10,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:10,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:42:10,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561347206] [2025-01-09 12:42:10,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:10,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:42:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:10,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:42:10,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:42:10,806 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:11,093 INFO L93 Difference]: Finished difference Result 196 states and 284 transitions. [2025-01-09 12:42:11,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:42:11,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2025-01-09 12:42:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:11,096 INFO L225 Difference]: With dead ends: 196 [2025-01-09 12:42:11,096 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 12:42:11,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:42:11,098 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 56 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:11,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 441 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:42:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 12:42:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2025-01-09 12:42:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:42:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2025-01-09 12:42:11,108 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 153 [2025-01-09 12:42:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:11,110 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2025-01-09 12:42:11,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2025-01-09 12:42:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 12:42:11,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:11,112 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:11,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:42:11,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:11,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1089551671, now seen corresponding path program 1 times [2025-01-09 12:42:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:11,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495002140] [2025-01-09 12:42:11,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:11,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 12:42:11,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 12:42:11,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:11,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495002140] [2025-01-09 12:42:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495002140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:11,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:42:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006791822] [2025-01-09 12:42:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:42:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:11,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:42:11,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:42:11,357 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:11,536 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2025-01-09 12:42:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:42:11,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2025-01-09 12:42:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:11,538 INFO L225 Difference]: With dead ends: 201 [2025-01-09 12:42:11,538 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 12:42:11,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:42:11,539 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 65 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:11,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 583 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:42:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 12:42:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2025-01-09 12:42:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 88 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 12:42:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2025-01-09 12:42:11,547 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 155 [2025-01-09 12:42:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:11,548 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2025-01-09 12:42:11,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2025-01-09 12:42:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 12:42:11,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:11,554 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:11,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:42:11,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:11,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash -656122717, now seen corresponding path program 1 times [2025-01-09 12:42:11,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:11,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925076776] [2025-01-09 12:42:11,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:11,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:11,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 12:42:11,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 12:42:11,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925076776] [2025-01-09 12:42:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925076776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:11,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:11,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:42:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794803492] [2025-01-09 12:42:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:11,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:42:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:11,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:42:11,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:42:11,882 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:11,953 INFO L93 Difference]: Finished difference Result 303 states and 450 transitions. [2025-01-09 12:42:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:42:11,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-01-09 12:42:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:11,955 INFO L225 Difference]: With dead ends: 303 [2025-01-09 12:42:11,955 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 12:42:11,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:42:11,956 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 74 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:11,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 655 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:42:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 12:42:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-01-09 12:42:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 125 states have (on average 1.328) internal successors, (166), 127 states have internal predecessors, (166), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2025-01-09 12:42:11,967 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 156 [2025-01-09 12:42:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:11,968 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2025-01-09 12:42:11,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2025-01-09 12:42:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 12:42:11,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:11,969 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:42:11,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash -180163154, now seen corresponding path program 1 times [2025-01-09 12:42:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400807190] [2025-01-09 12:42:11,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:11,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 12:42:11,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 12:42:11,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:11,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:12,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400807190] [2025-01-09 12:42:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400807190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:12,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:12,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:42:12,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089834888] [2025-01-09 12:42:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:12,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:42:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:12,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:42:12,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:42:12,023 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:12,044 INFO L93 Difference]: Finished difference Result 441 states and 648 transitions. [2025-01-09 12:42:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:42:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2025-01-09 12:42:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:12,047 INFO L225 Difference]: With dead ends: 441 [2025-01-09 12:42:12,047 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 12:42:12,047 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-01-09 12:42:12,048 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 64 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:12,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 252 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:42:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 12:42:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 200. [2025-01-09 12:42:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 147 states have internal predecessors, (193), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 293 transitions. [2025-01-09 12:42:12,070 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 293 transitions. Word has length 156 [2025-01-09 12:42:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:12,071 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 293 transitions. [2025-01-09 12:42:12,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 293 transitions. [2025-01-09 12:42:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:42:12,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:12,072 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:12,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:42:12,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:12,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash -206983836, now seen corresponding path program 1 times [2025-01-09 12:42:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:12,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294564636] [2025-01-09 12:42:12,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:12,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:42:12,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:42:12,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:12,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:13,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294564636] [2025-01-09 12:42:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294564636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:13,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:13,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:42:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513627015] [2025-01-09 12:42:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:13,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:42:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:13,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:42:13,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:13,174 INFO L87 Difference]: Start difference. First operand 200 states and 293 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:13,730 INFO L93 Difference]: Finished difference Result 408 states and 587 transitions. [2025-01-09 12:42:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:42:13,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-01-09 12:42:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:13,737 INFO L225 Difference]: With dead ends: 408 [2025-01-09 12:42:13,737 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 12:42:13,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:42:13,738 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 229 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:13,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 909 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:42:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 12:42:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 351. [2025-01-09 12:42:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 256 states have (on average 1.30078125) internal successors, (333), 260 states have internal predecessors, (333), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 12:42:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 505 transitions. [2025-01-09 12:42:13,805 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 505 transitions. Word has length 157 [2025-01-09 12:42:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:13,806 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 505 transitions. [2025-01-09 12:42:13,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 505 transitions. [2025-01-09 12:42:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:42:13,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:13,809 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:42:13,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:13,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1228052190, now seen corresponding path program 1 times [2025-01-09 12:42:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615439076] [2025-01-09 12:42:13,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:13,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:42:13,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:42:13,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:13,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:14,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:14,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615439076] [2025-01-09 12:42:14,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615439076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:14,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:14,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:42:14,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141822642] [2025-01-09 12:42:14,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:14,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:42:14,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:14,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:42:14,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:14,623 INFO L87 Difference]: Start difference. First operand 351 states and 505 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:15,256 INFO L93 Difference]: Finished difference Result 832 states and 1188 transitions. [2025-01-09 12:42:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:42:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-01-09 12:42:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:15,260 INFO L225 Difference]: With dead ends: 832 [2025-01-09 12:42:15,261 INFO L226 Difference]: Without dead ends: 519 [2025-01-09 12:42:15,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:42:15,265 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 199 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:15,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1018 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:42:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-01-09 12:42:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 403. [2025-01-09 12:42:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 308 states have (on average 1.3116883116883118) internal successors, (404), 312 states have internal predecessors, (404), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 12:42:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 576 transitions. [2025-01-09 12:42:15,306 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 576 transitions. Word has length 157 [2025-01-09 12:42:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:15,307 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 576 transitions. [2025-01-09 12:42:15,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 576 transitions. [2025-01-09 12:42:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:42:15,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:15,309 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:42:15,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:15,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash 283887205, now seen corresponding path program 1 times [2025-01-09 12:42:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:15,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512617512] [2025-01-09 12:42:15,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:15,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:42:15,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:42:15,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:15,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512617512] [2025-01-09 12:42:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512617512] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:42:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481526990] [2025-01-09 12:42:15,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:15,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:42:15,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:42:15,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:42:15,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:42:15,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:15,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:42:15,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:42:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-01-09 12:42:15,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:42:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481526990] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:42:15,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:42:15,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 12:42:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472552829] [2025-01-09 12:42:15,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:42:15,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:42:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:15,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:42:15,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:42:15,731 INFO L87 Difference]: Start difference. First operand 403 states and 576 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-01-09 12:42:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:15,874 INFO L93 Difference]: Finished difference Result 624 states and 885 transitions. [2025-01-09 12:42:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:42:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 157 [2025-01-09 12:42:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:15,877 INFO L225 Difference]: With dead ends: 624 [2025-01-09 12:42:15,877 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 12:42:15,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:15,881 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 107 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:15,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 174 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:42:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 12:42:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2025-01-09 12:42:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 174 states have (on average 1.235632183908046) internal successors, (215), 177 states have internal predecessors, (215), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 12:42:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 355 transitions. [2025-01-09 12:42:15,934 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 355 transitions. Word has length 157 [2025-01-09 12:42:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:15,937 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 355 transitions. [2025-01-09 12:42:15,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-01-09 12:42:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2025-01-09 12:42:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 12:42:15,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:15,938 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:15,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:42:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:16,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:16,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1909041385, now seen corresponding path program 1 times [2025-01-09 12:42:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785968622] [2025-01-09 12:42:16,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:16,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 12:42:16,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 12:42:16,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:16,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:16,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785968622] [2025-01-09 12:42:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785968622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:42:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345346707] [2025-01-09 12:42:16,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:16,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:16,341 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-01-09 12:42:16,343 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-01-09 12:42:16,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 12:42:16,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 12:42:16,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:16,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:16,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:42:16,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:42:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-01-09 12:42:16,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:42:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345346707] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:42:16,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:42:16,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-01-09 12:42:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069511602] [2025-01-09 12:42:16,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:42:16,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 12:42:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:16,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 12:42:16,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:42:16,738 INFO L87 Difference]: Start difference. First operand 255 states and 355 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-01-09 12:42:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:17,280 INFO L93 Difference]: Finished difference Result 641 states and 871 transitions. [2025-01-09 12:42:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 12:42:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 158 [2025-01-09 12:42:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:17,286 INFO L225 Difference]: With dead ends: 641 [2025-01-09 12:42:17,286 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 12:42:17,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 12:42:17,291 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 219 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:17,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 525 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:42:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 12:42:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 289. [2025-01-09 12:42:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 208 states have internal predecessors, (253), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 12:42:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 393 transitions. [2025-01-09 12:42:17,330 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 393 transitions. Word has length 158 [2025-01-09 12:42:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:17,330 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 393 transitions. [2025-01-09 12:42:17,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-01-09 12:42:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 393 transitions. [2025-01-09 12:42:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 12:42:17,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:17,333 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:17,339 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-01-09 12:42:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:17,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:17,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 946672780, now seen corresponding path program 1 times [2025-01-09 12:42:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285896695] [2025-01-09 12:42:17,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 12:42:17,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 12:42:17,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:17,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285896695] [2025-01-09 12:42:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285896695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:18,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:42:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729768222] [2025-01-09 12:42:18,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:18,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:42:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:18,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:42:18,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:42:18,250 INFO L87 Difference]: Start difference. First operand 289 states and 393 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:18,835 INFO L93 Difference]: Finished difference Result 681 states and 916 transitions. [2025-01-09 12:42:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:42:18,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2025-01-09 12:42:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:18,838 INFO L225 Difference]: With dead ends: 681 [2025-01-09 12:42:18,839 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 12:42:18,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:42:18,840 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 238 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:18,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 882 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:42:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 12:42:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 395. [2025-01-09 12:42:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 293 states have (on average 1.2013651877133107) internal successors, (352), 298 states have internal predecessors, (352), 86 states have call successors, (86), 15 states have call predecessors, (86), 15 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 12:42:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 524 transitions. [2025-01-09 12:42:18,891 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 524 transitions. Word has length 159 [2025-01-09 12:42:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:18,892 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 524 transitions. [2025-01-09 12:42:18,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 524 transitions. [2025-01-09 12:42:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 12:42:18,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:18,894 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:18,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:42:18,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:18,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -333190898, now seen corresponding path program 1 times [2025-01-09 12:42:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694564961] [2025-01-09 12:42:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:18,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 12:42:18,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 12:42:18,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:18,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:19,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:19,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694564961] [2025-01-09 12:42:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694564961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:19,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:42:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759387031] [2025-01-09 12:42:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:19,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:42:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:19,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:42:19,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:42:19,523 INFO L87 Difference]: Start difference. First operand 395 states and 524 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:20,139 INFO L93 Difference]: Finished difference Result 476 states and 621 transitions. [2025-01-09 12:42:20,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:42:20,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2025-01-09 12:42:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:20,141 INFO L225 Difference]: With dead ends: 476 [2025-01-09 12:42:20,141 INFO L226 Difference]: Without dead ends: 474 [2025-01-09 12:42:20,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:42:20,142 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 220 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:20,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 846 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:42:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-01-09 12:42:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 395. [2025-01-09 12:42:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 293 states have (on average 1.2013651877133107) internal successors, (352), 298 states have internal predecessors, (352), 86 states have call successors, (86), 15 states have call predecessors, (86), 15 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 12:42:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 524 transitions. [2025-01-09 12:42:20,181 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 524 transitions. Word has length 159 [2025-01-09 12:42:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:20,183 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 524 transitions. [2025-01-09 12:42:20,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 524 transitions. [2025-01-09 12:42:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 12:42:20,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:20,185 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:20,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:42:20,185 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1560466316, now seen corresponding path program 1 times [2025-01-09 12:42:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56671608] [2025-01-09 12:42:20,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:20,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 12:42:20,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 12:42:20,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:20,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:42:20,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:20,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56671608] [2025-01-09 12:42:20,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56671608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:20,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:20,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:42:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930750275] [2025-01-09 12:42:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:42:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:20,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:42:20,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:20,756 INFO L87 Difference]: Start difference. First operand 395 states and 524 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:21,198 INFO L93 Difference]: Finished difference Result 400 states and 528 transitions. [2025-01-09 12:42:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:42:21,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2025-01-09 12:42:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:21,201 INFO L225 Difference]: With dead ends: 400 [2025-01-09 12:42:21,202 INFO L226 Difference]: Without dead ends: 398 [2025-01-09 12:42:21,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:42:21,203 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 148 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:21,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 771 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:42:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-01-09 12:42:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 359. [2025-01-09 12:42:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 257 states have (on average 1.2140077821011672) internal successors, (312), 262 states have internal predecessors, (312), 86 states have call successors, (86), 15 states have call predecessors, (86), 15 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 12:42:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2025-01-09 12:42:21,243 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 159 [2025-01-09 12:42:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:21,244 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2025-01-09 12:42:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2025-01-09 12:42:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 12:42:21,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:21,246 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:21,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:42:21,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1301230250, now seen corresponding path program 1 times [2025-01-09 12:42:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:21,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769727769] [2025-01-09 12:42:21,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:21,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 12:42:21,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 12:42:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:21,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769727769] [2025-01-09 12:42:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769727769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:42:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485540150] [2025-01-09 12:42:21,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:21,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:42:21,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 12:42:21,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 12:42:21,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 12:42:21,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:21,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:21,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:42:21,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:42:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 695 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:42:21,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:42:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:21,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485540150] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:42:21,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:42:21,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 12:42:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950274361] [2025-01-09 12:42:21,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:42:21,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:42:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:21,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:42:21,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:42:21,691 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-01-09 12:42:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:21,984 INFO L93 Difference]: Finished difference Result 698 states and 926 transitions. [2025-01-09 12:42:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:42:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) Word has length 159 [2025-01-09 12:42:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:21,990 INFO L225 Difference]: With dead ends: 698 [2025-01-09 12:42:21,990 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 12:42:21,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:42:21,991 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 100 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:21,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 214 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:42:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 12:42:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 292. [2025-01-09 12:42:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.2105263157894737) internal successors, (276), 230 states have internal predecessors, (276), 50 states have call successors, (50), 13 states have call predecessors, (50), 13 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 376 transitions. [2025-01-09 12:42:22,025 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 376 transitions. Word has length 159 [2025-01-09 12:42:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:22,025 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 376 transitions. [2025-01-09 12:42:22,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-01-09 12:42:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 376 transitions. [2025-01-09 12:42:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 12:42:22,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:22,028 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:22,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 12:42:22,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 12:42:22,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:22,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1800364922, now seen corresponding path program 1 times [2025-01-09 12:42:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:22,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928617797] [2025-01-09 12:42:22,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:22,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:22,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 12:42:22,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 12:42:22,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:22,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:22,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928617797] [2025-01-09 12:42:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928617797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:22,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:42:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066621196] [2025-01-09 12:42:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:22,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:42:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:22,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:42:22,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:42:22,365 INFO L87 Difference]: Start difference. First operand 292 states and 376 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:22,584 INFO L93 Difference]: Finished difference Result 589 states and 756 transitions. [2025-01-09 12:42:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:42:22,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-01-09 12:42:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:22,588 INFO L225 Difference]: With dead ends: 589 [2025-01-09 12:42:22,588 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 12:42:22,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:42:22,589 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 117 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:22,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:42:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 12:42:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2025-01-09 12:42:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.1385281385281385) internal successors, (263), 233 states have internal predecessors, (263), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2025-01-09 12:42:22,625 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 160 [2025-01-09 12:42:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:22,625 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2025-01-09 12:42:22,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2025-01-09 12:42:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 12:42:22,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:22,627 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:22,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:42:22,627 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:22,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1213558908, now seen corresponding path program 1 times [2025-01-09 12:42:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122478545] [2025-01-09 12:42:22,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:22,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 12:42:22,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 12:42:22,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:22,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:42:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056453236] [2025-01-09 12:42:22,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:22,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:22,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:22,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:42:22,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 12:42:22,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 12:42:22,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 12:42:22,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:22,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:42:22,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:42:22,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 12:42:22,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 12:42:22,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:22,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:42:22,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:42:22,820 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:42:22,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:42:22,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 12:42:23,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 12:42:23,026 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:23,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:42:23,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:42:23 BoogieIcfgContainer [2025-01-09 12:42:23,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:42:23,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:42:23,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:42:23,080 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:42:23,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:42:06" (3/4) ... [2025-01-09 12:42:23,082 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:42:23,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:42:23,083 INFO L158 Benchmark]: Toolchain (without parser) took 17692.59ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 158.7MB in the beginning and 334.8MB in the end (delta: -176.1MB). Peak memory consumption was 296.0MB. Max. memory is 16.1GB. [2025-01-09 12:42:23,083 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 218.1MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:42:23,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.78ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 145.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:42:23,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.12ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 143.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:42:23,083 INFO L158 Benchmark]: Boogie Preprocessor took 23.84ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 139.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:42:23,084 INFO L158 Benchmark]: RCFGBuilder took 330.03ms. Allocated memory is still 201.3MB. Free memory was 139.6MB in the beginning and 119.2MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:42:23,084 INFO L158 Benchmark]: TraceAbstraction took 17047.86ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 118.5MB in the beginning and 334.9MB in the end (delta: -216.4MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. [2025-01-09 12:42:23,084 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 671.1MB. Free memory was 334.9MB in the beginning and 334.8MB in the end (delta: 141.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:42:23,085 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.21ms. Allocated memory is still 218.1MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.78ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 145.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.12ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 143.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.84ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 139.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 330.03ms. Allocated memory is still 201.3MB. Free memory was 139.6MB in the beginning and 119.2MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17047.86ms. Allocated memory was 201.3MB in the beginning and 671.1MB in the end (delta: 469.8MB). Free memory was 118.5MB in the beginning and 334.9MB in the end (delta: -216.4MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 671.1MB. Free memory was 334.9MB in the beginning and 334.8MB in the end (delta: 141.2kB). 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 shiftLeft at line 47, overapproximation of shiftLeft at line 112, overapproximation of bitwiseOr at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] signed long int var_1_2 = 4; [L24] signed long int var_1_3 = 64; [L25] signed long int var_1_4 = 64; [L26] signed long int var_1_5 = 0; [L27] signed short int var_1_7 = 10000; [L28] signed short int var_1_8 = 1; [L29] signed short int var_1_9 = 50; [L30] signed short int var_1_10 = 8; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 100; [L33] unsigned short int var_1_15 = 128; [L34] unsigned short int var_1_16 = 23647; [L35] unsigned short int var_1_17 = 32; [L36] signed char var_1_18 = 0; [L37] signed char var_1_19 = -50; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; VAL [isInitial=0, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=4, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L116] isInitial = 1 [L117] FCALL initially() [L119] FCALL updateLastVariables() [L120] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L75] var_1_3 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L76] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L78] var_1_4 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L79] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L81] var_1_5 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L84] var_1_7 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L85] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=50] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=50] [L89] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=50] [L89] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=50] [L90] var_1_9 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L92] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L93] var_1_10 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L95] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L97] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L98] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L102] var_1_19 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L103] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L104] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L106] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L107] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L120] RET updateVariables() [L121] CALL step() [L43] var_1_18 = var_1_19 [L44] var_1_20 = var_1_21 [L45] signed char stepLocal_1 = var_1_18; [L46] signed long int stepLocal_0 = var_1_9 / var_1_7; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=126, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=126, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L47] EXPR var_1_8 << var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=126, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=126, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L47] COND FALSE !(stepLocal_1 > (var_1_8 << var_1_10)) [L54] EXPR var_1_7 ^ var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=126, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L54] signed long int stepLocal_2 = var_1_7 ^ var_1_18; [L55] COND TRUE var_1_14 >= stepLocal_2 [L56] var_1_15 = (var_1_14 + (var_1_16 - var_1_13)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=126, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L58] COND FALSE !(var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=126, var_1_19=126, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L63] COND FALSE !(\read(var_1_20)) [L66] var_1_1 = var_1_13 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L69] var_1_17 = var_1_1 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=2, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=2, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L112] EXPR var_1_8 << var_1_10 VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=2, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=2, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L112] EXPR (((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=2, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L112-L113] return ((((((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1)) && (var_1_17 == ((unsigned short int) var_1_1))) && (var_1_18 == ((signed char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=2, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=2, var_1_18=126, var_1_19=126, var_1_1=2, var_1_20=0, var_1_21=0, var_1_2=0, var_1_3=-2147483648, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=124, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1900 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1889 mSDsluCounter, 7981 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6053 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4573 IncrementalHoareTripleChecker+Invalid, 5058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 1928 mSDtfsCounter, 4573 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1294 GetRequests, 1123 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=8, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 705 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 3298 NumberOfCodeBlocks, 3298 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3430 ConstructedInterpolants, 0 QuantifiedInterpolants, 8937 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 23843/24288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:42:23,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:42:25,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:42:25,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:42:25,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:42:25,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:42:25,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:42:25,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:42:25,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:42:25,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:42:25,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:42:25,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:42:25,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:42:25,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:42:25,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:42:25,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:42:25,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:25,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:25,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:42:25,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:42:25,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:42:25,248 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2025-01-09 12:42:25,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:42:25,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:42:25,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:42:25,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:42:25,474 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:42:25,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-01-09 12:42:26,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6646f62d2/a7867f381f6a41e9bd75d76afd7b5791/FLAG5afd148f7 [2025-01-09 12:42:26,951 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:42:26,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2025-01-09 12:42:26,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6646f62d2/a7867f381f6a41e9bd75d76afd7b5791/FLAG5afd148f7 [2025-01-09 12:42:27,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6646f62d2/a7867f381f6a41e9bd75d76afd7b5791 [2025-01-09 12:42:27,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:42:27,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:42:27,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:42:27,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:42:27,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:42:27,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ebdda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27, skipping insertion in model container [2025-01-09 12:42:27,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:42:27,408 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_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-01-09 12:42:27,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:42:27,458 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:42:27,466 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_floatingpointinfluence_no-floats_file-43.i[916,929] [2025-01-09 12:42:27,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:42:27,502 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:42:27,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27 WrapperNode [2025-01-09 12:42:27,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:42:27,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:42:27,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:42:27,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:42:27,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,547 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-01-09 12:42:27,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:42:27,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:42:27,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:42:27,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:42:27,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,573 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:42:27,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:42:27,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:42:27,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:42:27,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:42:27,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (1/1) ... [2025-01-09 12:42:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:27,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:27,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:42:27,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:42:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:42:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:42:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:42:27,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:42:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:42:27,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:42:27,711 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:42:27,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:42:27,854 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:42:27,854 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:42:27,860 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:42:27,860 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:42:27,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:42:27 BoogieIcfgContainer [2025-01-09 12:42:27,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:42:27,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:42:27,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:42:27,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:42:27,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:42:27" (1/3) ... [2025-01-09 12:42:27,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627dd7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:42:27, skipping insertion in model container [2025-01-09 12:42:27,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:27" (2/3) ... [2025-01-09 12:42:27,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627dd7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:42:27, skipping insertion in model container [2025-01-09 12:42:27,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:42:27" (3/3) ... [2025-01-09 12:42:27,867 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2025-01-09 12:42:27,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:42:27,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-43.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:42:27,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:42:27,917 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;@2fe8c7bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:42:27,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:42:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:42:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 12:42:27,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:27,927 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:27,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:27,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1252560844, now seen corresponding path program 1 times [2025-01-09 12:42:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:42:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784762381] [2025-01-09 12:42:27,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:27,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:42:27,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:42:28,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 12:42:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 12:42:28,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:28,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:28,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:42:28,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:42:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:42:28,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:42:28,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:42:28,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784762381] [2025-01-09 12:42:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784762381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:28,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:42:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056226228] [2025-01-09 12:42:28,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:28,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:42:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:42:28,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:42:28,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:42:28,188 INFO L87 Difference]: Start difference. First operand has 62 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:42:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:28,205 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2025-01-09 12:42:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:42:28,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 147 [2025-01-09 12:42:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:28,212 INFO L225 Difference]: With dead ends: 118 [2025-01-09 12:42:28,213 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 12:42:28,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:42:28,217 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:28,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:42:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 12:42:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 12:42:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:42:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-01-09 12:42:28,253 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 147 [2025-01-09 12:42:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:28,253 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-01-09 12:42:28,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:42:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-01-09 12:42:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 12:42:28,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:28,259 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:28,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:42:28,460 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 [2025-01-09 12:42:28,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:28,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash 57425868, now seen corresponding path program 1 times [2025-01-09 12:42:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:42:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776105702] [2025-01-09 12:42:28,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:28,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:28,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:28,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:42:28,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:42:28,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 12:42:28,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 12:42:28,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:28,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:28,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:42:28,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:42:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:42:28,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:42:28,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:42:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776105702] [2025-01-09 12:42:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776105702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:42:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123934264] [2025-01-09 12:42:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:42:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:42:28,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:42:28,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:42:28,650 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:28,971 INFO L93 Difference]: Finished difference Result 123 states and 180 transitions. [2025-01-09 12:42:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:42:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2025-01-09 12:42:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:28,975 INFO L225 Difference]: With dead ends: 123 [2025-01-09 12:42:28,976 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 12:42:28,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:42:28,977 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:28,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 120 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:42:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 12:42:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-01-09 12:42:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:42:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2025-01-09 12:42:28,993 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 147 [2025-01-09 12:42:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:28,995 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2025-01-09 12:42:28,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:42:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2025-01-09 12:42:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 12:42:28,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:28,996 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:42:29,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:42:29,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:29,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:29,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash 114684170, now seen corresponding path program 1 times [2025-01-09 12:42:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:42:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038448768] [2025-01-09 12:42:29,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:29,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:29,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:29,203 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-01-09 12:42:29,204 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-01-09 12:42:29,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 12:42:29,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 12:42:29,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:29,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:29,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 12:42:29,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:43:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 144 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-01-09 12:43:31,437 INFO L312 TraceCheckSpWp]: Computing backward predicates...