./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_2.c --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/bitvector/num_conversion_2.c -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 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:47:58,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:47:58,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:47:58,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:47:58,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:47:58,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:47:58,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:47:58,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:47:58,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:47:58,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:47:58,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:47:58,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:47:58,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:47:58,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:47:58,563 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:47:58,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:47:58,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:47:58,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:47:58,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:47:58,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:47:58,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:47:58,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:47:58,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:58,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:47:58,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:47:58,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:47:58,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:47:58,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:47:58,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:47:58,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:47:58,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:47:58,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:47:58,566 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 -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2025-01-08 22:47:58,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:47:58,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:47:58,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:47:58,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:47:58,764 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:47:58,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-01-08 22:47:59,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9710f0ab/35eb3e13ab9a4d7eb773cb930c845f7f/FLAGb5bb99af8 [2025-01-08 22:48:00,086 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:00,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-01-08 22:48:00,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9710f0ab/35eb3e13ab9a4d7eb773cb930c845f7f/FLAGb5bb99af8 [2025-01-08 22:48:00,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9710f0ab/35eb3e13ab9a4d7eb773cb930c845f7f [2025-01-08 22:48:00,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:00,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:00,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:00,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:00,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:00,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238ff2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00, skipping insertion in model container [2025-01-08 22:48:00,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:00,553 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/bitvector/num_conversion_2.c[685,698] [2025-01-08 22:48:00,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:00,571 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:00,578 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/bitvector/num_conversion_2.c[685,698] [2025-01-08 22:48:00,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:00,595 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:00,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00 WrapperNode [2025-01-08 22:48:00,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:00,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:00,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:00,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:00,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,622 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2025-01-08 22:48:00,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:00,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:00,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:00,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:00,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,643 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-08 22:48:00,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:00,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:00,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:00,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:00,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (1/1) ... [2025-01-08 22:48:00,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:00,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:00,680 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-08 22:48:00,685 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-08 22:48:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:00,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:48:00,746 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:00,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:00,834 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:00,835 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:00,839 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:00,840 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:48:00,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:00 BoogieIcfgContainer [2025-01-08 22:48:00,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:00,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:00,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:00,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:00,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:00" (1/3) ... [2025-01-08 22:48:00,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba09f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:00, skipping insertion in model container [2025-01-08 22:48:00,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:00" (2/3) ... [2025-01-08 22:48:00,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba09f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:00, skipping insertion in model container [2025-01-08 22:48:00,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:00" (3/3) ... [2025-01-08 22:48:00,846 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-01-08 22:48:00,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:00,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 19 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:48:00,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:00,898 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;@5f8047b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:00,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-08 22:48:00,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:00,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-08 22:48:00,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 28724579, now seen corresponding path program 1 times [2025-01-08 22:48:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:00,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78794458] [2025-01-08 22:48:00,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:00,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-08 22:48:00,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-08 22:48:00,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:00,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78794458] [2025-01-08 22:48:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78794458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551929807] [2025-01-08 22:48:01,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:01,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:01,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:01,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:01,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:01,071 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:01,092 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-01-08 22:48:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-08 22:48:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:01,097 INFO L225 Difference]: With dead ends: 45 [2025-01-08 22:48:01,098 INFO L226 Difference]: Without dead ends: 24 [2025-01-08 22:48:01,099 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-08 22:48:01,101 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:01,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-08 22:48:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-01-08 22:48:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-01-08 22:48:01,126 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 5 [2025-01-08 22:48:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:01,129 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-01-08 22:48:01,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-01-08 22:48:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-08 22:48:01,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:01,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:01,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:48:01,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:01,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1777149650, now seen corresponding path program 1 times [2025-01-08 22:48:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:01,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94981820] [2025-01-08 22:48:01,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:01,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:48:01,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:48:01,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:01,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:01,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94981820] [2025-01-08 22:48:01,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94981820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19503760] [2025-01-08 22:48:01,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:01,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:01,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:01,238 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-08 22:48:01,239 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-08 22:48:01,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:48:01,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:48:01,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:01,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:01,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:48:01,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:01,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:01,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19503760] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:01,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:01,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 7] total 14 [2025-01-08 22:48:01,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238787066] [2025-01-08 22:48:01,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:01,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:01,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:01,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:48:01,625 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:01,766 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-01-08 22:48:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-08 22:48:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:01,767 INFO L225 Difference]: With dead ends: 32 [2025-01-08 22:48:01,767 INFO L226 Difference]: Without dead ends: 29 [2025-01-08 22:48:01,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:48:01,767 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:01,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 38 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-08 22:48:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-01-08 22:48:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-01-08 22:48:01,774 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2025-01-08 22:48:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:01,774 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-01-08 22:48:01,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-01-08 22:48:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-08 22:48:01,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:01,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:01,785 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-08 22:48:01,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:01,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1775302608, now seen corresponding path program 1 times [2025-01-08 22:48:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:01,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84736606] [2025-01-08 22:48:01,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:01,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-08 22:48:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-08 22:48:01,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:01,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:02,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84736606] [2025-01-08 22:48:02,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84736606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:02,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:48:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545252213] [2025-01-08 22:48:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:02,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:48:02,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:02,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:48:02,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:02,082 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:02,095 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-01-08 22:48:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:48:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-08 22:48:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:02,097 INFO L225 Difference]: With dead ends: 50 [2025-01-08 22:48:02,097 INFO L226 Difference]: Without dead ends: 29 [2025-01-08 22:48:02,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:48:02,097 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:02,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-08 22:48:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-08 22:48:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-01-08 22:48:02,104 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 12 [2025-01-08 22:48:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:02,105 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-01-08 22:48:02,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-01-08 22:48:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:48:02,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:02,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:02,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:48:02,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:02,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1841735758, now seen corresponding path program 1 times [2025-01-08 22:48:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:02,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58101103] [2025-01-08 22:48:02,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:02,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:48:02,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:48:02,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:02,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:02,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:02,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58101103] [2025-01-08 22:48:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58101103] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:02,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100174276] [2025-01-08 22:48:02,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:02,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:02,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:02,151 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-08 22:48:02,152 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-08 22:48:02,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:48:02,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:48:02,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:02,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:02,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-08 22:48:02,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:02,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100174276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:02,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-01-08 22:48:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40518456] [2025-01-08 22:48:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:02,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:02,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:02,226 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:02,267 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2025-01-08 22:48:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:02,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:48:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:02,268 INFO L225 Difference]: With dead ends: 67 [2025-01-08 22:48:02,268 INFO L226 Difference]: Without dead ends: 42 [2025-01-08 22:48:02,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:02,269 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:02,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 55 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-08 22:48:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-01-08 22:48:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-01-08 22:48:02,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2025-01-08 22:48:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:02,272 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-01-08 22:48:02,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-01-08 22:48:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:48:02,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:02,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:02,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:02,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:02,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:02,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1618246847, now seen corresponding path program 1 times [2025-01-08 22:48:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:02,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846832936] [2025-01-08 22:48:02,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:02,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:48:02,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:48:02,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:02,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846832936] [2025-01-08 22:48:02,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846832936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772830210] [2025-01-08 22:48:02,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:02,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:02,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:02,574 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-08 22:48:02,578 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-08 22:48:02,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-08 22:48:02,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:48:02,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:02,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:02,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:48:02,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:02,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772830210] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:02,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2025-01-08 22:48:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044682096] [2025-01-08 22:48:02,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:02,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-08 22:48:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:02,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-08 22:48:02,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:48:02,935 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:03,319 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2025-01-08 22:48:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-08 22:48:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:48:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:03,320 INFO L225 Difference]: With dead ends: 161 [2025-01-08 22:48:03,321 INFO L226 Difference]: Without dead ends: 100 [2025-01-08 22:48:03,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-01-08 22:48:03,322 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 201 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:03,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 106 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:48:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-08 22:48:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-01-08 22:48:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-01-08 22:48:03,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 20 [2025-01-08 22:48:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:03,335 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-01-08 22:48:03,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-01-08 22:48:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:48:03,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:03,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:03,342 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-08 22:48:03,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:03,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1945235854, now seen corresponding path program 1 times [2025-01-08 22:48:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:03,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68093206] [2025-01-08 22:48:03,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:03,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:48:03,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:48:03,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:03,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68093206] [2025-01-08 22:48:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68093206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:48:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468573624] [2025-01-08 22:48:03,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:03,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:48:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:03,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:48:03,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:03,636 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:03,661 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2025-01-08 22:48:03,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:48:03,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-08 22:48:03,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:03,662 INFO L225 Difference]: With dead ends: 180 [2025-01-08 22:48:03,662 INFO L226 Difference]: Without dead ends: 102 [2025-01-08 22:48:03,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:03,663 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:03,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-08 22:48:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-01-08 22:48:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 97 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2025-01-08 22:48:03,668 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 29 [2025-01-08 22:48:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:03,669 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2025-01-08 22:48:03,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2025-01-08 22:48:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:48:03,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:03,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:03,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:48:03,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1522534028, now seen corresponding path program 1 times [2025-01-08 22:48:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698569982] [2025-01-08 22:48:03,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:03,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:48:03,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:48:03,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:03,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:03,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698569982] [2025-01-08 22:48:03,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698569982] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:03,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512365866] [2025-01-08 22:48:03,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:03,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:03,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:03,790 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-08 22:48:03,791 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-08 22:48:03,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:48:03,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:48:03,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:03,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:03,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 22:48:03,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:03,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:48:04,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512365866] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:04,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:04,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2025-01-08 22:48:04,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016343947] [2025-01-08 22:48:04,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:04,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:48:04,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:04,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:48:04,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:48:04,259 INFO L87 Difference]: Start difference. First operand 98 states and 124 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:04,994 INFO L93 Difference]: Finished difference Result 399 states and 511 transitions. [2025-01-08 22:48:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-08 22:48:04,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-08 22:48:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:04,996 INFO L225 Difference]: With dead ends: 399 [2025-01-08 22:48:04,996 INFO L226 Difference]: Without dead ends: 343 [2025-01-08 22:48:04,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2025-01-08 22:48:04,997 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 290 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:04,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 238 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:48:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-08 22:48:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 234. [2025-01-08 22:48:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.2746781115879828) internal successors, (297), 233 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 297 transitions. [2025-01-08 22:48:05,023 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 297 transitions. Word has length 29 [2025-01-08 22:48:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:05,023 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 297 transitions. [2025-01-08 22:48:05,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 297 transitions. [2025-01-08 22:48:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:48:05,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:05,024 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:05,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:05,230 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,SelfDestructingSolverStorable6 [2025-01-08 22:48:05,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1091505941, now seen corresponding path program 2 times [2025-01-08 22:48:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:05,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339219859] [2025-01-08 22:48:05,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:05,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:48:05,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:48:05,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:48:05,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:05,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:05,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339219859] [2025-01-08 22:48:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339219859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:05,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119823889] [2025-01-08 22:48:05,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:05,368 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-08 22:48:05,369 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-08 22:48:05,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:48:05,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:48:05,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:48:05,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:05,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:48:05,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:05,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119823889] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:05,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-01-08 22:48:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592034693] [2025-01-08 22:48:05,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:05,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:48:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:05,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:48:05,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:48:05,683 INFO L87 Difference]: Start difference. First operand 234 states and 297 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:05,857 INFO L93 Difference]: Finished difference Result 638 states and 832 transitions. [2025-01-08 22:48:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-08 22:48:05,858 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-08 22:48:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:05,859 INFO L225 Difference]: With dead ends: 638 [2025-01-08 22:48:05,859 INFO L226 Difference]: Without dead ends: 533 [2025-01-08 22:48:05,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=354, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:48:05,861 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 198 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:05,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 418 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-01-08 22:48:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 397. [2025-01-08 22:48:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.2752525252525253) internal successors, (505), 396 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 505 transitions. [2025-01-08 22:48:05,879 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 505 transitions. Word has length 38 [2025-01-08 22:48:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:05,880 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 505 transitions. [2025-01-08 22:48:05,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 505 transitions. [2025-01-08 22:48:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-08 22:48:05,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:05,882 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:05,887 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-08 22:48:06,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:06,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:06,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash -549512777, now seen corresponding path program 3 times [2025-01-08 22:48:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:06,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661061019] [2025-01-08 22:48:06,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:48:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:06,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 9 equivalence classes. [2025-01-08 22:48:06,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 70 of 70 statements. [2025-01-08 22:48:06,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-08 22:48:06,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:48:06,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:48:06,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-08 22:48:06,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-08 22:48:06,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:06,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:48:06,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:48:06,173 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:48:06,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:48:06,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:48:06,178 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:06,204 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:48:06,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:48:06 BoogieIcfgContainer [2025-01-08 22:48:06,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:48:06,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:48:06,208 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:48:06,208 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:48:06,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:00" (3/4) ... [2025-01-08 22:48:06,210 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-08 22:48:06,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:48:06,211 INFO L158 Benchmark]: Toolchain (without parser) took 5764.66ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 114.5MB in the beginning and 170.4MB in the end (delta: -55.9MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2025-01-08 22:48:06,211 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:06,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.10ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 104.2MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:06,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.06ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 102.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:06,212 INFO L158 Benchmark]: Boogie Preprocessor took 27.26ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:06,212 INFO L158 Benchmark]: RCFGBuilder took 187.25ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 89.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:06,212 INFO L158 Benchmark]: TraceAbstraction took 5366.24ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 89.4MB in the beginning and 170.4MB in the end (delta: -81.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2025-01-08 22:48:06,213 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 285.2MB. Free memory was 170.4MB in the beginning and 170.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:06,214 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 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.10ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 104.2MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.06ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 102.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.26ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 187.25ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 89.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5366.24ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 89.4MB in the beginning and 170.4MB in the end (delta: -81.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 285.2MB. Free memory was 170.4MB in the beginning and 170.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: 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 31. Possible FailurePath: [L24] unsigned char x = __VERIFIER_nondet_uchar(); [L25] unsigned char y; [L26] unsigned char c; [L28] y = 0 [L29] c = 0 VAL [c=0, y=0] [L30] COND TRUE c < (unsigned char)8 VAL [c=0, y=0] [L31] EXPR ((unsigned char)1) << c VAL [c=0, y=0] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=0, i=1, x=1, y=0] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=0, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=1, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=1, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=1, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=1, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=2, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=2, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=2, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=2, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=3, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=3, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=3, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=3, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=4, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=4, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=4, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=4, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=5, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=5, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=5, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=5, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=6, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=6, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=6, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=6, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=7, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=7, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=7, i=257, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=7, x=1, y=2] [L36] c = c + ((unsigned char)1) [L30] COND FALSE !(c < (unsigned char)8) [L38] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 776 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 776 mSDsluCounter, 968 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 796 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1072 IncrementalHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 172 mSDtfsCounter, 1072 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 171 SyntacticMatches, 4 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=8, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 284 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 2272 SizeOfPredicates, 14 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 70/283 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-08 22:48:06,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_2.c -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 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:48:08,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:48:08,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-08 22:48:08,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:48:08,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:48:08,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:48:08,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:48:08,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:48:08,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:48:08,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:48:08,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:48:08,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:48:08,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:48:08,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:48:08,302 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:48:08,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:48:08,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:48:08,303 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:48:08,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:48:08,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:48:08,304 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:08,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:08,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:08,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:08,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:48:08,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:08,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:08,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:08,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:08,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:48:08,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:48:08,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:48:08,307 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 -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2025-01-08 22:48:08,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:48:08,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:48:08,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:48:08,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:48:08,568 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:48:08,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-01-08 22:48:09,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f464e195/05ada564dc444fa9a0cf436214e8fe04/FLAGf0bb19a8a [2025-01-08 22:48:09,928 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:09,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-01-08 22:48:09,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f464e195/05ada564dc444fa9a0cf436214e8fe04/FLAGf0bb19a8a [2025-01-08 22:48:09,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f464e195/05ada564dc444fa9a0cf436214e8fe04 [2025-01-08 22:48:09,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:09,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:09,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:09,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:09,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:09,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:09" (1/1) ... [2025-01-08 22:48:09,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ca9202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:09, skipping insertion in model container [2025-01-08 22:48:09,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:09" (1/1) ... [2025-01-08 22:48:09,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:10,063 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/bitvector/num_conversion_2.c[685,698] [2025-01-08 22:48:10,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:10,088 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:10,095 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/bitvector/num_conversion_2.c[685,698] [2025-01-08 22:48:10,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:10,112 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:10,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10 WrapperNode [2025-01-08 22:48:10,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:10,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:10,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:10,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:10,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,136 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-01-08 22:48:10,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:10,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:10,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:10,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:10,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,154 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-08 22:48:10,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:10,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:10,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:10,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:10,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (1/1) ... [2025-01-08 22:48:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:10,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:10,188 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-08 22:48:10,191 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-08 22:48:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-08 22:48:10,276 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:10,278 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:10,369 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:10,369 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:10,383 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:10,384 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:48:10,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:10 BoogieIcfgContainer [2025-01-08 22:48:10,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:10,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:10,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:10,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:10,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:09" (1/3) ... [2025-01-08 22:48:10,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f301f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:10, skipping insertion in model container [2025-01-08 22:48:10,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:10" (2/3) ... [2025-01-08 22:48:10,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f301f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:10, skipping insertion in model container [2025-01-08 22:48:10,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:10" (3/3) ... [2025-01-08 22:48:10,395 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-01-08 22:48:10,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:10,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:48:10,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:10,450 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;@258752c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:10,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-08 22:48:10,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:10,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-08 22:48:10,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:10,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash 28703726, now seen corresponding path program 1 times [2025-01-08 22:48:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980211518] [2025-01-08 22:48:10,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:10,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:10,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:10,468 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-08 22:48:10,470 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-08 22:48:10,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-08 22:48:10,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-08 22:48:10,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:10,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:10,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:48:10,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:10,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:10,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980211518] [2025-01-08 22:48:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980211518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497890235] [2025-01-08 22:48:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:10,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:10,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:10,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:10,573 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:10,590 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-01-08 22:48:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-08 22:48:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:10,595 INFO L225 Difference]: With dead ends: 22 [2025-01-08 22:48:10,595 INFO L226 Difference]: Without dead ends: 11 [2025-01-08 22:48:10,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 22:48:10,599 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:10,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-01-08 22:48:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2025-01-08 22:48:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-01-08 22:48:10,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2025-01-08 22:48:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:10,616 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-01-08 22:48:10,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-01-08 22:48:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-08 22:48:10,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:10,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:10,622 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-08 22:48:10,820 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-08 22:48:10,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:10,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash 148041770, now seen corresponding path program 1 times [2025-01-08 22:48:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:10,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945191971] [2025-01-08 22:48:10,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:10,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:10,826 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-08 22:48:10,827 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-08 22:48:10,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-08 22:48:10,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-08 22:48:10,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:10,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:48:10,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:10,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:10,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945191971] [2025-01-08 22:48:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945191971] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:10,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2025-01-08 22:48:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124878867] [2025-01-08 22:48:10,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:48:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:48:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:48:10,920 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:10,960 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2025-01-08 22:48:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:48:10,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-08 22:48:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:10,960 INFO L225 Difference]: With dead ends: 21 [2025-01-08 22:48:10,960 INFO L226 Difference]: Without dead ends: 18 [2025-01-08 22:48:10,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:10,961 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:10,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-08 22:48:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-08 22:48:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-01-08 22:48:10,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2025-01-08 22:48:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:10,966 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-08 22:48:10,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-01-08 22:48:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-08 22:48:10,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:10,967 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-01-08 22:48:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:11,168 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-08 22:48:11,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:11,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1563732206, now seen corresponding path program 2 times [2025-01-08 22:48:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:11,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490071322] [2025-01-08 22:48:11,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:11,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:11,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:11,173 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-08 22:48:11,174 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-08 22:48:11,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-08 22:48:11,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-08 22:48:11,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:48:11,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:11,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:48:11,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:11,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:11,413 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:48:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490071322] [2025-01-08 22:48:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490071322] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:11,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:48:11,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-01-08 22:48:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278365384] [2025-01-08 22:48:11,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:11,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:48:11,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:48:11,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:48:11,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:48:11,415 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:11,532 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-01-08 22:48:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:48:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-08 22:48:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:11,533 INFO L225 Difference]: With dead ends: 39 [2025-01-08 22:48:11,533 INFO L226 Difference]: Without dead ends: 36 [2025-01-08 22:48:11,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:48:11,534 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:11,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 85 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-08 22:48:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-08 22:48:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-01-08 22:48:11,542 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 17 [2025-01-08 22:48:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:11,542 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-01-08 22:48:11,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:48:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-01-08 22:48:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:48:11,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:11,543 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2025-01-08 22:48:11,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:11,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:11,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:11,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -149432850, now seen corresponding path program 3 times [2025-01-08 22:48:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-08 22:48:11,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443876336] [2025-01-08 22:48:11,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:48:11,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:11,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:11,750 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-08 22:48:11,754 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-08 22:48:11,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 9 equivalence classes. [2025-01-08 22:48:11,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:48:11,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-01-08 22:48:11,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:11,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-08 22:48:11,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:13,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:49:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:02,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-08 22:49:02,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443876336] [2025-01-08 22:49:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443876336] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:49:02,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:49:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2025-01-08 22:49:02,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463292086] [2025-01-08 22:49:02,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:49:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-08 22:49:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-08 22:49:02,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-08 22:49:02,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=2156, Unknown=8, NotChecked=0, Total=2862 [2025-01-08 22:49:02,520 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 54 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:16,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse39 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse39))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse39)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse26)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse26)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse26)))) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse37)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 .cse30))))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse22)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49)))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse38)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse35)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse41)))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse44)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse42))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse19 (bvslt .cse52 (_ bv8 32))) (.cse21 (bvslt .cse51 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse20)))) (.cse8 (= .cse50 .cse2)) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse12))))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse25)))) (.cse14 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse44))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse11)))) (.cse13 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25))) (_ bv0 32))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))) (_ bv0 32))) (.cse40 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse16 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse18 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse12))) .cse2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse19 (= .cse2 .cse20) .cse15 .cse16 .cse7 .cse18) (or .cse21 .cse16 (= .cse2 .cse22) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse24)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse24))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse11)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse24))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse12))) .cse24) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse19 .cse0 .cse15 .cse16 (= .cse32 .cse2) .cse7 .cse18) (or .cse33 (= .cse34 .cse2) .cse5 .cse13 .cse15 .cse16 .cse7 .cse18) (or .cse19 .cse5 (= .cse2 .cse35) .cse15 .cse16 .cse7 .cse18) (or .cse4 (= .cse2 .cse36) .cse7) (or .cse21 .cse5 (= .cse2 .cse37) .cse16 .cse7) (or .cse21 .cse0 (= .cse2 .cse38) .cse16 .cse7) (or (= .cse2 .cse10) .cse33 .cse13 .cse15 .cse16 .cse7 .cse18) (or (bvslt .cse39 (_ bv8 32)) .cse8) (or .cse40 .cse0 .cse16 (= .cse2 .cse41) .cse7 .cse18) (or .cse40 .cse16 (= .cse2 .cse42) .cse7 .cse18) (or .cse33 .cse0 .cse13 (= .cse2 .cse43) .cse15 .cse16 .cse7 .cse18) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 .cse11))))))) .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse5 (= .cse29 .cse2) .cse13 .cse15 (bvslt .cse44 (_ bv8 32)) .cse16 .cse17 .cse7 .cse18) (or .cse40 (= .cse45 .cse2) .cse5 .cse16 .cse7 .cse18) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2025-01-08 22:49:28,222 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)