./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.vcegar_QF_BV_pj_icu_icctl_p1.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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:39:04,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:39:04,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:39:04,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:39:04,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:39:04,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:39:04,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:39:04,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:39:04,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:39:04,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:39:04,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:39:04,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:39:04,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:39:04,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:39:04,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:39:04,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:39:04,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:39:04,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:39:04,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:39:04,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:39:04,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:39:04,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:39:04,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:39:04,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:39:04,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:39:04,913 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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-03-08 09:39:05,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:39:05,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:39:05,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:39:05,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:39:05,173 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:39:05,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-08 09:39:06,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f95ed9f2/1a8331f7f51d4184b32e048186e64824/FLAGf105f5f6d [2025-03-08 09:39:06,664 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:39:06,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-08 09:39:06,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f95ed9f2/1a8331f7f51d4184b32e048186e64824/FLAGf105f5f6d [2025-03-08 09:39:06,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f95ed9f2/1a8331f7f51d4184b32e048186e64824 [2025-03-08 09:39:06,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:39:06,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:39:06,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:39:06,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:39:06,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:39:06,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:06" (1/1) ... [2025-03-08 09:39:06,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea49090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:06, skipping insertion in model container [2025-03-08 09:39:06,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:06" (1/1) ... [2025-03-08 09:39:06,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:39:07,064 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-08 09:39:07,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:39:07,335 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:39:07,342 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-08 09:39:07,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:39:07,535 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:39:07,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07 WrapperNode [2025-03-08 09:39:07,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:39:07,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:39:07,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:39:07,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:39:07,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:07,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:07,959 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4824 [2025-03-08 09:39:07,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:39:07,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:39:07,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:39:07,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:39:07,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:07,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,171 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-08 09:39:08,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:39:08,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:39:08,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:39:08,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:39:08,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (1/1) ... [2025-03-08 09:39:08,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:39:08,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:39:08,429 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-08 09:39:08,433 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-08 09:39:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:39:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:39:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:39:08,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:39:08,769 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:39:08,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:39:12,248 INFO L? ?]: Removed 3123 outVars from TransFormulas that were not future-live. [2025-03-08 09:39:12,248 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:39:12,394 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:39:12,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:39:12,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:12 BoogieIcfgContainer [2025-03-08 09:39:12,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:39:12,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:39:12,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:39:12,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:39:12,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:39:06" (1/3) ... [2025-03-08 09:39:12,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42edcef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:12, skipping insertion in model container [2025-03-08 09:39:12,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:07" (2/3) ... [2025-03-08 09:39:12,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42edcef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:12, skipping insertion in model container [2025-03-08 09:39:12,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:12" (3/3) ... [2025-03-08 09:39:12,402 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-08 09:39:12,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:39:12,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 1114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:39:12,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:39:12,492 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;@338b08b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:39:12,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:39:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 1114 states, 1112 states have (on average 1.4991007194244603) internal successors, (1667), 1113 states have internal predecessors, (1667), 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-08 09:39:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 09:39:12,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:12,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:12,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:12,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash -386724389, now seen corresponding path program 1 times [2025-03-08 09:39:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432345723] [2025-03-08 09:39:12,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:12,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:12,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 09:39:12,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 09:39:12,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:13,302 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-08 09:39:13,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:13,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432345723] [2025-03-08 09:39:13,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432345723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:13,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:13,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:39:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223452532] [2025-03-08 09:39:13,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:13,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:39:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:13,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:39:13,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:39:13,326 INFO L87 Difference]: Start difference. First operand has 1114 states, 1112 states have (on average 1.4991007194244603) internal successors, (1667), 1113 states have internal predecessors, (1667), 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 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-08 09:39:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:13,892 INFO L93 Difference]: Finished difference Result 2109 states and 3159 transitions. [2025-03-08 09:39:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:39:13,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-03-08 09:39:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:13,911 INFO L225 Difference]: With dead ends: 2109 [2025-03-08 09:39:13,911 INFO L226 Difference]: Without dead ends: 1113 [2025-03-08 09:39:13,917 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-08 09:39:13,920 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 0 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4150 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:13,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4150 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:39:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-08 09:39:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2025-03-08 09:39:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1112 states have (on average 1.4973021582733812) internal successors, (1665), 1112 states have internal predecessors, (1665), 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-08 09:39:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1665 transitions. [2025-03-08 09:39:13,997 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1665 transitions. Word has length 83 [2025-03-08 09:39:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:13,997 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1665 transitions. [2025-03-08 09:39:13,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-08 09:39:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1665 transitions. [2025-03-08 09:39:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 09:39:13,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:13,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:13,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:39:14,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:14,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 901126633, now seen corresponding path program 1 times [2025-03-08 09:39:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:14,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083545904] [2025-03-08 09:39:14,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:14,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:14,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 09:39:14,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 09:39:14,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:14,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:14,239 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-08 09:39:14,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083545904] [2025-03-08 09:39:14,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083545904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:14,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:14,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:39:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722456908] [2025-03-08 09:39:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:14,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:39:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:14,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:39:14,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:39:14,241 INFO L87 Difference]: Start difference. First operand 1113 states and 1665 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-08 09:39:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:14,692 INFO L93 Difference]: Finished difference Result 2110 states and 3157 transitions. [2025-03-08 09:39:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:39:14,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-08 09:39:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:14,696 INFO L225 Difference]: With dead ends: 2110 [2025-03-08 09:39:14,696 INFO L226 Difference]: Without dead ends: 1115 [2025-03-08 09:39:14,697 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-08 09:39:14,697 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 0 mSDsluCounter, 2762 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:14,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4147 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:39:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-08 09:39:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-03-08 09:39:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.4964093357271095) internal successors, (1667), 1114 states have internal predecessors, (1667), 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-08 09:39:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1667 transitions. [2025-03-08 09:39:14,714 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1667 transitions. Word has length 84 [2025-03-08 09:39:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:14,714 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1667 transitions. [2025-03-08 09:39:14,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-08 09:39:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1667 transitions. [2025-03-08 09:39:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 09:39:14,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:14,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:39:14,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash -198334570, now seen corresponding path program 1 times [2025-03-08 09:39:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:14,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756328699] [2025-03-08 09:39:14,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:14,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 09:39:14,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 09:39:14,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:14,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:15,444 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-08 09:39:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756328699] [2025-03-08 09:39:15,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756328699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:15,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:15,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:39:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303975720] [2025-03-08 09:39:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:15,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:39:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:15,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:39:15,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:39:15,445 INFO L87 Difference]: Start difference. First operand 1115 states and 1667 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-08 09:39:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:16,290 INFO L93 Difference]: Finished difference Result 2147 states and 3211 transitions. [2025-03-08 09:39:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:39:16,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2025-03-08 09:39:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:16,297 INFO L225 Difference]: With dead ends: 2147 [2025-03-08 09:39:16,297 INFO L226 Difference]: Without dead ends: 1150 [2025-03-08 09:39:16,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:39:16,298 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 1684 mSDsluCounter, 5447 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 6811 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:16,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 6811 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 09:39:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-03-08 09:39:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1149. [2025-03-08 09:39:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.494773519163763) internal successors, (1716), 1148 states have internal predecessors, (1716), 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-08 09:39:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1716 transitions. [2025-03-08 09:39:16,320 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1716 transitions. Word has length 85 [2025-03-08 09:39:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:16,320 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1716 transitions. [2025-03-08 09:39:16,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-08 09:39:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1716 transitions. [2025-03-08 09:39:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 09:39:16,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:16,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:39:16,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:16,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1876320018, now seen corresponding path program 1 times [2025-03-08 09:39:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313254080] [2025-03-08 09:39:16,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:16,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 09:39:16,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 09:39:16,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:16,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:16,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-08 09:39:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313254080] [2025-03-08 09:39:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313254080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:16,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:16,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:39:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5746832] [2025-03-08 09:39:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:16,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:39:16,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:16,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:39:16,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:39:16,930 INFO L87 Difference]: Start difference. First operand 1149 states and 1716 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-08 09:39:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:17,493 INFO L93 Difference]: Finished difference Result 2172 states and 3244 transitions. [2025-03-08 09:39:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:39:17,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2025-03-08 09:39:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:17,498 INFO L225 Difference]: With dead ends: 2172 [2025-03-08 09:39:17,498 INFO L226 Difference]: Without dead ends: 1149 [2025-03-08 09:39:17,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:39:17,503 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1684 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:17,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 4102 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:39:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-08 09:39:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2025-03-08 09:39:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.4939024390243902) internal successors, (1715), 1148 states have internal predecessors, (1715), 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-08 09:39:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1715 transitions. [2025-03-08 09:39:17,523 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1715 transitions. Word has length 86 [2025-03-08 09:39:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:17,523 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1715 transitions. [2025-03-08 09:39:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-08 09:39:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1715 transitions. [2025-03-08 09:39:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 09:39:17,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:17,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:17,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:39:17,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:17,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1790267128, now seen corresponding path program 1 times [2025-03-08 09:39:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090534623] [2025-03-08 09:39:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:17,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 09:39:17,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 09:39:17,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:17,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:18,228 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-08 09:39:18,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:18,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090534623] [2025-03-08 09:39:18,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090534623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:18,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:18,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:39:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581956331] [2025-03-08 09:39:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:18,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:39:18,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:18,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:39:18,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:39:18,230 INFO L87 Difference]: Start difference. First operand 1149 states and 1715 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-08 09:39:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:19,087 INFO L93 Difference]: Finished difference Result 2172 states and 3243 transitions. [2025-03-08 09:39:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:39:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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 87 [2025-03-08 09:39:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:19,091 INFO L225 Difference]: With dead ends: 2172 [2025-03-08 09:39:19,091 INFO L226 Difference]: Without dead ends: 1152 [2025-03-08 09:39:19,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:39:19,094 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1690 mSDsluCounter, 5461 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 6828 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:19,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 6828 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 09:39:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-08 09:39:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2025-03-08 09:39:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4926151172893136) internal successors, (1718), 1151 states have internal predecessors, (1718), 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-08 09:39:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1718 transitions. [2025-03-08 09:39:19,110 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1718 transitions. Word has length 87 [2025-03-08 09:39:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:19,110 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1718 transitions. [2025-03-08 09:39:19,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-08 09:39:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1718 transitions. [2025-03-08 09:39:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 09:39:19,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:19,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:19,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:39:19,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:19,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1930813249, now seen corresponding path program 1 times [2025-03-08 09:39:19,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:19,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925207873] [2025-03-08 09:39:19,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:19,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 09:39:19,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 09:39:19,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:19,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:19,439 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-08 09:39:19,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:19,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925207873] [2025-03-08 09:39:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925207873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:39:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807326947] [2025-03-08 09:39:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:19,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:39:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:19,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:39:19,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:39:19,441 INFO L87 Difference]: Start difference. First operand 1152 states and 1718 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 09:39:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:19,839 INFO L93 Difference]: Finished difference Result 2170 states and 3239 transitions. [2025-03-08 09:39:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:39:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2025-03-08 09:39:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:19,842 INFO L225 Difference]: With dead ends: 2170 [2025-03-08 09:39:19,843 INFO L226 Difference]: Without dead ends: 1146 [2025-03-08 09:39:19,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 09:39:19,844 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 0 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:19,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2763 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:39:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-08 09:39:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2025-03-08 09:39:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.491703056768559) internal successors, (1708), 1145 states have internal predecessors, (1708), 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-08 09:39:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1708 transitions. [2025-03-08 09:39:19,860 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1708 transitions. Word has length 88 [2025-03-08 09:39:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:19,861 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1708 transitions. [2025-03-08 09:39:19,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-08 09:39:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1708 transitions. [2025-03-08 09:39:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 09:39:19,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:19,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:19,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:39:19,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:19,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash -414736333, now seen corresponding path program 1 times [2025-03-08 09:39:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:19,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103077815] [2025-03-08 09:39:19,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:19,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:19,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 09:39:19,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 09:39:19,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:19,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:20,569 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-08 09:39:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103077815] [2025-03-08 09:39:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103077815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:39:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592969893] [2025-03-08 09:39:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:20,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:39:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:20,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:39:20,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:39:20,571 INFO L87 Difference]: Start difference. First operand 1146 states and 1708 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-08 09:39:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:21,441 INFO L93 Difference]: Finished difference Result 2160 states and 3222 transitions. [2025-03-08 09:39:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:39:21,441 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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 88 [2025-03-08 09:39:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:21,445 INFO L225 Difference]: With dead ends: 2160 [2025-03-08 09:39:21,445 INFO L226 Difference]: Without dead ends: 1146 [2025-03-08 09:39:21,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:39:21,447 INFO L435 NwaCegarLoop]: 1362 mSDtfsCounter, 1667 mSDsluCounter, 5479 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:21,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 6841 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 09:39:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-08 09:39:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2025-03-08 09:39:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.490829694323144) internal successors, (1707), 1145 states have internal predecessors, (1707), 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-08 09:39:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1707 transitions. [2025-03-08 09:39:21,464 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1707 transitions. Word has length 88 [2025-03-08 09:39:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:21,465 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1707 transitions. [2025-03-08 09:39:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-08 09:39:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1707 transitions. [2025-03-08 09:39:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 09:39:21,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:21,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:39:21,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:21,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 691630493, now seen corresponding path program 1 times [2025-03-08 09:39:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391544719] [2025-03-08 09:39:21,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:21,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:39:21,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:39:21,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:21,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:21,988 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-08 09:39:21,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:21,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391544719] [2025-03-08 09:39:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391544719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:21,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:21,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 09:39:21,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894326689] [2025-03-08 09:39:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:21,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:39:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:21,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:39:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:39:21,989 INFO L87 Difference]: Start difference. First operand 1146 states and 1707 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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-08 09:39:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:22,772 INFO L93 Difference]: Finished difference Result 2160 states and 3221 transitions. [2025-03-08 09:39:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:39:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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 89 [2025-03-08 09:39:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:22,775 INFO L225 Difference]: With dead ends: 2160 [2025-03-08 09:39:22,775 INFO L226 Difference]: Without dead ends: 1153 [2025-03-08 09:39:22,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:39:22,777 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 1682 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 5522 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:22,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 5522 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 09:39:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-08 09:39:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2025-03-08 09:39:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4900086880973067) internal successors, (1715), 1151 states have internal predecessors, (1715), 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-08 09:39:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1715 transitions. [2025-03-08 09:39:22,793 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1715 transitions. Word has length 89 [2025-03-08 09:39:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:22,794 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1715 transitions. [2025-03-08 09:39:22,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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-08 09:39:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1715 transitions. [2025-03-08 09:39:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 09:39:22,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:22,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:22,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:39:22,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 526595914, now seen corresponding path program 1 times [2025-03-08 09:39:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:22,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567634561] [2025-03-08 09:39:22,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:22,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 09:39:22,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 09:39:22,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:22,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:23,015 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-08 09:39:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:23,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567634561] [2025-03-08 09:39:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567634561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:23,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:23,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:39:23,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886228760] [2025-03-08 09:39:23,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:23,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:39:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:23,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:39:23,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:39:23,016 INFO L87 Difference]: Start difference. First operand 1152 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-08 09:39:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:23,588 INFO L93 Difference]: Finished difference Result 2163 states and 3224 transitions. [2025-03-08 09:39:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:39:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 90 [2025-03-08 09:39:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:23,594 INFO L225 Difference]: With dead ends: 2163 [2025-03-08 09:39:23,594 INFO L226 Difference]: Without dead ends: 1148 [2025-03-08 09:39:23,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:39:23,602 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1661 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:23,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 4098 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:39:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-08 09:39:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2025-03-08 09:39:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4891020052310375) internal successors, (1708), 1147 states have internal predecessors, (1708), 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-08 09:39:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1708 transitions. [2025-03-08 09:39:23,637 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1708 transitions. Word has length 90 [2025-03-08 09:39:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:23,637 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1708 transitions. [2025-03-08 09:39:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-08 09:39:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1708 transitions. [2025-03-08 09:39:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 09:39:23,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:23,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:23,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 09:39:23,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1875362883, now seen corresponding path program 1 times [2025-03-08 09:39:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832308861] [2025-03-08 09:39:23,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:23,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 09:39:23,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 09:39:23,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:23,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:24,222 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-08 09:39:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832308861] [2025-03-08 09:39:24,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832308861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:24,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:24,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 09:39:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980804443] [2025-03-08 09:39:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:24,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:39:24,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:24,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:39:24,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:39:24,224 INFO L87 Difference]: Start difference. First operand 1148 states and 1708 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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-08 09:39:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:25,389 INFO L93 Difference]: Finished difference Result 2157 states and 3213 transitions. [2025-03-08 09:39:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:39:25,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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 90 [2025-03-08 09:39:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:25,393 INFO L225 Difference]: With dead ends: 2157 [2025-03-08 09:39:25,393 INFO L226 Difference]: Without dead ends: 1148 [2025-03-08 09:39:25,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:39:25,394 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 1658 mSDsluCounter, 12224 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 13584 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:25,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 13584 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3026 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 09:39:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-08 09:39:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2025-03-08 09:39:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4882301656495205) internal successors, (1707), 1147 states have internal predecessors, (1707), 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-08 09:39:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1707 transitions. [2025-03-08 09:39:25,408 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1707 transitions. Word has length 90 [2025-03-08 09:39:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:25,408 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1707 transitions. [2025-03-08 09:39:25,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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-08 09:39:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1707 transitions. [2025-03-08 09:39:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 09:39:25,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:25,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 09:39:25,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash 94528194, now seen corresponding path program 1 times [2025-03-08 09:39:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347003409] [2025-03-08 09:39:25,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:25,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 09:39:25,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 09:39:25,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:25,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:25,840 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-08 09:39:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347003409] [2025-03-08 09:39:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347003409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 09:39:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906034203] [2025-03-08 09:39:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:25,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:39:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:25,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:39:25,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:39:25,846 INFO L87 Difference]: Start difference. First operand 1148 states and 1707 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 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-08 09:39:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:26,529 INFO L93 Difference]: Finished difference Result 2154 states and 3209 transitions. [2025-03-08 09:39:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:39:26,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 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 91 [2025-03-08 09:39:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:26,536 INFO L225 Difference]: With dead ends: 2154 [2025-03-08 09:39:26,536 INFO L226 Difference]: Without dead ends: 1152 [2025-03-08 09:39:26,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:39:26,539 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 1668 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:26,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 4163 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:39:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-08 09:39:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1150. [2025-03-08 09:39:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4873803307223672) internal successors, (1709), 1149 states have internal predecessors, (1709), 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-08 09:39:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1709 transitions. [2025-03-08 09:39:26,553 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1709 transitions. Word has length 91 [2025-03-08 09:39:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:26,553 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1709 transitions. [2025-03-08 09:39:26,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 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-08 09:39:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1709 transitions. [2025-03-08 09:39:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 09:39:26,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:26,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:26,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:39:26,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:26,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1686558536, now seen corresponding path program 1 times [2025-03-08 09:39:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012365965] [2025-03-08 09:39:26,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:26,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 09:39:26,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 09:39:26,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:26,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:26,771 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-08 09:39:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012365965] [2025-03-08 09:39:26,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012365965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:26,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:39:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991442474] [2025-03-08 09:39:26,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:26,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:39:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:26,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:39:26,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:39:26,773 INFO L87 Difference]: Start difference. First operand 1150 states and 1709 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-08 09:39:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:27,306 INFO L93 Difference]: Finished difference Result 2156 states and 3210 transitions. [2025-03-08 09:39:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:39:27,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 91 [2025-03-08 09:39:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:27,310 INFO L225 Difference]: With dead ends: 2156 [2025-03-08 09:39:27,310 INFO L226 Difference]: Without dead ends: 1143 [2025-03-08 09:39:27,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:39:27,311 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1644 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:27,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 4098 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:39:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-08 09:39:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2025-03-08 09:39:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.4868651488616462) internal successors, (1698), 1142 states have internal predecessors, (1698), 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-08 09:39:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1698 transitions. [2025-03-08 09:39:27,325 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1698 transitions. Word has length 91 [2025-03-08 09:39:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:27,325 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1698 transitions. [2025-03-08 09:39:27,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-08 09:39:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1698 transitions. [2025-03-08 09:39:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 09:39:27,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:27,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:27,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:39:27,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:27,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 839025213, now seen corresponding path program 1 times [2025-03-08 09:39:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:27,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593607600] [2025-03-08 09:39:27,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 09:39:27,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 09:39:27,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:27,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:27,706 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-08 09:39:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:27,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593607600] [2025-03-08 09:39:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593607600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:27,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:27,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:39:27,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067772846] [2025-03-08 09:39:27,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:27,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:39:27,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:27,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:39:27,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:39:27,708 INFO L87 Difference]: Start difference. First operand 1143 states and 1698 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-08 09:39:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:28,330 INFO L93 Difference]: Finished difference Result 2145 states and 3194 transitions. [2025-03-08 09:39:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:39:28,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 92 [2025-03-08 09:39:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:28,333 INFO L225 Difference]: With dead ends: 2145 [2025-03-08 09:39:28,333 INFO L226 Difference]: Without dead ends: 1146 [2025-03-08 09:39:28,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:39:28,334 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1639 mSDsluCounter, 5457 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 6824 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:28,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 6824 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:39:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-08 09:39:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1145. [2025-03-08 09:39:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 1.486013986013986) internal successors, (1700), 1144 states have internal predecessors, (1700), 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-08 09:39:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1700 transitions. [2025-03-08 09:39:28,346 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1700 transitions. Word has length 92 [2025-03-08 09:39:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:28,346 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1700 transitions. [2025-03-08 09:39:28,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-08 09:39:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1700 transitions. [2025-03-08 09:39:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 09:39:28,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:28,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:28,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 09:39:28,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:28,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1544662275, now seen corresponding path program 1 times [2025-03-08 09:39:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336983864] [2025-03-08 09:39:28,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:28,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 09:39:28,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 09:39:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:29,100 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-08 09:39:29,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:39:29,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336983864] [2025-03-08 09:39:29,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336983864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:29,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:29,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:39:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398081801] [2025-03-08 09:39:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:29,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:39:29,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:39:29,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:39:29,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:39:29,102 INFO L87 Difference]: Start difference. First operand 1145 states and 1700 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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-08 09:39:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:30,790 INFO L93 Difference]: Finished difference Result 2170 states and 3232 transitions. [2025-03-08 09:39:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:39:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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 92 [2025-03-08 09:39:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:30,793 INFO L225 Difference]: With dead ends: 2170 [2025-03-08 09:39:30,794 INFO L226 Difference]: Without dead ends: 1174 [2025-03-08 09:39:30,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:39:30,795 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1608 mSDsluCounter, 20444 mSDsCounter, 0 mSdLazyCounter, 5011 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 21810 SdHoareTripleChecker+Invalid, 5012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:30,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 21810 Invalid, 5012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5011 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 09:39:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-03-08 09:39:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1164. [2025-03-08 09:39:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.4883920894239038) internal successors, (1731), 1163 states have internal predecessors, (1731), 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-08 09:39:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1731 transitions. [2025-03-08 09:39:30,808 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1731 transitions. Word has length 92 [2025-03-08 09:39:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:30,808 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1731 transitions. [2025-03-08 09:39:30,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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-08 09:39:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1731 transitions. [2025-03-08 09:39:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 09:39:30,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:30,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:30,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 09:39:30,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:30,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash -662805913, now seen corresponding path program 1 times [2025-03-08 09:39:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:39:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775600705] [2025-03-08 09:39:30,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:39:30,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 09:39:30,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 09:39:30,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:30,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:39:30,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:39:30,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 09:39:30,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 09:39:30,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:30,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:39:30,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:39:30,962 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:39:30,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:39:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 09:39:30,966 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:31,009 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:39:31,022 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:39:31,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:39:31 BoogieIcfgContainer [2025-03-08 09:39:31,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:39:31,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:39:31,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:39:31,025 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:39:31,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:12" (3/4) ... [2025-03-08 09:39:31,027 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:39:31,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:39:31,028 INFO L158 Benchmark]: Toolchain (without parser) took 24147.16ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 101.2MB in the beginning and 86.5MB in the end (delta: 14.6MB). Peak memory consumption was 358.5MB. Max. memory is 16.1GB. [2025-03-08 09:39:31,028 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:39:31,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.69ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 70.9MB in the end (delta: 30.3MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2025-03-08 09:39:31,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 426.80ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 70.9MB in the beginning and 215.2MB in the end (delta: -144.3MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2025-03-08 09:39:31,029 INFO L158 Benchmark]: Boogie Preprocessor took 439.46ms. Allocated memory is still 335.5MB. Free memory was 215.2MB in the beginning and 195.8MB in the end (delta: 19.4MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2025-03-08 09:39:31,029 INFO L158 Benchmark]: IcfgBuilder took 3989.67ms. Allocated memory was 335.5MB in the beginning and 671.1MB in the end (delta: 335.5MB). Free memory was 195.8MB in the beginning and 193.6MB in the end (delta: 2.2MB). Peak memory consumption was 370.6MB. Max. memory is 16.1GB. [2025-03-08 09:39:31,029 INFO L158 Benchmark]: TraceAbstraction took 18627.98ms. Allocated memory was 671.1MB in the beginning and 478.2MB in the end (delta: -192.9MB). Free memory was 193.6MB in the beginning and 86.6MB in the end (delta: 107.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:39:31,030 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 478.2MB. Free memory was 86.6MB in the beginning and 86.5MB in the end (delta: 41.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:39:31,030 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.16ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.69ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 70.9MB in the end (delta: 30.3MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 426.80ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 70.9MB in the beginning and 215.2MB in the end (delta: -144.3MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 439.46ms. Allocated memory is still 335.5MB. Free memory was 215.2MB in the beginning and 195.8MB in the end (delta: 19.4MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. * IcfgBuilder took 3989.67ms. Allocated memory was 335.5MB in the beginning and 671.1MB in the end (delta: 335.5MB). Free memory was 195.8MB in the beginning and 193.6MB in the end (delta: 2.2MB). Peak memory consumption was 370.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18627.98ms. Allocated memory was 671.1MB in the beginning and 478.2MB in the end (delta: -192.9MB). Free memory was 193.6MB in the beginning and 86.6MB in the end (delta: 107.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 478.2MB. Free memory was 86.6MB in the beginning and 86.5MB in the end (delta: 41.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 bitwiseAnd at line 385. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_32 = 8; [L48] const SORT_21 var_35 = 16; [L49] const SORT_21 var_38 = 32; [L50] const SORT_21 var_41 = 64; [L51] const SORT_21 var_44 = 0; [L52] const SORT_3 var_47 = 1; [L53] const SORT_3 var_51 = 0; [L54] const SORT_6 var_138 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_360; [L72] SORT_3 input_382; [L73] SORT_3 input_397; [L74] SORT_3 input_412; [L75] SORT_3 input_427; [L76] SORT_3 input_442; [L77] SORT_3 input_457; [L78] SORT_3 input_472; [L79] SORT_3 input_487; [L80] SORT_3 input_502; [L81] SORT_3 input_517; [L82] SORT_3 input_532; [L83] SORT_3 input_547; [L84] SORT_3 input_562; [L85] SORT_3 input_577; [L86] SORT_3 input_592; [L87] SORT_3 input_608; [L88] SORT_3 input_610; [L89] SORT_3 input_612; [L90] SORT_3 input_614; [L91] SORT_3 input_616; [L92] SORT_3 input_618; [L93] SORT_3 input_620; [L94] SORT_3 input_622; [L95] SORT_3 input_627; [L96] SORT_3 input_669; [L97] SORT_3 input_678; [L98] SORT_21 input_683; [L99] SORT_21 input_684; [L100] SORT_21 input_685; [L101] SORT_21 input_686; [L102] SORT_21 input_689; [L103] SORT_21 input_693; [L104] SORT_21 input_697; [L105] SORT_21 input_705; [L106] SORT_21 input_709; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_718; [L110] SORT_21 input_722; [L111] SORT_21 input_727; [L112] SORT_21 input_731; [L113] SORT_21 input_736; [L114] SORT_21 input_738; [L115] SORT_21 input_739; [L116] SORT_21 input_741; [L117] SORT_21 input_745; [L118] SORT_21 input_750; [L119] SORT_21 input_757; [L120] SORT_21 input_758; [L121] SORT_21 input_760; [L122] SORT_21 input_764; [L123] SORT_21 input_769; [L124] SORT_21 input_771; [L125] SORT_21 input_772; [L126] SORT_21 input_774; [L127] SORT_21 input_778; [L128] SORT_21 input_783; [L129] SORT_21 input_787; [L130] SORT_21 input_792; [L131] SORT_21 input_794; [L132] SORT_21 input_800; [L133] SORT_21 input_812; [L134] SORT_3 input_830; [L135] SORT_3 input_837; [L136] SORT_3 input_848; [L137] SORT_3 input_854; [L138] SORT_3 input_860; [L139] SORT_3 input_866; [L140] SORT_3 input_872; [L141] SORT_3 input_878; [L142] SORT_3 input_884; [L143] SORT_3 input_890; [L144] SORT_3 input_896; [L145] SORT_3 input_902; [L146] SORT_3 input_908; [L147] SORT_3 input_914; [L148] SORT_3 input_920; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L151] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L152] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L153] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L154] SORT_21 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L155] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L156] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L157] SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L158] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L159] SORT_3 state_103 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L160] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L161] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L162] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L163] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L164] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L165] SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L166] SORT_3 state_134 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L167] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L168] SORT_3 state_144 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L169] SORT_3 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L170] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L171] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L172] SORT_3 state_173 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L173] SORT_3 state_183 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L174] SORT_3 state_188 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L175] SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L176] SORT_3 state_200 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L177] SORT_3 state_213 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L178] SORT_3 state_226 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_3 init_53_arg_1 = var_51; [L183] state_52 = init_53_arg_1 [L184] SORT_3 init_55_arg_1 = var_51; [L185] state_54 = init_55_arg_1 [L186] SORT_3 init_57_arg_1 = var_51; [L187] state_56 = init_57_arg_1 [L188] SORT_21 init_59_arg_1 = var_22; [L189] state_58 = init_59_arg_1 [L190] SORT_3 init_63_arg_1 = var_51; [L191] state_62 = init_63_arg_1 [L192] SORT_3 init_67_arg_1 = var_51; [L193] state_66 = init_67_arg_1 [L194] SORT_3 init_71_arg_1 = var_51; [L195] state_70 = init_71_arg_1 [L196] SORT_3 init_87_arg_1 = var_51; [L197] state_86 = init_87_arg_1 [L198] SORT_3 init_104_arg_1 = var_51; [L199] state_103 = init_104_arg_1 [L200] SORT_3 init_107_arg_1 = var_51; [L201] state_106 = init_107_arg_1 [L202] SORT_3 init_109_arg_1 = var_51; [L203] state_108 = init_109_arg_1 [L204] SORT_3 init_113_arg_1 = var_51; [L205] state_112 = init_113_arg_1 [L206] SORT_3 init_117_arg_1 = var_51; [L207] state_116 = init_117_arg_1 [L208] SORT_3 init_122_arg_1 = var_51; [L209] state_121 = init_122_arg_1 [L210] SORT_3 init_125_arg_1 = var_51; [L211] state_124 = init_125_arg_1 [L212] SORT_3 init_135_arg_1 = var_51; [L213] state_134 = init_135_arg_1 [L214] SORT_3 init_142_arg_1 = var_51; [L215] state_141 = init_142_arg_1 [L216] SORT_3 init_145_arg_1 = var_51; [L217] state_144 = init_145_arg_1 [L218] SORT_3 init_154_arg_1 = var_51; [L219] state_153 = init_154_arg_1 [L220] SORT_3 init_159_arg_1 = var_51; [L221] state_158 = init_159_arg_1 [L222] SORT_3 init_162_arg_1 = var_51; [L223] state_161 = init_162_arg_1 [L224] SORT_3 init_174_arg_1 = var_51; [L225] state_173 = init_174_arg_1 [L226] SORT_3 init_184_arg_1 = var_51; [L227] state_183 = init_184_arg_1 [L228] SORT_3 init_189_arg_1 = var_51; [L229] state_188 = init_189_arg_1 [L230] SORT_3 init_192_arg_1 = var_51; [L231] state_191 = init_192_arg_1 [L232] SORT_3 init_201_arg_1 = var_51; [L233] state_200 = init_201_arg_1 [L234] SORT_3 init_214_arg_1 = var_51; [L235] state_213 = init_214_arg_1 [L236] SORT_3 init_227_arg_1 = var_51; [L237] state_226 = init_227_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_360 = __VERIFIER_nondet_uchar() [L257] input_382 = __VERIFIER_nondet_uchar() [L258] input_397 = __VERIFIER_nondet_uchar() [L259] input_412 = __VERIFIER_nondet_uchar() [L260] input_427 = __VERIFIER_nondet_uchar() [L261] input_442 = __VERIFIER_nondet_uchar() [L262] input_457 = __VERIFIER_nondet_uchar() [L263] input_472 = __VERIFIER_nondet_uchar() [L264] input_487 = __VERIFIER_nondet_uchar() [L265] input_502 = __VERIFIER_nondet_uchar() [L266] input_517 = __VERIFIER_nondet_uchar() [L267] input_532 = __VERIFIER_nondet_uchar() [L268] input_547 = __VERIFIER_nondet_uchar() [L269] input_562 = __VERIFIER_nondet_uchar() [L270] input_577 = __VERIFIER_nondet_uchar() [L271] input_592 = __VERIFIER_nondet_uchar() [L272] input_608 = __VERIFIER_nondet_uchar() [L273] input_610 = __VERIFIER_nondet_uchar() [L274] input_612 = __VERIFIER_nondet_uchar() [L275] input_614 = __VERIFIER_nondet_uchar() [L276] input_616 = __VERIFIER_nondet_uchar() [L277] input_618 = __VERIFIER_nondet_uchar() [L278] input_620 = __VERIFIER_nondet_uchar() [L279] input_622 = __VERIFIER_nondet_uchar() [L280] input_627 = __VERIFIER_nondet_uchar() [L281] input_669 = __VERIFIER_nondet_uchar() [L282] input_678 = __VERIFIER_nondet_uchar() [L283] input_683 = __VERIFIER_nondet_uchar() [L284] input_684 = __VERIFIER_nondet_uchar() [L285] input_685 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_689 = __VERIFIER_nondet_uchar() [L288] input_693 = __VERIFIER_nondet_uchar() [L289] input_697 = __VERIFIER_nondet_uchar() [L290] input_705 = __VERIFIER_nondet_uchar() [L291] input_709 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_718 = __VERIFIER_nondet_uchar() [L295] input_722 = __VERIFIER_nondet_uchar() [L296] input_727 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_736 = __VERIFIER_nondet_uchar() [L299] input_738 = __VERIFIER_nondet_uchar() [L300] input_739 = __VERIFIER_nondet_uchar() [L301] input_741 = __VERIFIER_nondet_uchar() [L302] input_745 = __VERIFIER_nondet_uchar() [L303] input_750 = __VERIFIER_nondet_uchar() [L304] input_757 = __VERIFIER_nondet_uchar() [L305] input_758 = __VERIFIER_nondet_uchar() [L306] input_760 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_769 = __VERIFIER_nondet_uchar() [L309] input_771 = __VERIFIER_nondet_uchar() [L310] input_772 = __VERIFIER_nondet_uchar() [L311] input_774 = __VERIFIER_nondet_uchar() [L312] input_778 = __VERIFIER_nondet_uchar() [L313] input_783 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_792 = __VERIFIER_nondet_uchar() [L316] input_794 = __VERIFIER_nondet_uchar() [L317] input_800 = __VERIFIER_nondet_uchar() [L318] input_812 = __VERIFIER_nondet_uchar() [L319] input_830 = __VERIFIER_nondet_uchar() [L320] input_837 = __VERIFIER_nondet_uchar() [L321] input_848 = __VERIFIER_nondet_uchar() [L322] input_854 = __VERIFIER_nondet_uchar() [L323] input_860 = __VERIFIER_nondet_uchar() [L324] input_866 = __VERIFIER_nondet_uchar() [L325] input_872 = __VERIFIER_nondet_uchar() [L326] input_878 = __VERIFIER_nondet_uchar() [L327] input_884 = __VERIFIER_nondet_uchar() [L328] input_890 = __VERIFIER_nondet_uchar() [L329] input_896 = __VERIFIER_nondet_uchar() [L330] input_902 = __VERIFIER_nondet_uchar() [L331] input_908 = __VERIFIER_nondet_uchar() [L332] input_914 = __VERIFIER_nondet_uchar() [L333] input_920 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_3 var_31_arg_0 = var_28; [L349] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_31_arg_0=1, var_31_arg_1=0, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L351] SORT_21 var_33_arg_0 = state_23; [L352] SORT_21 var_33_arg_1 = var_32; [L353] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L354] SORT_3 var_34_arg_0 = var_31; [L355] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_34_arg_0=1, var_34_arg_1=0, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L357] SORT_21 var_36_arg_0 = state_23; [L358] SORT_21 var_36_arg_1 = var_35; [L359] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L360] SORT_3 var_37_arg_0 = var_34; [L361] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_37_arg_0=1, var_37_arg_1=0, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L363] SORT_21 var_39_arg_0 = state_23; [L364] SORT_21 var_39_arg_1 = var_38; [L365] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L366] SORT_3 var_40_arg_0 = var_37; [L367] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_40_arg_0=1, var_40_arg_1=0, var_41=64, var_44=0, var_47=1, var_51=0] [L368] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L368] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_41; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_40; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_43_arg_0=1, var_43_arg_1=0, var_44=0, var_47=1, var_51=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_45_arg_0 = state_23; [L376] SORT_21 var_45_arg_1 = var_44; [L377] SORT_3 var_45 = var_45_arg_0 == var_45_arg_1; [L378] SORT_3 var_46_arg_0 = var_43; [L379] SORT_3 var_46_arg_1 = var_45; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46_arg_0=1, var_46_arg_1=0, var_47=1, var_51=0] [L380] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L380] SORT_3 var_46 = var_46_arg_0 | var_46_arg_1; [L381] SORT_3 var_48_arg_0 = var_46; [L382] SORT_3 var_48 = ~var_48_arg_0; [L383] SORT_3 var_49_arg_0 = var_47; [L384] SORT_3 var_49_arg_1 = var_48; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_49_arg_0=1, var_49_arg_1=-2, var_51=0] [L385] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L385] SORT_3 var_49 = var_49_arg_0 & var_49_arg_1; [L386] EXPR var_49 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L386] var_49 = var_49 & mask_SORT_3 [L387] SORT_3 bad_50_arg_0 = var_49; [L388] CALL __VERIFIER_assert(!(bad_50_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1114 locations, 1667 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18285 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18285 mSDsluCounter, 95741 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76579 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21242 IncrementalHoareTripleChecker+Invalid, 21252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 19162 mSDtfsCounter, 21242 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=14, InterpolantAutomatonStates: 108, 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, 14 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1329 NumberOfCodeBlocks, 1329 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1222 ConstructedInterpolants, 0 QuantifiedInterpolants, 6521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-08 09:39:31,049 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.vcegar_QF_BV_pj_icu_icctl_p1.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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:39:33,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:39:33,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:39:33,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:39:33,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:39:33,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:39:33,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:39:33,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:39:33,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:39:33,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:39:33,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:39:33,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:39:33,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:39:33,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:39:33,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:39:33,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:39:33,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:39:33,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:39:33,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:39:33,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:39:33,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:39:33,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:39:33,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:39:33,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:39:33,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:39:33,137 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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-03-08 09:39:33,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:39:33,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:39:33,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:39:33,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:39:33,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:39:33,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-08 09:39:34,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30c99a2a/dfa83d1e7b0b4c7c94baa0c142ce86a4/FLAG5438e23ad [2025-03-08 09:39:34,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:39:34,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-08 09:39:34,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30c99a2a/dfa83d1e7b0b4c7c94baa0c142ce86a4/FLAG5438e23ad [2025-03-08 09:39:35,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30c99a2a/dfa83d1e7b0b4c7c94baa0c142ce86a4 [2025-03-08 09:39:35,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:39:35,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:39:35,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:39:35,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:39:35,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:39:35,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a484822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35, skipping insertion in model container [2025-03-08 09:39:35,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:39:35,350 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-08 09:39:35,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:39:35,586 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:39:35,596 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-08 09:39:35,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:39:35,747 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:39:35,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35 WrapperNode [2025-03-08 09:39:35,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:39:35,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:39:35,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:39:35,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:39:35,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,921 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2616 [2025-03-08 09:39:35,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:39:35,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:39:35,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:39:35,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:39:35,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,990 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-08 09:39:35,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:35,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:36,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:36,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:36,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:36,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:36,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:39:36,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:39:36,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:39:36,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:39:36,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (1/1) ... [2025-03-08 09:39:36,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:39:36,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:39:36,107 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-08 09:39:36,110 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-08 09:39:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:39:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:39:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:39:36,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:39:36,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:39:36,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:39:38,873 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2025-03-08 09:39:38,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:39:38,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:39:38,880 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:39:38,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:38 BoogieIcfgContainer [2025-03-08 09:39:38,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:39:38,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:39:38,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:39:38,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:39:38,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:39:35" (1/3) ... [2025-03-08 09:39:38,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c9acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:38, skipping insertion in model container [2025-03-08 09:39:38,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:35" (2/3) ... [2025-03-08 09:39:38,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c9acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:38, skipping insertion in model container [2025-03-08 09:39:38,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:38" (3/3) ... [2025-03-08 09:39:38,889 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-08 09:39:38,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:39:38,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:39:38,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:39:38,945 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;@3c62b02c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:39:38,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:39:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:39:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:39:38,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:38,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:39:38,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:38,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:39:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:39:38,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842591230] [2025-03-08 09:39:38,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:38,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:39:38,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:39:38,972 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-08 09:39:38,974 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-08 09:39:39,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:39:39,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:39:39,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:39,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:39,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 09:39:39,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:39:39,532 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-08 09:39:39,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:39:39,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:39:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842591230] [2025-03-08 09:39:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842591230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:39:39,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:39:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:39:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814611190] [2025-03-08 09:39:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:39:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:39:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:39:39,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:39:39,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:39:39,555 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:39:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:39,632 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-08 09:39:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:39:39,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 09:39:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:39,639 INFO L225 Difference]: With dead ends: 17 [2025-03-08 09:39:39,639 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 09:39:39,642 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-08 09:39:39,645 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 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-08 09:39:39,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:39:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 09:39:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-08 09:39:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-08 09:39:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:39:39,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:39:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:39,668 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:39:39,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:39:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:39:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:39:39,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:39,669 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:39:39,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:39:39,869 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-08 09:39:39,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:39:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:39:39,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127202678] [2025-03-08 09:39:39,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:39:39,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:39:39,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:39:39,874 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-08 09:39:39,875 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-08 09:39:40,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:39:40,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:39:40,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:39:40,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:40,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 09:39:40,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:39:40,617 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-08 09:39:40,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:39:46,712 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-08 09:39:46,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:39:46,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127202678] [2025-03-08 09:39:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127202678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:39:46,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:39:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 09:39:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564831644] [2025-03-08 09:39:46,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:39:46,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:39:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:39:46,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:39:46,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-03-08 09:39:46,715 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:39:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:39:46,905 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-08 09:39:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:39:46,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 09:39:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:39:46,906 INFO L225 Difference]: With dead ends: 14 [2025-03-08 09:39:46,906 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 09:39:46,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2025-03-08 09:39:46,906 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:39:46,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:39:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 09:39:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 09:39:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:39:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-08 09:39:46,909 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-08 09:39:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:39:46,909 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-08 09:39:46,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:39:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-08 09:39:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 09:39:46,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:39:46,910 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-08 09:39:46,919 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-08 09:39:47,110 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-08 09:39:47,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:39:47,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:39:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-08 09:39:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:39:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791041353] [2025-03-08 09:39:47,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 09:39:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:39:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:39:47,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:39:47,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:39:47,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 09:39:47,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 09:39:47,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 09:39:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:39:47,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-08 09:39:47,929 INFO L279 TraceCheckSpWp]: Computing forward predicates...