./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:50:31,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:50:31,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 20:50:31,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:50:31,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:50:31,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:50:31,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:50:31,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:50:31,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:50:31,717 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:50:31,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:50:31,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:50:31,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:50:31,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:50:31,717 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:50:31,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:50:31,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:50:31,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:50:31,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:50:31,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:50:31,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:50:31,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:50:31,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:50:31,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:50:31,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:50:31,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:50:31,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:50:31,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:50:31,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:50:31,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:50:31,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:50:31,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:50:31,720 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2025-03-16 20:50:31,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:50:31,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:50:31,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:50:31,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:50:31,970 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:50:31,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2025-03-16 20:50:33,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce046a36/f50a50beba8e4a3089cbe5a80c993dc0/FLAG1533f4519 [2025-03-16 20:50:33,353 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:50:33,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2025-03-16 20:50:33,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce046a36/f50a50beba8e4a3089cbe5a80c993dc0/FLAG1533f4519 [2025-03-16 20:50:33,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce046a36/f50a50beba8e4a3089cbe5a80c993dc0 [2025-03-16 20:50:33,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:50:33,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:50:33,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:50:33,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:50:33,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:50:33,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:50:33" (1/1) ... [2025-03-16 20:50:33,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a6708a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:33, skipping insertion in model container [2025-03-16 20:50:33,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:50:33" (1/1) ... [2025-03-16 20:50:33,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:50:33,824 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2025-03-16 20:50:33,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:50:33,975 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:50:33,983 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2025-03-16 20:50:34,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:50:34,066 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:50:34,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34 WrapperNode [2025-03-16 20:50:34,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:50:34,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:50:34,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:50:34,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:50:34,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,219 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2025-03-16 20:50:34,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:50:34,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:50:34,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:50:34,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:50:34,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,341 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 20:50:34,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:50:34,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:50:34,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:50:34,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:50:34,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (1/1) ... [2025-03-16 20:50:34,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:50:34,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:34,448 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 20:50:34,450 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 20:50:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:50:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:50:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:50:34,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:50:34,592 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:50:34,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:50:36,132 INFO L? ?]: Removed 855 outVars from TransFormulas that were not future-live. [2025-03-16 20:50:36,133 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:50:36,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:50:36,225 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-16 20:50:36,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:50:36 BoogieIcfgContainer [2025-03-16 20:50:36,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:50:36,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:50:36,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:50:36,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:50:36,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:50:33" (1/3) ... [2025-03-16 20:50:36,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1c27d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:50:36, skipping insertion in model container [2025-03-16 20:50:36,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:34" (2/3) ... [2025-03-16 20:50:36,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1c27d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:50:36, skipping insertion in model container [2025-03-16 20:50:36,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:50:36" (3/3) ... [2025-03-16 20:50:36,233 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2025-03-16 20:50:36,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:50:36,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c that has 1 procedures, 595 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 20:50:36,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:50:36,326 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;@5d421117, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:50:36,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 20:50:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 594 states have internal predecessors, (892), 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 20:50:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 20:50:36,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:36,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:36,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1705196510, now seen corresponding path program 1 times [2025-03-16 20:50:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925238162] [2025-03-16 20:50:36,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:36,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 20:50:36,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 20:50:36,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:36,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:36,811 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 20:50:36,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:36,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925238162] [2025-03-16 20:50:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925238162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:36,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:36,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604259872] [2025-03-16 20:50:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:36,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:36,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:36,835 INFO L87 Difference]: Start difference. First operand has 595 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 594 states have internal predecessors, (892), 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 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 20:50:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:37,164 INFO L93 Difference]: Finished difference Result 1147 states and 1722 transitions. [2025-03-16 20:50:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2025-03-16 20:50:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:37,177 INFO L225 Difference]: With dead ends: 1147 [2025-03-16 20:50:37,177 INFO L226 Difference]: Without dead ends: 593 [2025-03-16 20:50:37,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:50:37,182 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 858 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:37,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1467 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-16 20:50:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-16 20:50:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.5) internal successors, (888), 592 states have internal predecessors, (888), 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 20:50:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 888 transitions. [2025-03-16 20:50:37,223 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 888 transitions. Word has length 58 [2025-03-16 20:50:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:37,223 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 888 transitions. [2025-03-16 20:50:37,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 20:50:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 888 transitions. [2025-03-16 20:50:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:50:37,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:37,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:37,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:50:37,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1060828836, now seen corresponding path program 1 times [2025-03-16 20:50:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972500414] [2025-03-16 20:50:37,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:37,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:50:37,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:50:37,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:37,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:37,403 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 20:50:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972500414] [2025-03-16 20:50:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972500414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:37,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:37,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244949758] [2025-03-16 20:50:37,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:37,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:50:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:37,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:50:37,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:50:37,407 INFO L87 Difference]: Start difference. First operand 593 states and 888 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 20:50:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:37,632 INFO L93 Difference]: Finished difference Result 1146 states and 1717 transitions. [2025-03-16 20:50:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:50:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2025-03-16 20:50:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:37,635 INFO L225 Difference]: With dead ends: 1146 [2025-03-16 20:50:37,635 INFO L226 Difference]: Without dead ends: 594 [2025-03-16 20:50:37,636 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 20:50:37,637 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 0 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:37,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1475 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-16 20:50:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-16 20:50:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.4991568296795952) internal successors, (889), 593 states have internal predecessors, (889), 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 20:50:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2025-03-16 20:50:37,698 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2025-03-16 20:50:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:37,698 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2025-03-16 20:50:37,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 20:50:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2025-03-16 20:50:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:50:37,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:37,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:37,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:50:37,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:37,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:37,700 INFO L85 PathProgramCache]: Analyzing trace with hash 588360701, now seen corresponding path program 1 times [2025-03-16 20:50:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:37,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948825745] [2025-03-16 20:50:37,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:37,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:37,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:50:37,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:50:37,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:37,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:37,895 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 20:50:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948825745] [2025-03-16 20:50:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948825745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:37,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:37,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076186862] [2025-03-16 20:50:37,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:37,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:37,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:37,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:37,897 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 20:50:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:38,146 INFO L93 Difference]: Finished difference Result 598 states and 893 transitions. [2025-03-16 20:50:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:38,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2025-03-16 20:50:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:38,149 INFO L225 Difference]: With dead ends: 598 [2025-03-16 20:50:38,149 INFO L226 Difference]: Without dead ends: 596 [2025-03-16 20:50:38,149 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 20:50:38,150 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 0 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:38,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2212 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-16 20:50:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-16 20:50:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 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 20:50:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2025-03-16 20:50:38,167 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 59 [2025-03-16 20:50:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:38,167 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2025-03-16 20:50:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 20:50:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2025-03-16 20:50:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:50:38,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:38,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:50:38,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992516, now seen corresponding path program 1 times [2025-03-16 20:50:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016746815] [2025-03-16 20:50:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:38,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:50:38,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:50:38,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:38,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:38,337 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 20:50:38,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016746815] [2025-03-16 20:50:38,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016746815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:38,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:38,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426347852] [2025-03-16 20:50:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:38,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:38,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:38,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:38,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:38,339 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 20:50:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:38,594 INFO L93 Difference]: Finished difference Result 1153 states and 1724 transitions. [2025-03-16 20:50:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-03-16 20:50:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:38,597 INFO L225 Difference]: With dead ends: 1153 [2025-03-16 20:50:38,598 INFO L226 Difference]: Without dead ends: 598 [2025-03-16 20:50:38,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 20:50:38,600 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 0 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:38,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2209 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-16 20:50:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-03-16 20:50:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 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 20:50:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2025-03-16 20:50:38,615 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 60 [2025-03-16 20:50:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:38,615 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2025-03-16 20:50:38,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 20:50:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2025-03-16 20:50:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:50:38,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:38,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:38,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:50:38,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 555539672, now seen corresponding path program 1 times [2025-03-16 20:50:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618200824] [2025-03-16 20:50:38,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:38,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:50:38,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:50:38,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:38,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:38,765 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 20:50:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618200824] [2025-03-16 20:50:38,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618200824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:38,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:38,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:38,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653666799] [2025-03-16 20:50:38,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:38,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:38,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:38,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:38,768 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 20:50:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:39,001 INFO L93 Difference]: Finished difference Result 1157 states and 1728 transitions. [2025-03-16 20:50:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:39,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-03-16 20:50:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:39,003 INFO L225 Difference]: With dead ends: 1157 [2025-03-16 20:50:39,003 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 20:50:39,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 20:50:39,004 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 0 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:39,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2204 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 20:50:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-16 20:50:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 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 20:50:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2025-03-16 20:50:39,017 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 61 [2025-03-16 20:50:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:39,017 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2025-03-16 20:50:39,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 20:50:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2025-03-16 20:50:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:50:39,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:39,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:39,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:50:39,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:39,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1930223977, now seen corresponding path program 1 times [2025-03-16 20:50:39,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:39,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797044703] [2025-03-16 20:50:39,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:39,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:39,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:50:39,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:50:39,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:39,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:39,264 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 20:50:39,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797044703] [2025-03-16 20:50:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797044703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:39,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:39,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266037158] [2025-03-16 20:50:39,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:39,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:39,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:39,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:39,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:39,268 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 20:50:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:39,577 INFO L93 Difference]: Finished difference Result 1163 states and 1735 transitions. [2025-03-16 20:50:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2025-03-16 20:50:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:39,580 INFO L225 Difference]: With dead ends: 1163 [2025-03-16 20:50:39,580 INFO L226 Difference]: Without dead ends: 604 [2025-03-16 20:50:39,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:39,581 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 4 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:39,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2931 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-16 20:50:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2025-03-16 20:50:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 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 20:50:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2025-03-16 20:50:39,591 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 62 [2025-03-16 20:50:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:39,592 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2025-03-16 20:50:39,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 20:50:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2025-03-16 20:50:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:50:39,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:39,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:39,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:50:39,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash 527262894, now seen corresponding path program 1 times [2025-03-16 20:50:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:39,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695426047] [2025-03-16 20:50:39,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:39,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:50:39,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:50:39,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:39,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:39,886 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 20:50:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:39,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695426047] [2025-03-16 20:50:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695426047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:39,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:50:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134794063] [2025-03-16 20:50:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:39,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:39,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:39,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:39,887 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 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 20:50:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:40,306 INFO L93 Difference]: Finished difference Result 1174 states and 1751 transitions. [2025-03-16 20:50:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:40,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 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 63 [2025-03-16 20:50:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:40,309 INFO L225 Difference]: With dead ends: 1174 [2025-03-16 20:50:40,309 INFO L226 Difference]: Without dead ends: 613 [2025-03-16 20:50:40,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:40,311 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 870 mSDsluCounter, 2121 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:40,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 2834 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-16 20:50:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 604. [2025-03-16 20:50:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.4908789386401327) internal successors, (899), 603 states have internal predecessors, (899), 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 20:50:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 899 transitions. [2025-03-16 20:50:40,321 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 899 transitions. Word has length 63 [2025-03-16 20:50:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:40,321 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 899 transitions. [2025-03-16 20:50:40,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 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 20:50:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 899 transitions. [2025-03-16 20:50:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:50:40,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:40,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:50:40,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -48315926, now seen corresponding path program 1 times [2025-03-16 20:50:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784685925] [2025-03-16 20:50:40,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:40,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:50:40,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:50:40,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:40,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:40,475 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 20:50:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:40,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784685925] [2025-03-16 20:50:40,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784685925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:40,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:40,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:40,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482805742] [2025-03-16 20:50:40,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:40,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:40,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:40,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:40,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:40,476 INFO L87 Difference]: Start difference. First operand 604 states and 899 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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 20:50:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:40,778 INFO L93 Difference]: Finished difference Result 1194 states and 1777 transitions. [2025-03-16 20:50:40,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:40,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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 63 [2025-03-16 20:50:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:40,781 INFO L225 Difference]: With dead ends: 1194 [2025-03-16 20:50:40,781 INFO L226 Difference]: Without dead ends: 631 [2025-03-16 20:50:40,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:40,783 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 64 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:40,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 2895 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:50:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-16 20:50:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2025-03-16 20:50:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.488888888888889) internal successors, (938), 630 states have internal predecessors, (938), 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 20:50:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 938 transitions. [2025-03-16 20:50:40,796 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 938 transitions. Word has length 63 [2025-03-16 20:50:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:40,796 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 938 transitions. [2025-03-16 20:50:40,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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 20:50:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 938 transitions. [2025-03-16 20:50:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:50:40,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:40,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:50:40,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:40,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash -765089958, now seen corresponding path program 1 times [2025-03-16 20:50:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77508666] [2025-03-16 20:50:40,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:50:40,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:50:40,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:40,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:40,929 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 20:50:40,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77508666] [2025-03-16 20:50:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77508666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132126697] [2025-03-16 20:50:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:40,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:40,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:40,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:40,931 INFO L87 Difference]: Start difference. First operand 631 states and 938 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:41,137 INFO L93 Difference]: Finished difference Result 1193 states and 1775 transitions. [2025-03-16 20:50:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:41,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:50:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:41,139 INFO L225 Difference]: With dead ends: 1193 [2025-03-16 20:50:41,139 INFO L226 Difference]: Without dead ends: 630 [2025-03-16 20:50:41,140 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 20:50:41,142 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 850 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:41,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1466 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-16 20:50:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-03-16 20:50:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 1.4880763116057234) internal successors, (936), 629 states have internal predecessors, (936), 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 20:50:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 936 transitions. [2025-03-16 20:50:41,153 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 936 transitions. Word has length 64 [2025-03-16 20:50:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:41,153 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 936 transitions. [2025-03-16 20:50:41,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 936 transitions. [2025-03-16 20:50:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:50:41,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:41,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:41,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:50:41,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:41,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash 126668047, now seen corresponding path program 1 times [2025-03-16 20:50:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033465874] [2025-03-16 20:50:41,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:41,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:50:41,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:50:41,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:41,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:41,402 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 20:50:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:41,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033465874] [2025-03-16 20:50:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033465874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:41,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:41,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76241742] [2025-03-16 20:50:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:41,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:41,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:41,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:41,404 INFO L87 Difference]: Start difference. First operand 630 states and 936 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:41,668 INFO L93 Difference]: Finished difference Result 1192 states and 1774 transitions. [2025-03-16 20:50:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:50:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:41,670 INFO L225 Difference]: With dead ends: 1192 [2025-03-16 20:50:41,670 INFO L226 Difference]: Without dead ends: 630 [2025-03-16 20:50:41,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:41,671 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 848 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:41,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1394 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-16 20:50:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2025-03-16 20:50:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4832535885167464) internal successors, (930), 627 states have internal predecessors, (930), 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 20:50:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 930 transitions. [2025-03-16 20:50:41,681 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 930 transitions. Word has length 64 [2025-03-16 20:50:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:41,681 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 930 transitions. [2025-03-16 20:50:41,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:50:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 930 transitions. [2025-03-16 20:50:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:50:41,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:41,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:41,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:50:41,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:41,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2127469222, now seen corresponding path program 1 times [2025-03-16 20:50:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097331173] [2025-03-16 20:50:41,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:41,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:50:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:50:41,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:41,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:42,041 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 20:50:42,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:42,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097331173] [2025-03-16 20:50:42,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097331173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:42,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:42,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:50:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051372339] [2025-03-16 20:50:42,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:42,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 20:50:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:42,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 20:50:42,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:50:42,043 INFO L87 Difference]: Start difference. First operand 628 states and 930 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 20:50:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:42,766 INFO L93 Difference]: Finished difference Result 1204 states and 1782 transitions. [2025-03-16 20:50:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:50:42,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 65 [2025-03-16 20:50:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:42,768 INFO L225 Difference]: With dead ends: 1204 [2025-03-16 20:50:42,768 INFO L226 Difference]: Without dead ends: 644 [2025-03-16 20:50:42,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:50:42,769 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 867 mSDsluCounter, 4939 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:42,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 5661 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:50:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-16 20:50:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 639. [2025-03-16 20:50:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 1.4780564263322884) internal successors, (943), 638 states have internal predecessors, (943), 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 20:50:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 943 transitions. [2025-03-16 20:50:42,779 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 943 transitions. Word has length 65 [2025-03-16 20:50:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:42,779 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 943 transitions. [2025-03-16 20:50:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 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 20:50:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 943 transitions. [2025-03-16 20:50:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:50:42,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:42,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:42,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:50:42,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:42,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 648457236, now seen corresponding path program 1 times [2025-03-16 20:50:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795609135] [2025-03-16 20:50:42,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:42,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:50:42,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:50:42,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:42,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:42,934 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 20:50:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:42,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795609135] [2025-03-16 20:50:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795609135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300805501] [2025-03-16 20:50:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:42,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:50:42,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:42,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:50:42,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:42,936 INFO L87 Difference]: Start difference. First operand 639 states and 943 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 20:50:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:43,323 INFO L93 Difference]: Finished difference Result 1214 states and 1792 transitions. [2025-03-16 20:50:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:43,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 65 [2025-03-16 20:50:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:43,326 INFO L225 Difference]: With dead ends: 1214 [2025-03-16 20:50:43,326 INFO L226 Difference]: Without dead ends: 643 [2025-03-16 20:50:43,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:43,327 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 9 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3596 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:43,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3596 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-03-16 20:50:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 640. [2025-03-16 20:50:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 1.4773082942097027) internal successors, (944), 639 states have internal predecessors, (944), 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 20:50:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 944 transitions. [2025-03-16 20:50:43,338 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 944 transitions. Word has length 65 [2025-03-16 20:50:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:43,339 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 944 transitions. [2025-03-16 20:50:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 20:50:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 944 transitions. [2025-03-16 20:50:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:50:43,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:43,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:50:43,340 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1573930961, now seen corresponding path program 1 times [2025-03-16 20:50:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835770170] [2025-03-16 20:50:43,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:43,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:50:43,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:50:43,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:43,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:43,767 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 20:50:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835770170] [2025-03-16 20:50:43,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835770170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:43,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:43,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:50:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368580841] [2025-03-16 20:50:43,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:43,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 20:50:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:43,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 20:50:43,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:50:43,769 INFO L87 Difference]: Start difference. First operand 640 states and 944 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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 20:50:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:44,570 INFO L93 Difference]: Finished difference Result 1223 states and 1803 transitions. [2025-03-16 20:50:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:50:44,570 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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 66 [2025-03-16 20:50:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:44,572 INFO L225 Difference]: With dead ends: 1223 [2025-03-16 20:50:44,572 INFO L226 Difference]: Without dead ends: 651 [2025-03-16 20:50:44,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:50:44,573 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 856 mSDsluCounter, 5638 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 6361 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:50:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-16 20:50:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 643. [2025-03-16 20:50:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.4766355140186915) internal successors, (948), 642 states have internal predecessors, (948), 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 20:50:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 948 transitions. [2025-03-16 20:50:44,583 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 948 transitions. Word has length 66 [2025-03-16 20:50:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:44,583 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 948 transitions. [2025-03-16 20:50:44,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 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 20:50:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 948 transitions. [2025-03-16 20:50:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 20:50:44,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:44,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:44,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:50:44,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:44,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1819355991, now seen corresponding path program 1 times [2025-03-16 20:50:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760083834] [2025-03-16 20:50:44,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:44,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 20:50:44,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 20:50:44,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:44,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:44,775 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 20:50:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:44,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760083834] [2025-03-16 20:50:44,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760083834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:44,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:44,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:50:44,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789611419] [2025-03-16 20:50:44,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:44,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:50:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:44,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:50:44,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:50:44,777 INFO L87 Difference]: Start difference. First operand 643 states and 948 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 20:50:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:45,299 INFO L93 Difference]: Finished difference Result 1227 states and 1807 transitions. [2025-03-16 20:50:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:50:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 67 [2025-03-16 20:50:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:45,301 INFO L225 Difference]: With dead ends: 1227 [2025-03-16 20:50:45,301 INFO L226 Difference]: Without dead ends: 652 [2025-03-16 20:50:45,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:50:45,304 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 6 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5013 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:45,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5013 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:50:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-16 20:50:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2025-03-16 20:50:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.473035439137134) internal successors, (956), 649 states have internal predecessors, (956), 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 20:50:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 956 transitions. [2025-03-16 20:50:45,317 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 956 transitions. Word has length 67 [2025-03-16 20:50:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:45,317 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 956 transitions. [2025-03-16 20:50:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 20:50:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 956 transitions. [2025-03-16 20:50:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 20:50:45,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:45,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:45,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:50:45,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash -522171073, now seen corresponding path program 1 times [2025-03-16 20:50:45,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:45,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946559993] [2025-03-16 20:50:45,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:45,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 20:50:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 20:50:45,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:45,548 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 20:50:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946559993] [2025-03-16 20:50:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946559993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:45,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574452092] [2025-03-16 20:50:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:45,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:50:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:45,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:50:45,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:45,551 INFO L87 Difference]: Start difference. First operand 650 states and 956 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 20:50:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:45,939 INFO L93 Difference]: Finished difference Result 1240 states and 1823 transitions. [2025-03-16 20:50:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:45,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2025-03-16 20:50:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:45,942 INFO L225 Difference]: With dead ends: 1240 [2025-03-16 20:50:45,942 INFO L226 Difference]: Without dead ends: 658 [2025-03-16 20:50:45,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:50:45,944 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 835 mSDsluCounter, 2909 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:45,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 3642 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-16 20:50:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 654. [2025-03-16 20:50:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.4732006125574273) internal successors, (962), 653 states have internal predecessors, (962), 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 20:50:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 962 transitions. [2025-03-16 20:50:45,954 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 962 transitions. Word has length 67 [2025-03-16 20:50:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:45,955 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 962 transitions. [2025-03-16 20:50:45,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 20:50:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 962 transitions. [2025-03-16 20:50:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:50:45,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:45,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:45,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:50:45,956 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:45,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1692364189, now seen corresponding path program 1 times [2025-03-16 20:50:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:45,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866498648] [2025-03-16 20:50:45,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:45,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:50:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:50:45,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:45,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:46,070 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 20:50:46,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866498648] [2025-03-16 20:50:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866498648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:46,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642554279] [2025-03-16 20:50:46,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:46,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:50:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:46,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:50:46,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:50:46,071 INFO L87 Difference]: Start difference. First operand 654 states and 962 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 20:50:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:46,865 INFO L93 Difference]: Finished difference Result 1771 states and 2605 transitions. [2025-03-16 20:50:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:50:46,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-03-16 20:50:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:46,869 INFO L225 Difference]: With dead ends: 1771 [2025-03-16 20:50:46,869 INFO L226 Difference]: Without dead ends: 1185 [2025-03-16 20:50:46,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:50:46,871 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 797 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:46,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2174 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 20:50:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-16 20:50:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 707. [2025-03-16 20:50:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.4589235127478755) internal successors, (1030), 706 states have internal predecessors, (1030), 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 20:50:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1030 transitions. [2025-03-16 20:50:46,884 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1030 transitions. Word has length 68 [2025-03-16 20:50:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:46,885 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1030 transitions. [2025-03-16 20:50:46,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 20:50:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1030 transitions. [2025-03-16 20:50:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:50:46,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:46,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:46,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:50:46,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:46,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash -362295451, now seen corresponding path program 1 times [2025-03-16 20:50:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:46,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924849909] [2025-03-16 20:50:46,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:46,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:50:46,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:50:46,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:46,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:47,199 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 20:50:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924849909] [2025-03-16 20:50:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924849909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:47,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:47,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:50:47,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236068954] [2025-03-16 20:50:47,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:47,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 20:50:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:47,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 20:50:47,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:50:47,200 INFO L87 Difference]: Start difference. First operand 707 states and 1030 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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 20:50:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:47,863 INFO L93 Difference]: Finished difference Result 1838 states and 2705 transitions. [2025-03-16 20:50:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:50:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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 69 [2025-03-16 20:50:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:47,866 INFO L225 Difference]: With dead ends: 1838 [2025-03-16 20:50:47,867 INFO L226 Difference]: Without dead ends: 1233 [2025-03-16 20:50:47,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-16 20:50:47,868 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 2320 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:47,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 3466 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:50:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-03-16 20:50:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 723. [2025-03-16 20:50:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.448753462603878) internal successors, (1046), 722 states have internal predecessors, (1046), 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 20:50:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1046 transitions. [2025-03-16 20:50:47,880 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1046 transitions. Word has length 69 [2025-03-16 20:50:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:47,880 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1046 transitions. [2025-03-16 20:50:47,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 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 20:50:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1046 transitions. [2025-03-16 20:50:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:50:47,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:47,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:47,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:50:47,881 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1754334299, now seen corresponding path program 1 times [2025-03-16 20:50:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128206964] [2025-03-16 20:50:47,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:47,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:50:47,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:50:47,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:48,050 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 20:50:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128206964] [2025-03-16 20:50:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128206964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:48,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:50:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086553696] [2025-03-16 20:50:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:48,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:50:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:48,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:50:48,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:50:48,051 INFO L87 Difference]: Start difference. First operand 723 states and 1046 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 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 20:50:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:48,637 INFO L93 Difference]: Finished difference Result 1357 states and 1968 transitions. [2025-03-16 20:50:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:50:48,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 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 70 [2025-03-16 20:50:48,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:48,639 INFO L225 Difference]: With dead ends: 1357 [2025-03-16 20:50:48,640 INFO L226 Difference]: Without dead ends: 734 [2025-03-16 20:50:48,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:50:48,641 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 869 mSDsluCounter, 3461 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:48,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 4156 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:50:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-16 20:50:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 726. [2025-03-16 20:50:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 725 states have internal predecessors, (1048), 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 20:50:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1048 transitions. [2025-03-16 20:50:48,650 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1048 transitions. Word has length 70 [2025-03-16 20:50:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:48,650 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1048 transitions. [2025-03-16 20:50:48,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 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 20:50:48,650 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1048 transitions. [2025-03-16 20:50:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:50:48,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:48,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:48,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:50:48,651 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:48,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1000435918, now seen corresponding path program 1 times [2025-03-16 20:50:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:48,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592435234] [2025-03-16 20:50:48,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:48,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:50:48,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:50:48,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:48,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:48,950 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 20:50:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592435234] [2025-03-16 20:50:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592435234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:48,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:50:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30490771] [2025-03-16 20:50:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:48,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:50:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:48,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:50:48,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:50:48,952 INFO L87 Difference]: Start difference. First operand 726 states and 1048 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 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 20:50:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:49,430 INFO L93 Difference]: Finished difference Result 1335 states and 1937 transitions. [2025-03-16 20:50:49,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:50:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2025-03-16 20:50:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:49,432 INFO L225 Difference]: With dead ends: 1335 [2025-03-16 20:50:49,432 INFO L226 Difference]: Without dead ends: 737 [2025-03-16 20:50:49,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:50:49,433 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 824 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:49,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 3507 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-16 20:50:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 726. [2025-03-16 20:50:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 725 states have internal predecessors, (1048), 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 20:50:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1048 transitions. [2025-03-16 20:50:49,442 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1048 transitions. Word has length 70 [2025-03-16 20:50:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1048 transitions. [2025-03-16 20:50:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 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 20:50:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1048 transitions. [2025-03-16 20:50:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:50:49,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:49,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:49,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:50:49,443 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:49,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -345267187, now seen corresponding path program 1 times [2025-03-16 20:50:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606366134] [2025-03-16 20:50:49,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:49,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:50:49,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:50:49,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:49,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:49,555 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 20:50:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606366134] [2025-03-16 20:50:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606366134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:50:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924854356] [2025-03-16 20:50:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:49,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:49,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:49,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:49,556 INFO L87 Difference]: Start difference. First operand 726 states and 1048 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 20:50:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:49,784 INFO L93 Difference]: Finished difference Result 1341 states and 1946 transitions. [2025-03-16 20:50:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2025-03-16 20:50:49,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:49,786 INFO L225 Difference]: With dead ends: 1341 [2025-03-16 20:50:49,786 INFO L226 Difference]: Without dead ends: 726 [2025-03-16 20:50:49,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:49,787 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 871 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:49,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1404 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:50:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-16 20:50:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 720. [2025-03-16 20:50:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 1.4464534075104312) internal successors, (1040), 719 states have internal predecessors, (1040), 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 20:50:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1040 transitions. [2025-03-16 20:50:49,797 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1040 transitions. Word has length 71 [2025-03-16 20:50:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:49,797 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1040 transitions. [2025-03-16 20:50:49,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 20:50:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1040 transitions. [2025-03-16 20:50:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:50:49,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:49,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:49,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:50:49,798 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:49,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash 478994285, now seen corresponding path program 1 times [2025-03-16 20:50:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:49,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838430447] [2025-03-16 20:50:49,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:49,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:49,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:50:49,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:50:49,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:49,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:49,955 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 20:50:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:50:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838430447] [2025-03-16 20:50:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838430447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:49,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:49,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:50:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513519462] [2025-03-16 20:50:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:49,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:50:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:50:49,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:50:49,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:50:49,957 INFO L87 Difference]: Start difference. First operand 720 states and 1040 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 20:50:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:50,421 INFO L93 Difference]: Finished difference Result 1338 states and 1941 transitions. [2025-03-16 20:50:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:50:50,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2025-03-16 20:50:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:50,423 INFO L225 Difference]: With dead ends: 1338 [2025-03-16 20:50:50,423 INFO L226 Difference]: Without dead ends: 733 [2025-03-16 20:50:50,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:50:50,423 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 5 mSDsluCounter, 4324 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5050 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:50,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5050 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:50:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-16 20:50:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 716. [2025-03-16 20:50:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4489510489510489) internal successors, (1036), 715 states have internal predecessors, (1036), 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 20:50:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1036 transitions. [2025-03-16 20:50:50,432 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1036 transitions. Word has length 71 [2025-03-16 20:50:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:50,432 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1036 transitions. [2025-03-16 20:50:50,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 20:50:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1036 transitions. [2025-03-16 20:50:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:50:50,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:50,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:50,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:50:50,433 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:50,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -901705259, now seen corresponding path program 1 times [2025-03-16 20:50:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:50:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513647500] [2025-03-16 20:50:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:50:50,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:50:50,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:50:50,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:50,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 20:50:50,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 20:50:50,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:50:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:50:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 20:50:50,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 20:50:50,504 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 20:50:50,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 20:50:50,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:50:50,509 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:50:50,547 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 20:50:50,560 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 20:50:50,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 08:50:50 BoogieIcfgContainer [2025-03-16 20:50:50,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 20:50:50,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 20:50:50,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 20:50:50,566 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 20:50:50,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:50:36" (3/4) ... [2025-03-16 20:50:50,569 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 20:50:50,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 20:50:50,570 INFO L158 Benchmark]: Toolchain (without parser) took 16875.52ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 104.2MB in the beginning and 137.0MB in the end (delta: -32.8MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2025-03-16 20:50:50,570 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 20:50:50,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.91ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 78.0MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 20:50:50,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 152.77ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 38.5MB in the end (delta: 39.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 20:50:50,571 INFO L158 Benchmark]: Boogie Preprocessor took 200.05ms. Allocated memory is still 142.6MB. Free memory was 38.5MB in the beginning and 72.1MB in the end (delta: -33.6MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2025-03-16 20:50:50,572 INFO L158 Benchmark]: IcfgBuilder took 1804.18ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 72.1MB in the beginning and 45.6MB in the end (delta: 26.5MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2025-03-16 20:50:50,572 INFO L158 Benchmark]: TraceAbstraction took 14337.96ms. Allocated memory is still 251.7MB. Free memory was 45.1MB in the beginning and 137.0MB in the end (delta: -92.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 20:50:50,572 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 251.7MB. Free memory was 137.0MB in the beginning and 137.0MB in the end (delta: 21.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 20:50:50,573 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.91ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 78.0MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 152.77ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 38.5MB in the end (delta: 39.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 200.05ms. Allocated memory is still 142.6MB. Free memory was 38.5MB in the beginning and 72.1MB in the end (delta: -33.6MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1804.18ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 72.1MB in the beginning and 45.6MB in the end (delta: 26.5MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14337.96ms. Allocated memory is still 251.7MB. Free memory was 45.1MB in the beginning and 137.0MB in the end (delta: -92.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 251.7MB. Free memory was 137.0MB in the beginning and 137.0MB in the end (delta: 21.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 shiftRight at line 109, overapproximation of bitwiseAnd at line 110, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 116, overapproximation of bitwiseAnd at line 107. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 17; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 20; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=17, var_28=1, var_30=0, var_32=16, var_5=0, var_79=20] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=20] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_30=0, var_32=16, var_79=20] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=20] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_79=20] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=20] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=20] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_79=20] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_79=20] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=20] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=20] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=-2, var_33_arg_1=16, var_79=20] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=20] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=20] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=20] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_34=1, var_79=20] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=20] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_79=20] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=17, var_28=1, var_29=1, var_30=0, var_32=16, var_33=17, var_33_arg_1=16, var_79=20] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 595 locations, 892 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11753 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11753 mSDsluCounter, 65117 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50087 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16004 IncrementalHoareTripleChecker+Invalid, 16029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 15030 mSDtfsCounter, 16004 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=18, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1065 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1434 NumberOfCodeBlocks, 1434 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1341 ConstructedInterpolants, 0 QuantifiedInterpolants, 4530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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 20:50:50,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:50:52,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:50:52,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 20:50:52,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:50:52,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:50:52,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:50:52,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:50:52,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:50:52,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:50:52,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:50:52,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:50:52,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:50:52,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:50:52,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:50:52,496 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:50:52,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:50:52,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:50:52,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:50:52,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:50:52,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:50:52,498 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10b9451aec1c717f408158c024da4f049a32ac1e1eb7cd36cf3cd1261409bb31 [2025-03-16 20:50:52,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:50:52,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:50:52,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:50:52,760 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:50:52,760 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:50:52,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2025-03-16 20:50:53,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91a62b39/71b9b78757934f918d7c72d00bbce6b9/FLAG3a5be80a5 [2025-03-16 20:50:54,104 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:50:54,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c [2025-03-16 20:50:54,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91a62b39/71b9b78757934f918d7c72d00bbce6b9/FLAG3a5be80a5 [2025-03-16 20:50:54,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91a62b39/71b9b78757934f918d7c72d00bbce6b9 [2025-03-16 20:50:54,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:50:54,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:50:54,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:50:54,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:50:54,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:50:54,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c42820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54, skipping insertion in model container [2025-03-16 20:50:54,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:50:54,606 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2025-03-16 20:50:54,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:50:54,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:50:54,712 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/hardware-verification-bv/btor2c-lazyMod.adding.1.prop1-func-interl.c[1173,1186] [2025-03-16 20:50:54,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:50:54,777 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:50:54,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54 WrapperNode [2025-03-16 20:50:54,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:50:54,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:50:54,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:50:54,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:50:54,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,820 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2025-03-16 20:50:54,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:50:54,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:50:54,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:50:54,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:50:54,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,848 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 20:50:54,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:50:54,868 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:50:54,868 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:50:54,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:50:54,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (1/1) ... [2025-03-16 20:50:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:50:54,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:54,898 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 20:50:54,901 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 20:50:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:50:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 20:50:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:50:54,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:50:55,028 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:50:55,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:50:55,363 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-16 20:50:55,364 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:50:55,369 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:50:55,370 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:50:55,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:50:55 BoogieIcfgContainer [2025-03-16 20:50:55,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:50:55,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:50:55,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:50:55,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:50:55,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:50:54" (1/3) ... [2025-03-16 20:50:55,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36636b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:50:55, skipping insertion in model container [2025-03-16 20:50:55,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:50:54" (2/3) ... [2025-03-16 20:50:55,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36636b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:50:55, skipping insertion in model container [2025-03-16 20:50:55,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:50:55" (3/3) ... [2025-03-16 20:50:55,378 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c [2025-03-16 20:50:55,387 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:50:55,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.1.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 20:50:55,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:50:55,431 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;@693ac3e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:50:55,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 20:50:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) 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 20:50:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 20:50:55,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:55,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 20:50:55,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 20:50:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 20:50:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132196193] [2025-03-16 20:50:55,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:55,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:55,453 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 20:50:55,454 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 20:50:55,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 20:50:55,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 20:50:55,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:55,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:55,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 20:50:55,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:55,893 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 20:50:55,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:50:55,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 20:50:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132196193] [2025-03-16 20:50:55,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132196193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:50:55,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:50:55,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:50:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462644421] [2025-03-16 20:50:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:50:55,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:50:55,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 20:50:55,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:50:55,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:50:55,913 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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 20:50:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:50:55,972 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-03-16 20:50:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:50:55,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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 20:50:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:50:55,979 INFO L225 Difference]: With dead ends: 15 [2025-03-16 20:50:55,979 INFO L226 Difference]: Without dead ends: 8 [2025-03-16 20:50:55,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:50:55,984 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:50:55,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:50:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-03-16 20:50:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-16 20:50:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 20:50:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 20:50:56,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 20:50:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:50:56,005 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 20:50:56,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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 20:50:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 20:50:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 20:50:56,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:50:56,006 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 20:50:56,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 20:50:56,206 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 20:50:56,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:50:56,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:50:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 20:50:56,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 20:50:56,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408508678] [2025-03-16 20:50:56,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:50:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:50:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:50:56,210 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 20:50:56,211 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 20:50:56,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 20:50:56,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 20:50:56,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:50:56,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:50:56,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-16 20:50:56,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:50:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:50:58,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:51:16,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv255 32))))) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (let ((.cse114 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse116 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse113 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 .cse14)))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 (_ bv254 32))))) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse204 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse205 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse204) (= (_ bv0 8) .cse205) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse220 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse212 ((_ zero_extend 24) .cse205)) (.cse216 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse218 ((_ zero_extend 24) .cse204))) (let ((.cse217 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse223 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse218))))))) (.cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse216))))))) (.cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse214 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse222 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse212))))))) (.cse206 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse220)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse207 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse210 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse208 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse206 .cse207))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse207))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse208 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse210 .cse211))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse209 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse210 .cse211)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse209 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse208 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse219 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse216 .cse217))))) (let ((.cse221 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 .cse219))))) (let ((.cse215 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse220 .cse221))))) (let ((.cse213 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse215))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse212 .cse213))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse214 .cse215))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse216 .cse217))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse218 .cse219)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse220 .cse221)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse222 .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse214)))))) .cse207))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse223))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse211 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse210 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse217))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse45))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 .cse213))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse228 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse206 .cse225))))))) (.cse229 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse226 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse12))) .cse222)))) (.cse227 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse228 .cse229))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse228 .cse229)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse232 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse233 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse224 .cse211)))))))) (let ((.cse230 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse232 .cse233)))) (.cse231 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse217 .cse14))) .cse223))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse230 .cse231))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse230 .cse231))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse232 .cse233)))))))))))))))))))))))))))))))))))) .cse7))))))))))))))))))) (.cse5 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse203 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse196 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse198 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse191 ((_ zero_extend 24) .cse203))) (let ((.cse190 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse191))))))) (.cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse198))))))) (.cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse196))))))) (.cse189 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse186 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse188 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse192 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse180 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse191 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse193))))))) (.cse181 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse178 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse189 .cse12))) .cse190)))) (.cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse181))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse178 .cse179))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse178 .cse179))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse180 .cse181)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse184 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse187 .cse188))))))) (.cse185 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse182 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse186 .cse14))))))) (.cse183 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse184 .cse185))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse182 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse182 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse184 .cse185))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse200 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse199 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse197 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse186)))))))) (let ((.cse195 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 .cse197))))) (let ((.cse194 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse189 .cse195))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse194 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse189 .cse195))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse196 .cse197))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse198 .cse186))) (_ bv0 32))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse190 .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse189)))))) .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse188 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse186))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse45)))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse201 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse192 .cse199))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse201 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse202 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 .cse188))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse202 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse200 .cse188)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse201 .cse12))))))))))))))))))))))))))))))))))))) (= (_ bv0 8) .cse203))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse177 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvashr (bvand .cse177 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse177) (_ bv0 32))))))) (.cse0 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse176 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse164 ((_ zero_extend 24) .cse176)) (.cse175 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse173 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse165 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse166 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse173))))))) (.cse161 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse160 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse175))))))) (.cse163 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse164))))))) (.cse162 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse159 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse153 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse166))))))) (.cse154 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse151 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse12))) .cse163)))) (.cse152 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse153 .cse154))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse151 .cse152))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse151 .cse152))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse153 .cse154)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse157 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse160 .cse161))))))) (.cse158 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse155 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse159 .cse14))))))) (.cse156 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse157 .cse158))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse155 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse155 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse157 .cse158))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse167 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse170 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse168 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse165 .cse167))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse167))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse168 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse169 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse170 .cse161))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse169 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse170 .cse161)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse169 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse168 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse174 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse175 .cse159)))))))) (let ((.cse172 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse173 .cse174))))) (let ((.cse171 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse172))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse162)))))) .cse167))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse19))) .cse166))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse161 .cse19))) .cse160))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse170 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse159)))))))))))) .cse23))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse163 .cse12)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse171 .cse164)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse171 .cse164))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse162 .cse172))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse173 .cse174))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse175 .cse159))) (_ bv0 32)))))))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8)) (= (_ bv0 8) .cse176))))) (.cse1 (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))))) (.cse4 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse150 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse114 (bvashr (bvor .cse150 .cse116) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse150) (_ bv0 32)))))) (.cse6 (forall ((|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse148 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse149 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse128 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse120 ((_ zero_extend 24) .cse149)) (.cse124 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse126 ((_ zero_extend 24) .cse148))) (let ((.cse125 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse136 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse126))))))) (.cse134 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse124))))))) (.cse133 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse122 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse137 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse120))))))) (.cse131 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse132 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse128)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse135 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse130 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse127 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse124 .cse125))))) (let ((.cse129 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse126 .cse127))))) (let ((.cse123 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse128 .cse129))))) (let ((.cse121 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse122 .cse123))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse120 .cse121))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse122 .cse123))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse124 .cse125))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse126 .cse127)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse128 .cse129)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse120 .cse121))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse122)))))) .cse130))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse19))) .cse132))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse133 .cse19))) .cse134))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse135 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse125)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse136)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse137 .cse12)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse138 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse131 .cse130))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse130))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse138 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse139 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse135 .cse133))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse139 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse135 .cse133)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse138 .cse12))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse142 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse120 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse131 .cse132))))))) (.cse143 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse140 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse122 .cse12))) .cse137)))) (.cse141 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse142 .cse143))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse140 .cse141))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse140 .cse141))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse142 .cse143)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse146 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse147 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse126 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse134 .cse133)))))))) (let ((.cse144 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse146 .cse147)))) (.cse145 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse125 .cse14))) .cse136))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse145))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse144 .cse145))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse146 .cse147)))))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))))))))))))))) .cse7))))))))) (= (_ bv0 8) .cse148) (= (_ bv0 8) .cse149)))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4) (or .cse3 .cse2) (or .cse5 .cse4 .cse1) (or .cse6 .cse2) (or .cse5 .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|)))))) (let ((.cse8 (let ((.cse118 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse113 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse113)))))))))) .cse113))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse117 (bvor .cse118 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse117) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse117)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse119 (bvor .cse118 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse119)) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse114 (bvashr (bvor .cse116 .cse119) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)))))))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse19 .cse12)))) (.cse59 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse112 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse112))) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse112) |c_ULTIMATE.start_main_~var_32~0#1|))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse115 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse113))) .cse113))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse114 (bvashr (bvor .cse115 .cse116) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse115)))))))) (and (or .cse8 .cse1 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27))))))) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse16))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse16)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse13 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse11 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse27 .cse22)))))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse26))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse18))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse17)))))) .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse19))) .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse19))) .cse21))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22)))))))))))) .cse23))))))))) .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse26))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse27 .cse22))) (_ bv0 32)))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse20))))))) (.cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse31)))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse17 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse31))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse16))))))) (.cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse14))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse35))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse32 .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse34 .cse35)))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8)))) (or .cse8 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse50))))))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse48)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse37 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse40 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 .cse37))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse40 .cse41))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse41)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse39 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse38 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 .cse46)))))))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse49))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse42 .cse43))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse42)))))) .cse37))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse46))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse45)))))))))))) .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse43))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse49))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse46))) (_ bv0 32)))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse47))))))) (.cse54 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse54)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse42 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse51 .cse52))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse54))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse52)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 .cse41))))))) (.cse58 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|))) (let ((.cse55 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse46 .cse14))))))) (.cse56 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 .cse58))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse55 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse58)))))))))))))))))))))))))))))))))))))))))))))))))) (_ bv0 8))) .cse1) (or .cse59 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse60 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse60) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse71 ((_ zero_extend 24) .cse60)) (.cse82 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse84 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|))) (let ((.cse75 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse84))))))) (.cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse82))))))) (.cse70 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse71))))))) (.cse74 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse69 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse76))))))) (.cse62 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse61 .cse62)))) (.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse74 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse62))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse63 .cse64)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse67 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse68 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse72 .cse73)))))))) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse67 .cse68)))) (.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse69 .cse14))) .cse70))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse65 .cse66))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse66))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse68)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse63 .cse64)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse80 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse75 .cse77))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse77))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse78 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 .cse73))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse79 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse80 .cse73)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse79 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse78 .cse12))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse82 .cse69))))) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse71 .cse83))))) (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse84 .cse85))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse74 .cse81)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse74)))))) .cse77))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse75 .cse19))) .cse76))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse73 .cse19))) .cse72))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse69)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse70)))))))))))) .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse74 .cse81))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse82 .cse69))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse71 .cse83)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse84 .cse85))))))))))))))))))))))))))))))))))))))))))))))))))) .cse7)) (_ bv0 8)))))) (or (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_21~0#1_8| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_15~0#1_8| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse86 ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse86) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse106 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse104 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse97 ((_ zero_extend 24) .cse86))) (let ((.cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse97))))))) (.cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse104))))))) (.cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse106))))))) (.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse95 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse99 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse7)))) (.cse101 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|))))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse102))))))) (.cse88 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_21~0#1_8|))) (let ((.cse89 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse87 .cse88)))) (.cse90 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse87 .cse88))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse90)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse93 ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_15~0#1_8|)) (.cse94 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse98 .cse99)))))))) (let ((.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse93 .cse94)))) (.cse92 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse95 .cse14))) .cse96))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse91 .cse92))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse91 .cse92))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse93 .cse94)))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse89 .cse90)))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse109 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse108 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse105 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse104 .cse95))))) (let ((.cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 .cse105))))) (let ((.cse103 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse107))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse100 .cse103))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse104 .cse95))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse97 .cse105)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse106 .cse107)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse100)))))) .cse108))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse14 .cse96))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse99 .cse45)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse109 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse95))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse45)))))))))))) .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse103))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse110 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse101 .cse108))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse101 .cse108))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse12))))))))) .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse109 .cse99))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse111 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse109 .cse99)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse111 .cse14)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse110 .cse12))))))))))))))))))))))))))))))) (_ bv1 32)))))))))) .cse59)))) (or .cse0 .cse4 .cse1) (or .cse4 .cse6)))))) is different from false [2025-03-16 20:51:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-16 20:51:16,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 20:51:16,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408508678] [2025-03-16 20:51:16,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408508678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:51:16,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 20:51:16,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 20:51:16,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019718658] [2025-03-16 20:51:16,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 20:51:16,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 20:51:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 20:51:16,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 20:51:16,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2025-03-16 20:51:16,533 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:51:18,973 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-16 20:51:18,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-03-16 20:51:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:51:18,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2025-03-16 20:51:18,974 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:51:18,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:51:18,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:51:19,175 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 20:51:19,176 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2025-03-16 20:51:19,181 INFO L158 Benchmark]: Toolchain (without parser) took 24701.92ms. Allocated memory was 117.4MB in the beginning and 436.2MB in the end (delta: 318.8MB). Free memory was 91.6MB in the beginning and 179.3MB in the end (delta: -87.6MB). Peak memory consumption was 228.2MB. Max. memory is 16.1GB. [2025-03-16 20:51:19,183 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 20:51:19,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.66ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 69.8MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 20:51:19,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.32ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 66.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 20:51:19,183 INFO L158 Benchmark]: Boogie Preprocessor took 45.96ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 61.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 20:51:19,184 INFO L158 Benchmark]: IcfgBuilder took 502.12ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 54.9MB in the end (delta: 6.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-03-16 20:51:19,184 INFO L158 Benchmark]: TraceAbstraction took 23808.61ms. Allocated memory was 117.4MB in the beginning and 436.2MB in the end (delta: 318.8MB). Free memory was 54.1MB in the beginning and 179.3MB in the end (delta: -125.1MB). Peak memory consumption was 189.1MB. Max. memory is 16.1GB. [2025-03-16 20:51:19,185 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.37ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.66ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 69.8MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.32ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 66.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.96ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 61.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 502.12ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 54.9MB in the end (delta: 6.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23808.61ms. Allocated memory was 117.4MB in the beginning and 436.2MB in the end (delta: 318.8MB). Free memory was 54.1MB in the beginning and 179.3MB in the end (delta: -125.1MB). Peak memory consumption was 189.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")