./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-16 14:02:55,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:02:55,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:02:55,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:02:55,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:02:55,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:02:55,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:02:55,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:02:55,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:02:55,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:02:55,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:02:55,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:02:55,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:02:55,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:02:55,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:02:55,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:02:55,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:02:55,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:02:55,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:02:55,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:02:55,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:02:55,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:55,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:02:55,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:02:55,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:02:55,718 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/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-03-16 14:02:55,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:02:55,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:02:55,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:02:55,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:02:55,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:02:55,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-16 14:02:57,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d8f1d50/6cb24c11d8f5442fbe4c679db51ecfab/FLAGcd760ed8a [2025-03-16 14:02:57,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:02:57,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-16 14:02:57,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d8f1d50/6cb24c11d8f5442fbe4c679db51ecfab/FLAGcd760ed8a [2025-03-16 14:02:57,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d8f1d50/6cb24c11d8f5442fbe4c679db51ecfab [2025-03-16 14:02:57,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:02:57,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:02:57,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:57,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:02:57,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:02:57,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2ba1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57, skipping insertion in model container [2025-03-16 14:02:57,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:02:57,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-16 14:02:57,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:57,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:02:57,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-16 14:02:57,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:57,773 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:02:57,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57 WrapperNode [2025-03-16 14:02:57,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:57,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:57,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:02:57,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:02:57,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,798 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2025-03-16 14:02:57,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:57,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:02:57,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:02:57,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:02:57,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,825 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-03-16 14:02:57,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:02:57,829 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:02:57,829 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:02:57,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:02:57,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (1/1) ... [2025-03-16 14:02:57,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:57,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:57,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:02:57,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:02:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:02:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:02:57,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:02:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:02:57,910 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:02:57,911 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:02:58,012 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 14:02:58,012 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:02:58,021 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:02:58,022 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:02:58,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:58 BoogieIcfgContainer [2025-03-16 14:02:58,022 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:02:58,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:02:58,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:02:58,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:02:58,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:02:57" (1/3) ... [2025-03-16 14:02:58,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2571c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:58, skipping insertion in model container [2025-03-16 14:02:58,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:57" (2/3) ... [2025-03-16 14:02:58,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2571c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:58, skipping insertion in model container [2025-03-16 14:02:58,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:58" (3/3) ... [2025-03-16 14:02:58,028 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-03-16 14:02:58,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:02:58,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:02:58,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:02:58,076 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;@45c45914, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:02:58,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:02:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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-03-16 14:02:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 14:02:58,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:58,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 14:02:58,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:58,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1583823, now seen corresponding path program 1 times [2025-03-16 14:02:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:58,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342866770] [2025-03-16 14:02:58,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:58,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 14:02:58,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 14:02:58,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:58,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342866770] [2025-03-16 14:02:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342866770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:58,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:58,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:02:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978907021] [2025-03-16 14:02:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:02:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:58,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:02:58,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:02:58,270 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-03-16 14:02:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:58,298 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-03-16 14:02:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:02:58,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-16 14:02:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:58,303 INFO L225 Difference]: With dead ends: 42 [2025-03-16 14:02:58,304 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 14:02:58,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-16 14:02:58,309 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:58,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 14:02:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2025-03-16 14:02:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-03-16 14:02:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-16 14:02:58,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 4 [2025-03-16 14:02:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:58,328 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-16 14:02:58,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-03-16 14:02:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-03-16 14:02:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 14:02:58,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:58,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:02:58,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1421661831, now seen corresponding path program 1 times [2025-03-16 14:02:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674085530] [2025-03-16 14:02:58,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:58,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 14:02:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 14:02:58,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:58,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674085530] [2025-03-16 14:02:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674085530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:58,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136056578] [2025-03-16 14:02:58,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:58,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:58,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:58,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:58,445 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-03-16 14:02:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:58,463 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-03-16 14:02:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:58,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-16 14:02:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:58,464 INFO L225 Difference]: With dead ends: 31 [2025-03-16 14:02:58,464 INFO L226 Difference]: Without dead ends: 18 [2025-03-16 14:02:58,465 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-03-16 14:02:58,465 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:58,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-16 14:02:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-16 14:02:58,467 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-03-16 14:02:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-16 14:02:58,467 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-16 14:02:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:58,468 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-16 14:02:58,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-03-16 14:02:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-16 14:02:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 14:02:58,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:58,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:58,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:02:58,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:58,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:58,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1422585352, now seen corresponding path program 1 times [2025-03-16 14:02:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:58,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406613016] [2025-03-16 14:02:58,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:58,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 14:02:58,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 14:02:58,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:58,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406613016] [2025-03-16 14:02:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406613016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056381580] [2025-03-16 14:02:58,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:58,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:58,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:58,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:02:58,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 14:02:58,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 14:02:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:58,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:58,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 14:02:58,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:58,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056381580] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:58,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:58,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 6] total 14 [2025-03-16 14:02:58,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85390048] [2025-03-16 14:02:58,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:58,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:02:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:58,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:02:58,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:02:58,904 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-03-16 14:02:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:59,038 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-03-16 14:02:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:02:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2025-03-16 14:02:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:59,039 INFO L225 Difference]: With dead ends: 33 [2025-03-16 14:02:59,039 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 14:02:59,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 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-03-16 14:02:59,040 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:59,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 14:02:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-16 14:02:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-03-16 14:02:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-16 14:02:59,043 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2025-03-16 14:02:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:59,043 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-16 14:02:59,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-03-16 14:02:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-16 14:02:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 14:02:59,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:59,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:59,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:02:59,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:59,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:59,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1215785481, now seen corresponding path program 1 times [2025-03-16 14:02:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748170244] [2025-03-16 14:02:59,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:59,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 14:02:59,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 14:02:59,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:59,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748170244] [2025-03-16 14:02:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748170244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185238477] [2025-03-16 14:02:59,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:59,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:59,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:59,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:59,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:02:59,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 14:02:59,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 14:02:59,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:59,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:59,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 14:02:59,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:59,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:02:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185238477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:59,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:02:59,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2025-03-16 14:02:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883169608] [2025-03-16 14:02:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:59,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:02:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:59,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:02:59,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:02:59,402 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-03-16 14:02:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:59,438 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2025-03-16 14:02:59,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:02:59,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-03-16 14:02:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:59,439 INFO L225 Difference]: With dead ends: 66 [2025-03-16 14:02:59,440 INFO L226 Difference]: Without dead ends: 41 [2025-03-16 14:02:59,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-03-16 14:02:59,441 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:59,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-16 14:02:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2025-03-16 14:02:59,446 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-03-16 14:02:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-16 14:02:59,447 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 12 [2025-03-16 14:02:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:59,447 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-16 14:02:59,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-03-16 14:02:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-16 14:02:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 14:02:59,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:59,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:59,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:59,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 14:02:59,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:59,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1538108491, now seen corresponding path program 1 times [2025-03-16 14:02:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:59,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395812237] [2025-03-16 14:02:59,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:59,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 14:02:59,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 14:02:59,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:59,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395812237] [2025-03-16 14:02:59,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395812237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:59,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784920074] [2025-03-16 14:02:59,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:59,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:59,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:59,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:59,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:02:59,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 14:02:59,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 14:02:59,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:59,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:59,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 14:02:59,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:59,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784920074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:00,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 17 [2025-03-16 14:03:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315359626] [2025-03-16 14:03:00,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 14:03:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:00,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 14:03:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-16 14:03:00,062 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-03-16 14:03:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:00,471 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2025-03-16 14:03:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 14:03:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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 19 [2025-03-16 14:03:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:00,472 INFO L225 Difference]: With dead ends: 160 [2025-03-16 14:03:00,472 INFO L226 Difference]: Without dead ends: 99 [2025-03-16 14:03:00,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 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-03-16 14:03:00,473 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 173 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:00,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 104 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:03:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-16 14:03:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2025-03-16 14:03:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 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-03-16 14:03:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2025-03-16 14:03:00,481 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 19 [2025-03-16 14:03:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:00,481 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2025-03-16 14:03:00,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-03-16 14:03:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2025-03-16 14:03:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 14:03:00,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:00,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:00,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:00,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:00,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:00,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 369731153, now seen corresponding path program 1 times [2025-03-16 14:03:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82306473] [2025-03-16 14:03:00,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:00,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 14:03:00,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:03:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:00,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82306473] [2025-03-16 14:03:00,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82306473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:00,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173414408] [2025-03-16 14:03:00,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:00,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:00,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:00,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:00,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:03:00,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 14:03:00,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:03:00,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:00,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:00,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:03:00,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:00,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:03:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173414408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:01,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:01,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 15 [2025-03-16 14:03:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763910202] [2025-03-16 14:03:01,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:01,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 14:03:01,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:01,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 14:03:01,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-16 14:03:01,229 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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-03-16 14:03:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:01,812 INFO L93 Difference]: Finished difference Result 390 states and 514 transitions. [2025-03-16 14:03:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 14:03:01,812 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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 28 [2025-03-16 14:03:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:01,814 INFO L225 Difference]: With dead ends: 390 [2025-03-16 14:03:01,814 INFO L226 Difference]: Without dead ends: 338 [2025-03-16 14:03:01,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 14:03:01,816 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 365 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:01,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 185 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:03:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-16 14:03:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 229. [2025-03-16 14:03:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.3157894736842106) internal successors, (300), 228 states have internal predecessors, (300), 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-03-16 14:03:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2025-03-16 14:03:01,829 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 28 [2025-03-16 14:03:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:01,829 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2025-03-16 14:03:01,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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-03-16 14:03:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2025-03-16 14:03:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:03:01,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:01,831 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:01,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:03:02,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:02,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -399730817, now seen corresponding path program 1 times [2025-03-16 14:03:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:02,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972887121] [2025-03-16 14:03:02,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:02,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:03:02,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:03:02,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:02,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 14:03:02,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:02,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972887121] [2025-03-16 14:03:02,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972887121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:02,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:02,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:03:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419086176] [2025-03-16 14:03:02,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:02,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:03:02,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:02,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:03:02,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:03:02,140 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-03-16 14:03:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:02,168 INFO L93 Difference]: Finished difference Result 443 states and 586 transitions. [2025-03-16 14:03:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:03:02,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 36 [2025-03-16 14:03:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:02,170 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:03:02,170 INFO L226 Difference]: Without dead ends: 249 [2025-03-16 14:03:02,171 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-03-16 14:03:02,171 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:02,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-16 14:03:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2025-03-16 14:03:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 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-03-16 14:03:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 296 transitions. [2025-03-16 14:03:02,194 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 296 transitions. Word has length 36 [2025-03-16 14:03:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:02,194 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 296 transitions. [2025-03-16 14:03:02,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-03-16 14:03:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 296 transitions. [2025-03-16 14:03:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 14:03:02,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:02,195 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 14:03:02,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:03:02,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:02,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1884327999, now seen corresponding path program 2 times [2025-03-16 14:03:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368033698] [2025-03-16 14:03:02,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:02,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 14:03:02,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 14:03:02,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:03:02,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368033698] [2025-03-16 14:03:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368033698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309089331] [2025-03-16 14:03:02,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:02,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:02,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:02,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:03:02,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 14:03:02,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 14:03:02,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:03:02,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:02,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 14:03:02,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:02,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309089331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:02,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 24 [2025-03-16 14:03:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820731971] [2025-03-16 14:03:02,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:02,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 14:03:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:02,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 14:03:02,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-03-16 14:03:02,725 INFO L87 Difference]: Start difference. First operand 233 states and 296 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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-03-16 14:03:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:03,189 INFO L93 Difference]: Finished difference Result 657 states and 851 transitions. [2025-03-16 14:03:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 14:03:03,189 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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 37 [2025-03-16 14:03:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:03,191 INFO L225 Difference]: With dead ends: 657 [2025-03-16 14:03:03,191 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 14:03:03,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 14:03:03,192 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 262 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:03,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 354 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:03:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 14:03:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 396. [2025-03-16 14:03:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.2759493670886075) internal successors, (504), 395 states have internal predecessors, (504), 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-03-16 14:03:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2025-03-16 14:03:03,214 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 37 [2025-03-16 14:03:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:03,215 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2025-03-16 14:03:03,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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-03-16 14:03:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2025-03-16 14:03:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 14:03:03,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:03,219 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 14:03:03,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:03:03,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:03,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:03,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 594359693, now seen corresponding path program 3 times [2025-03-16 14:03:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939411794] [2025-03-16 14:03:03,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 14:03:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:03,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 9 equivalence classes. [2025-03-16 14:03:03,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 14:03:03,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 14:03:03,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:03:03,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 14:03:03,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 14:03:03,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 14:03:03,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:03,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:03:03,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 14:03:03,480 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 14:03:03,480 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:03:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:03:03,484 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:03,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:03:03,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:03:03 BoogieIcfgContainer [2025-03-16 14:03:03,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:03:03,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:03:03,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:03:03,507 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:03:03,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:58" (3/4) ... [2025-03-16 14:03:03,509 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 14:03:03,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:03:03,510 INFO L158 Benchmark]: Toolchain (without parser) took 5874.96ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 50.8MB in the end (delta: 58.4MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2025-03-16 14:03:03,510 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:03,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.13ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 98.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:03,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.57ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:03,511 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:03,511 INFO L158 Benchmark]: IcfgBuilder took 192.87ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 83.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:03,512 INFO L158 Benchmark]: TraceAbstraction took 5482.86ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 52.2MB in the end (delta: 30.8MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:03,512 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 50.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:03,513 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.13ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 98.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.57ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 192.87ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 83.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5482.86ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 52.2MB in the end (delta: 30.8MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 50.8MB in the end (delta: 1.4MB). 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, 17 locations, 22 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 891 mSDsluCounter, 798 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 659 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1387 IncrementalHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 139 mSDtfsCounter, 1387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=396occurred in iteration=8, InterpolantAutomatonStates: 112, 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, 314 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 2295 SizeOfPredicates, 16 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 94/307 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-03-16 14:03:03,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-16 14:03:05,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:03:05,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 14:03:05,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:03:05,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:03:05,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:03:05,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:03:05,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:03:05,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:03:05,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:03:05,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:03:05,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:03:05,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:03:05,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:03:05,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:03:05,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:03:05,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:03:05,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:05,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:03:05,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:03:05,341 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/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-03-16 14:03:05,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:03:05,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:03:05,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:03:05,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:03:05,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:03:05,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-16 14:03:06,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df874d9a8/07268cb3ea3a43f2941b7479d8b28c42/FLAG7fd8db243 [2025-03-16 14:03:06,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:03:06,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-03-16 14:03:06,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df874d9a8/07268cb3ea3a43f2941b7479d8b28c42/FLAG7fd8db243 [2025-03-16 14:03:07,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df874d9a8/07268cb3ea3a43f2941b7479d8b28c42 [2025-03-16 14:03:07,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:03:07,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:03:07,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:07,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:03:07,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:03:07,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d995af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07, skipping insertion in model container [2025-03-16 14:03:07,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:03:07,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-16 14:03:07,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:07,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:03:07,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2025-03-16 14:03:07,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:07,388 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:03:07,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07 WrapperNode [2025-03-16 14:03:07,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:07,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:07,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:03:07,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:03:07,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,410 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-03-16 14:03:07,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:07,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:03:07,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:03:07,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:03:07,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,430 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-03-16 14:03:07,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:03:07,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:03:07,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:03:07,440 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:03:07,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (1/1) ... [2025-03-16 14:03:07,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:07,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:03:07,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:03:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:03:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:03:07,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:03:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 14:03:07,539 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:03:07,540 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:03:07,644 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 14:03:07,644 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:03:07,651 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:03:07,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:03:07,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:07 BoogieIcfgContainer [2025-03-16 14:03:07,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:03:07,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:03:07,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:03:07,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:03:07,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:03:07" (1/3) ... [2025-03-16 14:03:07,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566e8570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:07, skipping insertion in model container [2025-03-16 14:03:07,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:07" (2/3) ... [2025-03-16 14:03:07,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566e8570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:07, skipping insertion in model container [2025-03-16 14:03:07,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:07" (3/3) ... [2025-03-16 14:03:07,661 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-03-16 14:03:07,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:03:07,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:03:07,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:03:07,717 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;@528cf916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:03:07,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:03:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 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-03-16 14:03:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 14:03:07,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:07,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 14:03:07,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1226331, now seen corresponding path program 1 times [2025-03-16 14:03:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137412881] [2025-03-16 14:03:07,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:07,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:07,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:03:07,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 14:03:07,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 14:03:07,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:07,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:07,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:03:07,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:07,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:03:07,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:07,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137412881] [2025-03-16 14:03:07,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137412881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:07,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072477122] [2025-03-16 14:03:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:07,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:07,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:07,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:07,854 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-03-16 14:03:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:07,881 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-03-16 14:03:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:07,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-16 14:03:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:07,890 INFO L225 Difference]: With dead ends: 19 [2025-03-16 14:03:07,891 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 14:03:07,893 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-03-16 14:03:07,895 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 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-03-16 14:03:07,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 14:03:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2025-03-16 14:03:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-03-16 14:03:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-16 14:03:07,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 4 [2025-03-16 14:03:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-16 14:03:07,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-03-16 14:03:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-03-16 14:03:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 14:03:07,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:07,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:07,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:03:08,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:08,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:08,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2002744091, now seen corresponding path program 1 times [2025-03-16 14:03:08,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:08,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429871388] [2025-03-16 14:03:08,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:08,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:08,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:08,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:08,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:03:08,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 14:03:08,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 14:03:08,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:08,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:08,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:03:08,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:08,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:08,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429871388] [2025-03-16 14:03:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429871388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:08,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2025-03-16 14:03:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760759909] [2025-03-16 14:03:08,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:08,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:03:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:08,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:03:08,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:03:08,232 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-03-16 14:03:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:08,271 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-03-16 14:03:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:03:08,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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 7 [2025-03-16 14:03:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:08,271 INFO L225 Difference]: With dead ends: 20 [2025-03-16 14:03:08,271 INFO L226 Difference]: Without dead ends: 17 [2025-03-16 14:03:08,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-03-16 14:03:08,272 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:08,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-16 14:03:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-16 14:03:08,275 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-03-16 14:03:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-16 14:03:08,276 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2025-03-16 14:03:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:08,276 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-16 14:03:08,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-03-16 14:03:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-16 14:03:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 14:03:08,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:08,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2025-03-16 14:03:08,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:08,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:08,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2032459227, now seen corresponding path program 2 times [2025-03-16 14:03:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791822505] [2025-03-16 14:03:08,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:08,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:08,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:03:08,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-16 14:03:08,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 14:03:08,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:03:08,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:08,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:03:08,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:08,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:08,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791822505] [2025-03-16 14:03:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791822505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:08,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2025-03-16 14:03:08,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235810532] [2025-03-16 14:03:08,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:03:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:08,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:03:08,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:03:08,767 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-03-16 14:03:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:08,896 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-03-16 14:03:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:03:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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 16 [2025-03-16 14:03:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:08,897 INFO L225 Difference]: With dead ends: 38 [2025-03-16 14:03:08,897 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 14:03:08,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 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-03-16 14:03:08,898 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:08,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 73 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 14:03:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-16 14:03:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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-03-16 14:03:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-16 14:03:08,907 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 16 [2025-03-16 14:03:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:08,907 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-16 14:03:08,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-03-16 14:03:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-16 14:03:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 14:03:08,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:08,908 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1] [2025-03-16 14:03:08,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:03:09,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:09,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash 515360091, now seen corresponding path program 3 times [2025-03-16 14:03:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17245051] [2025-03-16 14:03:09,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 14:03:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:09,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:09,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:09,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:03:09,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 9 equivalence classes. [2025-03-16 14:03:09,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:03:09,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 14:03:09,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:09,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-16 14:03:09,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:10,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:28,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:28,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17245051] [2025-03-16 14:03:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17245051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:28,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2025-03-16 14:03:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473661241] [2025-03-16 14:03:28,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:28,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-16 14:03:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:28,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-16 14:03:28,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=2162, Unknown=2, NotChecked=0, Total=2862 [2025-03-16 14:03:28,430 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 54 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 53 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-03-16 14:03:42,794 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-03-16 14:03:55,043 WARN L286 SmtUtils]: Spent 7.61s 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) [2025-03-16 14:04:11,285 WARN L286 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 14:04:20,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse41))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse41)))) (.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)))) (.cse25 ((_ 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 .cse25)))) (.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 ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse25)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse25)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse38)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 .cse30))))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse21)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse39)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse36)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse43)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse44)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse19))) .cse26)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse20 (bvslt .cse51 (_ bv8 32))) (.cse8 (= .cse50 .cse2)) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse24))) .cse26)))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse26)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))) (_ bv0 32))) (.cse42 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .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 .cse25)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 (= .cse2 .cse19) .cse14 .cse15 .cse7 .cse17) (or .cse20 .cse15 (= .cse2 .cse21) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse23)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse23))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse26)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse11))) .cse23) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse18 .cse0 .cse14 .cse15 (= .cse32 .cse2) .cse7 .cse17) (or (= .cse10 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse34 (_ bv8 32)) (= .cse35 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or .cse18 .cse5 (= .cse2 .cse36) .cse14 .cse15 .cse7 .cse17) (or .cse4 (= .cse2 .cse37) .cse7) (or .cse20 .cse5 (= .cse2 .cse38) .cse15 .cse7) (or .cse20 .cse0 (= .cse2 .cse39) .cse15 .cse7) (or .cse0 (= .cse2 .cse40) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse41 (_ bv8 32)) .cse8) (or .cse42 .cse0 .cse15 (= .cse2 .cse43) .cse7 .cse17) (or .cse42 .cse15 (= .cse2 .cse44) .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse40)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse29 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or .cse42 (= .cse45 .cse2) .cse5 .cse15 .cse7 .cse17) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2025-03-16 14:04:30,699 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)