./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.vis_arrays_vsaR_p09.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 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:32:21,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:32:21,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:32:21,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:32:21,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:32:21,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:32:21,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:32:21,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:32:21,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:32:21,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:32:21,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:32:21,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:32:21,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:32:21,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:32:21,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:32:21,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:32:21,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:32:21,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:21,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:32:21,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:32:21,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:32:21,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:32:21,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:32:21,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 [2025-03-03 18:32:21,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:32:21,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:32:21,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:32:21,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:32:21,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:32:21,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-03 18:32:22,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357c091e2/3a7d993c89ea4f4ea0b45e24583c2fc0/FLAG26c6c468a [2025-03-03 18:32:23,008 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:32:23,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-03 18:32:23,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357c091e2/3a7d993c89ea4f4ea0b45e24583c2fc0/FLAG26c6c468a [2025-03-03 18:32:23,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357c091e2/3a7d993c89ea4f4ea0b45e24583c2fc0 [2025-03-03 18:32:23,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:32:23,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:32:23,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:23,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:32:23,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:32:23,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68dd9383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23, skipping insertion in model container [2025-03-03 18:32:23,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:32:23,218 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.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-03 18:32:23,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:23,419 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:32:23,427 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.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-03 18:32:23,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:23,530 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:32:23,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23 WrapperNode [2025-03-03 18:32:23,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:23,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:23,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:32:23,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:32:23,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,740 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2751 [2025-03-03 18:32:23,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:23,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:32:23,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:32:23,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:32:23,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,883 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-03 18:32:23,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:23,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:24,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:32:24,002 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:32:24,002 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:32:24,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:32:24,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (1/1) ... [2025-03-03 18:32:24,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:24,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:24,027 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-03 18:32:24,060 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-03 18:32:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:32:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:32:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:32:24,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:32:24,341 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:32:24,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:32:26,370 INFO L? ?]: Removed 1738 outVars from TransFormulas that were not future-live. [2025-03-03 18:32:26,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:32:26,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:32:26,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:32:26,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:26 BoogieIcfgContainer [2025-03-03 18:32:26,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:32:26,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:32:26,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:32:26,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:32:26,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:32:23" (1/3) ... [2025-03-03 18:32:26,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a024693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:26, skipping insertion in model container [2025-03-03 18:32:26,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:23" (2/3) ... [2025-03-03 18:32:26,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a024693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:26, skipping insertion in model container [2025-03-03 18:32:26,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:26" (3/3) ... [2025-03-03 18:32:26,486 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-03 18:32:26,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:32:26,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c that has 1 procedures, 723 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:32:26,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:32:26,563 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;@773cbabe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:32:26,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:32:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 0 states have call successors, (0), 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-03 18:32:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 18:32:26,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:26,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:26,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:26,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash 638021794, now seen corresponding path program 1 times [2025-03-03 18:32:26,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:26,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614023993] [2025-03-03 18:32:26,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:26,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 18:32:26,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 18:32:26,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:26,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:27,656 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-03 18:32:27,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:27,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614023993] [2025-03-03 18:32:27,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614023993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:27,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:27,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:27,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95023182] [2025-03-03 18:32:27,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:27,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:27,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:27,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:27,684 INFO L87 Difference]: Start difference. First operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 0 states have call successors, (0), 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 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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-03 18:32:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:28,137 INFO L93 Difference]: Finished difference Result 1391 states and 2083 transitions. [2025-03-03 18:32:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:28,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-03 18:32:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:28,167 INFO L225 Difference]: With dead ends: 1391 [2025-03-03 18:32:28,167 INFO L226 Difference]: Without dead ends: 722 [2025-03-03 18:32:28,170 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-03 18:32:28,178 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:28,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2686 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-03 18:32:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2025-03-03 18:32:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 1.4965325936199723) internal successors, (1079), 721 states have internal predecessors, (1079), 0 states have call successors, (0), 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-03 18:32:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1079 transitions. [2025-03-03 18:32:28,278 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1079 transitions. Word has length 141 [2025-03-03 18:32:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:28,279 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1079 transitions. [2025-03-03 18:32:28,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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-03 18:32:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1079 transitions. [2025-03-03 18:32:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 18:32:28,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:28,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:28,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:32:28,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:28,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1691480949, now seen corresponding path program 1 times [2025-03-03 18:32:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221312218] [2025-03-03 18:32:28,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:28,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 18:32:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 18:32:28,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:28,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:28,678 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-03 18:32:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221312218] [2025-03-03 18:32:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221312218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392188384] [2025-03-03 18:32:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:28,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:28,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:28,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:28,683 INFO L87 Difference]: Start difference. First operand 722 states and 1079 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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-03 18:32:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:29,023 INFO L93 Difference]: Finished difference Result 1392 states and 2081 transitions. [2025-03-03 18:32:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-03 18:32:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:29,027 INFO L225 Difference]: With dead ends: 1392 [2025-03-03 18:32:29,028 INFO L226 Difference]: Without dead ends: 724 [2025-03-03 18:32:29,030 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-03 18:32:29,030 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:29,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2683 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-03 18:32:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-03-03 18:32:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4951590594744122) internal successors, (1081), 723 states have internal predecessors, (1081), 0 states have call successors, (0), 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-03 18:32:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1081 transitions. [2025-03-03 18:32:29,055 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1081 transitions. Word has length 142 [2025-03-03 18:32:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:29,055 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1081 transitions. [2025-03-03 18:32:29,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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-03 18:32:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1081 transitions. [2025-03-03 18:32:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 18:32:29,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:29,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:29,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:32:29,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:29,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1035208125, now seen corresponding path program 1 times [2025-03-03 18:32:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243386482] [2025-03-03 18:32:29,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:29,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 18:32:29,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 18:32:29,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:29,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:29,774 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-03 18:32:29,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:29,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243386482] [2025-03-03 18:32:29,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243386482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:29,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:29,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186887126] [2025-03-03 18:32:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:29,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:29,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:29,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:29,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:29,778 INFO L87 Difference]: Start difference. First operand 724 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-03 18:32:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:30,190 INFO L93 Difference]: Finished difference Result 1402 states and 2094 transitions. [2025-03-03 18:32:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-03-03 18:32:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:30,194 INFO L225 Difference]: With dead ends: 1402 [2025-03-03 18:32:30,196 INFO L226 Difference]: Without dead ends: 732 [2025-03-03 18:32:30,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:30,198 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:30,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-03 18:32:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2025-03-03 18:32:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.4938271604938271) internal successors, (1089), 729 states have internal predecessors, (1089), 0 states have call successors, (0), 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-03 18:32:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1089 transitions. [2025-03-03 18:32:30,213 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1089 transitions. Word has length 143 [2025-03-03 18:32:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:30,213 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1089 transitions. [2025-03-03 18:32:30,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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-03 18:32:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1089 transitions. [2025-03-03 18:32:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 18:32:30,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:30,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:30,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:32:30,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:30,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash 965335480, now seen corresponding path program 1 times [2025-03-03 18:32:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375303550] [2025-03-03 18:32:30,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:30,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:30,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 18:32:30,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 18:32:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:30,894 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-03 18:32:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375303550] [2025-03-03 18:32:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375303550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:30,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690829707] [2025-03-03 18:32:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:30,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:30,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:30,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:30,898 INFO L87 Difference]: Start difference. First operand 730 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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-03 18:32:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:31,287 INFO L93 Difference]: Finished difference Result 1414 states and 2110 transitions. [2025-03-03 18:32:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-03-03 18:32:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:31,289 INFO L225 Difference]: With dead ends: 1414 [2025-03-03 18:32:31,290 INFO L226 Difference]: Without dead ends: 738 [2025-03-03 18:32:31,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:31,293 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:31,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-03 18:32:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2025-03-03 18:32:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 1.4925170068027211) internal successors, (1097), 735 states have internal predecessors, (1097), 0 states have call successors, (0), 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-03 18:32:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1097 transitions. [2025-03-03 18:32:31,304 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1097 transitions. Word has length 144 [2025-03-03 18:32:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:31,305 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1097 transitions. [2025-03-03 18:32:31,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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-03 18:32:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1097 transitions. [2025-03-03 18:32:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 18:32:31,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:31,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:31,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:32:31,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:31,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1012068597, now seen corresponding path program 1 times [2025-03-03 18:32:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:31,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336708044] [2025-03-03 18:32:31,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:31,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 18:32:31,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 18:32:31,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:31,960 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-03 18:32:31,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:31,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336708044] [2025-03-03 18:32:31,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336708044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:31,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:31,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973377621] [2025-03-03 18:32:31,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:31,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:31,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:31,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:31,963 INFO L87 Difference]: Start difference. First operand 736 states and 1097 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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-03 18:32:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:32,331 INFO L93 Difference]: Finished difference Result 1426 states and 2126 transitions. [2025-03-03 18:32:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-03 18:32:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:32,334 INFO L225 Difference]: With dead ends: 1426 [2025-03-03 18:32:32,334 INFO L226 Difference]: Without dead ends: 744 [2025-03-03 18:32:32,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:32,336 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:32,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-03 18:32:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2025-03-03 18:32:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.4912280701754386) internal successors, (1105), 741 states have internal predecessors, (1105), 0 states have call successors, (0), 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-03 18:32:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1105 transitions. [2025-03-03 18:32:32,349 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1105 transitions. Word has length 145 [2025-03-03 18:32:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:32,349 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1105 transitions. [2025-03-03 18:32:32,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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-03 18:32:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1105 transitions. [2025-03-03 18:32:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 18:32:32,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:32,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:32:32,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1190201077, now seen corresponding path program 1 times [2025-03-03 18:32:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990280044] [2025-03-03 18:32:32,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:32,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 18:32:32,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 18:32:32,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:32,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:32,951 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-03 18:32:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990280044] [2025-03-03 18:32:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990280044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:32,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:32,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315790515] [2025-03-03 18:32:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:32,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:32,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:32,954 INFO L87 Difference]: Start difference. First operand 742 states and 1105 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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-03 18:32:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:33,326 INFO L93 Difference]: Finished difference Result 1438 states and 2142 transitions. [2025-03-03 18:32:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-03 18:32:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:33,329 INFO L225 Difference]: With dead ends: 1438 [2025-03-03 18:32:33,329 INFO L226 Difference]: Without dead ends: 750 [2025-03-03 18:32:33,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:33,331 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:33,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-03 18:32:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2025-03-03 18:32:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4899598393574298) internal successors, (1113), 747 states have internal predecessors, (1113), 0 states have call successors, (0), 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-03 18:32:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1113 transitions. [2025-03-03 18:32:33,344 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1113 transitions. Word has length 146 [2025-03-03 18:32:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:33,344 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1113 transitions. [2025-03-03 18:32:33,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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-03 18:32:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1113 transitions. [2025-03-03 18:32:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 18:32:33,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:33,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:33,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:32:33,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1975019365, now seen corresponding path program 1 times [2025-03-03 18:32:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682420383] [2025-03-03 18:32:33,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:33,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 18:32:33,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 18:32:33,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:33,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:33,918 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-03 18:32:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682420383] [2025-03-03 18:32:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682420383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:33,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343186141] [2025-03-03 18:32:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:33,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:33,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:33,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:33,920 INFO L87 Difference]: Start difference. First operand 748 states and 1113 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 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-03 18:32:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:34,272 INFO L93 Difference]: Finished difference Result 1444 states and 2149 transitions. [2025-03-03 18:32:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:34,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-03 18:32:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:34,275 INFO L225 Difference]: With dead ends: 1444 [2025-03-03 18:32:34,275 INFO L226 Difference]: Without dead ends: 750 [2025-03-03 18:32:34,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:34,276 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 958 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:34,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2614 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-03 18:32:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2025-03-03 18:32:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.4886515353805074) internal successors, (1115), 749 states have internal predecessors, (1115), 0 states have call successors, (0), 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-03 18:32:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1115 transitions. [2025-03-03 18:32:34,289 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1115 transitions. Word has length 147 [2025-03-03 18:32:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:34,289 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1115 transitions. [2025-03-03 18:32:34,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 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-03 18:32:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1115 transitions. [2025-03-03 18:32:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 18:32:34,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:34,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:34,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:32:34,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:34,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2145560741, now seen corresponding path program 1 times [2025-03-03 18:32:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:34,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945152694] [2025-03-03 18:32:34,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:34,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 18:32:34,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 18:32:34,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:34,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:34,916 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-03 18:32:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945152694] [2025-03-03 18:32:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945152694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:34,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:34,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989500692] [2025-03-03 18:32:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:34,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:34,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:34,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:34,919 INFO L87 Difference]: Start difference. First operand 750 states and 1115 transitions. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-03 18:32:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:35,318 INFO L93 Difference]: Finished difference Result 1652 states and 2454 transitions. [2025-03-03 18:32:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:35,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-03 18:32:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:35,322 INFO L225 Difference]: With dead ends: 1652 [2025-03-03 18:32:35,322 INFO L226 Difference]: Without dead ends: 956 [2025-03-03 18:32:35,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:35,323 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 173 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:35,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 3788 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-03 18:32:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 953. [2025-03-03 18:32:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 1.4842436974789917) internal successors, (1413), 952 states have internal predecessors, (1413), 0 states have call successors, (0), 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-03 18:32:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1413 transitions. [2025-03-03 18:32:35,338 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1413 transitions. Word has length 147 [2025-03-03 18:32:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:35,338 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1413 transitions. [2025-03-03 18:32:35,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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-03 18:32:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1413 transitions. [2025-03-03 18:32:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 18:32:35,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:35,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:32:35,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:35,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash -199510254, now seen corresponding path program 1 times [2025-03-03 18:32:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:35,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993384155] [2025-03-03 18:32:35,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:35,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 18:32:35,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 18:32:35,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:35,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:35,780 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-03 18:32:35,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:35,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993384155] [2025-03-03 18:32:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993384155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:35,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:35,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025733877] [2025-03-03 18:32:35,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:35,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:35,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:35,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:35,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:35,782 INFO L87 Difference]: Start difference. First operand 953 states and 1413 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 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-03 18:32:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:36,143 INFO L93 Difference]: Finished difference Result 1868 states and 2770 transitions. [2025-03-03 18:32:36,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:36,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-03 18:32:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:36,147 INFO L225 Difference]: With dead ends: 1868 [2025-03-03 18:32:36,147 INFO L226 Difference]: Without dead ends: 969 [2025-03-03 18:32:36,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:36,149 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:36,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-03 18:32:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2025-03-03 18:32:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.4823651452282158) internal successors, (1429), 964 states have internal predecessors, (1429), 0 states have call successors, (0), 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-03 18:32:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1429 transitions. [2025-03-03 18:32:36,164 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1429 transitions. Word has length 148 [2025-03-03 18:32:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:36,164 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1429 transitions. [2025-03-03 18:32:36,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 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-03 18:32:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1429 transitions. [2025-03-03 18:32:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 18:32:36,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:36,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:32:36,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:36,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2110827527, now seen corresponding path program 1 times [2025-03-03 18:32:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:36,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856069218] [2025-03-03 18:32:36,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:36,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:36,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 18:32:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 18:32:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:36,673 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-03 18:32:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856069218] [2025-03-03 18:32:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856069218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:36,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351419447] [2025-03-03 18:32:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:36,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:36,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:36,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:36,675 INFO L87 Difference]: Start difference. First operand 965 states and 1429 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 18:32:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:37,202 INFO L93 Difference]: Finished difference Result 1888 states and 2796 transitions. [2025-03-03 18:32:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:37,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-03 18:32:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:37,207 INFO L225 Difference]: With dead ends: 1888 [2025-03-03 18:32:37,208 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 18:32:37,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:32:37,210 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 988 mSDsluCounter, 3481 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 4355 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:37,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 4355 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:32:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 18:32:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-03 18:32:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.4805327868852458) internal successors, (1445), 976 states have internal predecessors, (1445), 0 states have call successors, (0), 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-03 18:32:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1445 transitions. [2025-03-03 18:32:37,231 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1445 transitions. Word has length 149 [2025-03-03 18:32:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:37,231 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1445 transitions. [2025-03-03 18:32:37,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 18:32:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1445 transitions. [2025-03-03 18:32:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 18:32:37,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:37,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:37,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:32:37,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:37,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1522707695, now seen corresponding path program 1 times [2025-03-03 18:32:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330963491] [2025-03-03 18:32:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:37,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 18:32:37,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 18:32:37,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:37,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:37,815 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-03 18:32:37,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:37,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330963491] [2025-03-03 18:32:37,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330963491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:37,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:37,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:37,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908414738] [2025-03-03 18:32:37,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:37,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:37,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:37,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:37,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:37,819 INFO L87 Difference]: Start difference. First operand 977 states and 1445 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 18:32:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:38,333 INFO L93 Difference]: Finished difference Result 1908 states and 2822 transitions. [2025-03-03 18:32:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:32:38,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-03 18:32:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:38,336 INFO L225 Difference]: With dead ends: 1908 [2025-03-03 18:32:38,336 INFO L226 Difference]: Without dead ends: 985 [2025-03-03 18:32:38,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:38,338 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 172 mSDsluCounter, 4447 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:38,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 5339 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:32:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-03-03 18:32:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 984. [2025-03-03 18:32:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 1.4801627670396744) internal successors, (1455), 983 states have internal predecessors, (1455), 0 states have call successors, (0), 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-03 18:32:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1455 transitions. [2025-03-03 18:32:38,353 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1455 transitions. Word has length 149 [2025-03-03 18:32:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:38,353 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1455 transitions. [2025-03-03 18:32:38,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 18:32:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1455 transitions. [2025-03-03 18:32:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 18:32:38,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:38,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:38,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:32:38,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:38,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash 679461994, now seen corresponding path program 1 times [2025-03-03 18:32:38,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:38,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528793328] [2025-03-03 18:32:38,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:38,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 18:32:38,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 18:32:38,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:38,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:38,584 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-03 18:32:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528793328] [2025-03-03 18:32:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528793328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876366953] [2025-03-03 18:32:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:38,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:38,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:38,585 INFO L87 Difference]: Start difference. First operand 984 states and 1455 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 18:32:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:38,921 INFO L93 Difference]: Finished difference Result 1932 states and 2857 transitions. [2025-03-03 18:32:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-03-03 18:32:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:38,925 INFO L225 Difference]: With dead ends: 1932 [2025-03-03 18:32:38,925 INFO L226 Difference]: Without dead ends: 1002 [2025-03-03 18:32:38,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:38,927 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 16 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:38,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-03 18:32:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2025-03-03 18:32:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 1001 states have (on average 1.4795204795204795) internal successors, (1481), 1001 states have internal predecessors, (1481), 0 states have call successors, (0), 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-03 18:32:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1481 transitions. [2025-03-03 18:32:38,942 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1481 transitions. Word has length 149 [2025-03-03 18:32:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:38,942 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1481 transitions. [2025-03-03 18:32:38,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 18:32:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1481 transitions. [2025-03-03 18:32:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 18:32:38,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:38,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:32:38,944 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash -521100457, now seen corresponding path program 1 times [2025-03-03 18:32:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653214462] [2025-03-03 18:32:38,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:38,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 18:32:39,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 18:32:39,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:39,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:39,367 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-03 18:32:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653214462] [2025-03-03 18:32:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653214462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:39,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:39,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140118025] [2025-03-03 18:32:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:39,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:39,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:39,369 INFO L87 Difference]: Start difference. First operand 1002 states and 1481 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 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-03 18:32:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:39,832 INFO L93 Difference]: Finished difference Result 2363 states and 3487 transitions. [2025-03-03 18:32:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:39,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-03 18:32:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:39,837 INFO L225 Difference]: With dead ends: 2363 [2025-03-03 18:32:39,837 INFO L226 Difference]: Without dead ends: 1415 [2025-03-03 18:32:39,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:39,838 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 2134 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2134 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:39,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2134 Valid, 3531 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-03-03 18:32:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1008. [2025-03-03 18:32:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 1.4786494538232373) internal successors, (1489), 1007 states have internal predecessors, (1489), 0 states have call successors, (0), 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-03 18:32:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1489 transitions. [2025-03-03 18:32:39,854 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1489 transitions. Word has length 150 [2025-03-03 18:32:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:39,854 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1489 transitions. [2025-03-03 18:32:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 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-03 18:32:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1489 transitions. [2025-03-03 18:32:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 18:32:39,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:39,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:32:39,857 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1041807928, now seen corresponding path program 1 times [2025-03-03 18:32:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410815201] [2025-03-03 18:32:39,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:39,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 18:32:39,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 18:32:39,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:39,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:40,085 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-03 18:32:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410815201] [2025-03-03 18:32:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410815201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018782834] [2025-03-03 18:32:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:40,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:40,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:40,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:40,089 INFO L87 Difference]: Start difference. First operand 1008 states and 1489 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-03 18:32:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:40,408 INFO L93 Difference]: Finished difference Result 1982 states and 2928 transitions. [2025-03-03 18:32:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-03-03 18:32:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:40,412 INFO L225 Difference]: With dead ends: 1982 [2025-03-03 18:32:40,412 INFO L226 Difference]: Without dead ends: 1028 [2025-03-03 18:32:40,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:40,415 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:40,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-03-03 18:32:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2025-03-03 18:32:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.4771178188899707) internal successors, (1517), 1027 states have internal predecessors, (1517), 0 states have call successors, (0), 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-03 18:32:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1517 transitions. [2025-03-03 18:32:40,433 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1517 transitions. Word has length 151 [2025-03-03 18:32:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:40,433 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1517 transitions. [2025-03-03 18:32:40,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-03 18:32:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1517 transitions. [2025-03-03 18:32:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 18:32:40,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:40,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:32:40,435 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:40,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1258583232, now seen corresponding path program 1 times [2025-03-03 18:32:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363924521] [2025-03-03 18:32:40,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:40,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 18:32:40,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 18:32:40,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:40,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:40,897 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-03 18:32:40,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:40,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363924521] [2025-03-03 18:32:40,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363924521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:40,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:40,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:32:40,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880602617] [2025-03-03 18:32:40,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:40,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:32:40,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:40,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:32:40,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:40,898 INFO L87 Difference]: Start difference. First operand 1028 states and 1517 transitions. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 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-03 18:32:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:41,410 INFO L93 Difference]: Finished difference Result 2006 states and 2959 transitions. [2025-03-03 18:32:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:32:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-03-03 18:32:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:41,414 INFO L225 Difference]: With dead ends: 2006 [2025-03-03 18:32:41,414 INFO L226 Difference]: Without dead ends: 1032 [2025-03-03 18:32:41,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:32:41,416 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 1088 mSDsluCounter, 4433 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:41,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 5323 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:32:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-03 18:32:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1028. [2025-03-03 18:32:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.4771178188899707) internal successors, (1517), 1027 states have internal predecessors, (1517), 0 states have call successors, (0), 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-03 18:32:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1517 transitions. [2025-03-03 18:32:41,430 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1517 transitions. Word has length 151 [2025-03-03 18:32:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:41,430 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1517 transitions. [2025-03-03 18:32:41,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 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-03 18:32:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1517 transitions. [2025-03-03 18:32:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 18:32:41,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:41,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:32:41,432 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash -280844157, now seen corresponding path program 1 times [2025-03-03 18:32:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578374662] [2025-03-03 18:32:41,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:41,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 18:32:41,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 18:32:41,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:41,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:41,726 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-03 18:32:41,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578374662] [2025-03-03 18:32:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578374662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918773842] [2025-03-03 18:32:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:41,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:41,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:41,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:41,729 INFO L87 Difference]: Start difference. First operand 1028 states and 1517 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 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-03 18:32:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:42,019 INFO L93 Difference]: Finished difference Result 2062 states and 3040 transitions. [2025-03-03 18:32:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-03 18:32:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:42,025 INFO L225 Difference]: With dead ends: 2062 [2025-03-03 18:32:42,025 INFO L226 Difference]: Without dead ends: 1088 [2025-03-03 18:32:42,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:42,026 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:42,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-03-03 18:32:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2025-03-03 18:32:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4728610855565778) internal successors, (1601), 1087 states have internal predecessors, (1601), 0 states have call successors, (0), 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-03 18:32:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1601 transitions. [2025-03-03 18:32:42,041 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1601 transitions. Word has length 152 [2025-03-03 18:32:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:42,041 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1601 transitions. [2025-03-03 18:32:42,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 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-03 18:32:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1601 transitions. [2025-03-03 18:32:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 18:32:42,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:42,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:42,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:32:42,043 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1897493820, now seen corresponding path program 1 times [2025-03-03 18:32:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:42,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714758065] [2025-03-03 18:32:42,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:42,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 18:32:42,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 18:32:42,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:42,512 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-03 18:32:42,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714758065] [2025-03-03 18:32:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714758065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339102811] [2025-03-03 18:32:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:42,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:42,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:42,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:42,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:42,515 INFO L87 Difference]: Start difference. First operand 1088 states and 1601 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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-03 18:32:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:43,078 INFO L93 Difference]: Finished difference Result 2577 states and 3785 transitions. [2025-03-03 18:32:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:43,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-03 18:32:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:43,081 INFO L225 Difference]: With dead ends: 2577 [2025-03-03 18:32:43,081 INFO L226 Difference]: Without dead ends: 1543 [2025-03-03 18:32:43,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:32:43,086 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 1588 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 4739 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:43,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 4739 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:32:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-03-03 18:32:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1088. [2025-03-03 18:32:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4728610855565778) internal successors, (1601), 1087 states have internal predecessors, (1601), 0 states have call successors, (0), 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-03 18:32:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1601 transitions. [2025-03-03 18:32:43,099 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1601 transitions. Word has length 152 [2025-03-03 18:32:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:43,099 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1601 transitions. [2025-03-03 18:32:43,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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-03 18:32:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1601 transitions. [2025-03-03 18:32:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 18:32:43,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:43,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:43,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:32:43,101 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:43,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1933673100, now seen corresponding path program 1 times [2025-03-03 18:32:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972732529] [2025-03-03 18:32:43,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:43,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 18:32:43,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 18:32:43,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:43,316 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-03 18:32:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972732529] [2025-03-03 18:32:43,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972732529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:43,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:43,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69150076] [2025-03-03 18:32:43,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:43,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:43,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:43,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:43,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:43,318 INFO L87 Difference]: Start difference. First operand 1088 states and 1601 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-03 18:32:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:43,632 INFO L93 Difference]: Finished difference Result 2142 states and 3152 transitions. [2025-03-03 18:32:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-03-03 18:32:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:43,635 INFO L225 Difference]: With dead ends: 2142 [2025-03-03 18:32:43,635 INFO L226 Difference]: Without dead ends: 1108 [2025-03-03 18:32:43,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:43,636 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4465 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:43,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4465 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-03 18:32:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-03-03 18:32:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.4715447154471544) internal successors, (1629), 1107 states have internal predecessors, (1629), 0 states have call successors, (0), 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-03 18:32:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1629 transitions. [2025-03-03 18:32:43,662 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1629 transitions. Word has length 153 [2025-03-03 18:32:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:43,662 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1629 transitions. [2025-03-03 18:32:43,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-03 18:32:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1629 transitions. [2025-03-03 18:32:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 18:32:43,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:43,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:43,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:32:43,664 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1028212605, now seen corresponding path program 1 times [2025-03-03 18:32:43,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199531559] [2025-03-03 18:32:43,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:43,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 18:32:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 18:32:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:44,036 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-03 18:32:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199531559] [2025-03-03 18:32:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199531559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:44,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258044679] [2025-03-03 18:32:44,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:44,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:44,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:44,038 INFO L87 Difference]: Start difference. First operand 1108 states and 1629 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-03 18:32:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:44,386 INFO L93 Difference]: Finished difference Result 2571 states and 3771 transitions. [2025-03-03 18:32:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:44,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-03-03 18:32:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:44,389 INFO L225 Difference]: With dead ends: 2571 [2025-03-03 18:32:44,389 INFO L226 Difference]: Without dead ends: 1517 [2025-03-03 18:32:44,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:44,391 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 514 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:44,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3470 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-03 18:32:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1110. [2025-03-03 18:32:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.4706943192064923) internal successors, (1631), 1109 states have internal predecessors, (1631), 0 states have call successors, (0), 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-03 18:32:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1631 transitions. [2025-03-03 18:32:44,403 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1631 transitions. Word has length 153 [2025-03-03 18:32:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:44,403 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1631 transitions. [2025-03-03 18:32:44,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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-03 18:32:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1631 transitions. [2025-03-03 18:32:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 18:32:44,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:44,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:44,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:32:44,404 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:44,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2123444014, now seen corresponding path program 1 times [2025-03-03 18:32:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72454965] [2025-03-03 18:32:44,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:44,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 18:32:44,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 18:32:44,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:44,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:44,612 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-03 18:32:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72454965] [2025-03-03 18:32:44,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72454965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:44,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:44,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:44,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831043725] [2025-03-03 18:32:44,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:44,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:44,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:44,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:44,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:44,613 INFO L87 Difference]: Start difference. First operand 1110 states and 1631 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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-03 18:32:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:44,891 INFO L93 Difference]: Finished difference Result 2232 states and 3278 transitions. [2025-03-03 18:32:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:44,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-03 18:32:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:44,894 INFO L225 Difference]: With dead ends: 2232 [2025-03-03 18:32:44,894 INFO L226 Difference]: Without dead ends: 1178 [2025-03-03 18:32:44,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:44,895 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:44,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-03-03 18:32:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2025-03-03 18:32:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4672897196261683) internal successors, (1727), 1177 states have internal predecessors, (1727), 0 states have call successors, (0), 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-03 18:32:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1727 transitions. [2025-03-03 18:32:44,906 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1727 transitions. Word has length 154 [2025-03-03 18:32:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:44,906 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1727 transitions. [2025-03-03 18:32:44,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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-03 18:32:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1727 transitions. [2025-03-03 18:32:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 18:32:44,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:44,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:44,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 18:32:44,907 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:44,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1667403672, now seen corresponding path program 1 times [2025-03-03 18:32:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935130184] [2025-03-03 18:32:44,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:44,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 18:32:44,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 18:32:44,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:44,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:45,140 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-03 18:32:45,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935130184] [2025-03-03 18:32:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935130184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:45,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975943800] [2025-03-03 18:32:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:45,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:45,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:45,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:45,141 INFO L87 Difference]: Start difference. First operand 1178 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-03 18:32:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:45,390 INFO L93 Difference]: Finished difference Result 2320 states and 3402 transitions. [2025-03-03 18:32:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:45,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-03 18:32:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:45,392 INFO L225 Difference]: With dead ends: 2320 [2025-03-03 18:32:45,393 INFO L226 Difference]: Without dead ends: 1198 [2025-03-03 18:32:45,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:45,394 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:45,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:32:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-03 18:32:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-03 18:32:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1197 states have (on average 1.4661654135338347) internal successors, (1755), 1197 states have internal predecessors, (1755), 0 states have call successors, (0), 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-03 18:32:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1755 transitions. [2025-03-03 18:32:45,404 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1755 transitions. Word has length 155 [2025-03-03 18:32:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:45,404 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1755 transitions. [2025-03-03 18:32:45,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-03 18:32:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1755 transitions. [2025-03-03 18:32:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 18:32:45,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:45,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:45,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 18:32:45,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash 374914243, now seen corresponding path program 1 times [2025-03-03 18:32:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132163498] [2025-03-03 18:32:45,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:45,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:32:45,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:32:45,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:45,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:45,609 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-03 18:32:45,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:45,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132163498] [2025-03-03 18:32:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132163498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:45,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:45,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959228842] [2025-03-03 18:32:45,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:45,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:45,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:45,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:45,611 INFO L87 Difference]: Start difference. First operand 1198 states and 1755 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 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-03 18:32:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:45,882 INFO L93 Difference]: Finished difference Result 2396 states and 3510 transitions. [2025-03-03 18:32:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-03 18:32:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:45,886 INFO L225 Difference]: With dead ends: 2396 [2025-03-03 18:32:45,886 INFO L226 Difference]: Without dead ends: 1254 [2025-03-03 18:32:45,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:45,890 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:45,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-03 18:32:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2025-03-03 18:32:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.464485235434956) internal successors, (1835), 1253 states have internal predecessors, (1835), 0 states have call successors, (0), 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-03 18:32:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1835 transitions. [2025-03-03 18:32:45,901 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1835 transitions. Word has length 156 [2025-03-03 18:32:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:45,901 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1835 transitions. [2025-03-03 18:32:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 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-03 18:32:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1835 transitions. [2025-03-03 18:32:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 18:32:45,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:45,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:45,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 18:32:45,902 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:45,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1598471444, now seen corresponding path program 1 times [2025-03-03 18:32:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467917358] [2025-03-03 18:32:45,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:45,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 18:32:45,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 18:32:45,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:46,102 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-03 18:32:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467917358] [2025-03-03 18:32:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467917358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676588405] [2025-03-03 18:32:46,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:46,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:46,103 INFO L87 Difference]: Start difference. First operand 1254 states and 1835 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 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-03 18:32:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:46,353 INFO L93 Difference]: Finished difference Result 2472 states and 3618 transitions. [2025-03-03 18:32:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:46,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-03-03 18:32:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:46,357 INFO L225 Difference]: With dead ends: 2472 [2025-03-03 18:32:46,357 INFO L226 Difference]: Without dead ends: 1274 [2025-03-03 18:32:46,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:46,358 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:46,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:32:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-03-03 18:32:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2025-03-03 18:32:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 1.4634721131186175) internal successors, (1863), 1273 states have internal predecessors, (1863), 0 states have call successors, (0), 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-03 18:32:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1863 transitions. [2025-03-03 18:32:46,369 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1863 transitions. Word has length 157 [2025-03-03 18:32:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1863 transitions. [2025-03-03 18:32:46,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 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-03 18:32:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1863 transitions. [2025-03-03 18:32:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 18:32:46,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:46,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:46,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 18:32:46,370 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:46,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2042550702, now seen corresponding path program 1 times [2025-03-03 18:32:46,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:46,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500114769] [2025-03-03 18:32:46,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:46,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 18:32:46,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 18:32:46,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:46,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:46,577 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-03 18:32:46,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500114769] [2025-03-03 18:32:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500114769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:46,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747691109] [2025-03-03 18:32:46,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:46,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:46,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:46,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:46,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:46,579 INFO L87 Difference]: Start difference. First operand 1274 states and 1863 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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-03 18:32:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:46,847 INFO L93 Difference]: Finished difference Result 2548 states and 3726 transitions. [2025-03-03 18:32:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-03-03 18:32:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:46,850 INFO L225 Difference]: With dead ends: 2548 [2025-03-03 18:32:46,850 INFO L226 Difference]: Without dead ends: 1330 [2025-03-03 18:32:46,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:46,855 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:46,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-03-03 18:32:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2025-03-03 18:32:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 1.4620015048908954) internal successors, (1943), 1329 states have internal predecessors, (1943), 0 states have call successors, (0), 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-03 18:32:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1943 transitions. [2025-03-03 18:32:46,866 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1943 transitions. Word has length 158 [2025-03-03 18:32:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:46,866 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1943 transitions. [2025-03-03 18:32:46,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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-03 18:32:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1943 transitions. [2025-03-03 18:32:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 18:32:46,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:46,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:32:46,867 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:46,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1109011208, now seen corresponding path program 1 times [2025-03-03 18:32:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408989806] [2025-03-03 18:32:46,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:46,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 18:32:46,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 18:32:46,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:46,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:47,586 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-03 18:32:47,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:47,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408989806] [2025-03-03 18:32:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408989806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:47,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:32:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176474037] [2025-03-03 18:32:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:47,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:32:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:47,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:32:47,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:32:47,589 INFO L87 Difference]: Start difference. First operand 1330 states and 1943 transitions. Second operand has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 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-03 18:32:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:48,534 INFO L93 Difference]: Finished difference Result 2724 states and 3982 transitions. [2025-03-03 18:32:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:32:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-03 18:32:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:48,538 INFO L225 Difference]: With dead ends: 2724 [2025-03-03 18:32:48,538 INFO L226 Difference]: Without dead ends: 1450 [2025-03-03 18:32:48,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:32:48,539 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 49 mSDsluCounter, 11805 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 12718 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:48,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 12718 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:32:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-03 18:32:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1428. [2025-03-03 18:32:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.4639103013314647) internal successors, (2089), 1427 states have internal predecessors, (2089), 0 states have call successors, (0), 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-03 18:32:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2089 transitions. [2025-03-03 18:32:48,550 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2089 transitions. Word has length 159 [2025-03-03 18:32:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:48,550 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2089 transitions. [2025-03-03 18:32:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 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-03 18:32:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2089 transitions. [2025-03-03 18:32:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 18:32:48,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:48,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:48,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 18:32:48,551 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:48,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1881819842, now seen corresponding path program 1 times [2025-03-03 18:32:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993731770] [2025-03-03 18:32:48,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:48,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 18:32:48,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 18:32:48,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:48,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:48,933 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-03 18:32:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993731770] [2025-03-03 18:32:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993731770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:48,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:48,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807756574] [2025-03-03 18:32:48,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:48,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:48,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:48,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:48,935 INFO L87 Difference]: Start difference. First operand 1428 states and 2089 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-03 18:32:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:49,242 INFO L93 Difference]: Finished difference Result 2812 states and 4114 transitions. [2025-03-03 18:32:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:49,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-03 18:32:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:49,245 INFO L225 Difference]: With dead ends: 2812 [2025-03-03 18:32:49,245 INFO L226 Difference]: Without dead ends: 1440 [2025-03-03 18:32:49,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:49,247 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 1043 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:49,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 3486 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2025-03-03 18:32:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2025-03-03 18:32:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.462821403752606) internal successors, (2105), 1439 states have internal predecessors, (2105), 0 states have call successors, (0), 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-03 18:32:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2105 transitions. [2025-03-03 18:32:49,257 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2105 transitions. Word has length 159 [2025-03-03 18:32:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:49,257 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2105 transitions. [2025-03-03 18:32:49,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-03 18:32:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2105 transitions. [2025-03-03 18:32:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 18:32:49,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:49,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:49,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 18:32:49,259 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:49,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1409788083, now seen corresponding path program 1 times [2025-03-03 18:32:49,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:49,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222043110] [2025-03-03 18:32:49,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:49,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:49,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 18:32:49,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 18:32:49,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:49,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-03 18:32:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222043110] [2025-03-03 18:32:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222043110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:49,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806818970] [2025-03-03 18:32:49,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:49,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:49,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:49,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:49,774 INFO L87 Difference]: Start difference. First operand 1440 states and 2105 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-03 18:32:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:50,156 INFO L93 Difference]: Finished difference Result 2824 states and 4128 transitions. [2025-03-03 18:32:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:32:50,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-03 18:32:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:50,160 INFO L225 Difference]: With dead ends: 2824 [2025-03-03 18:32:50,160 INFO L226 Difference]: Without dead ends: 1440 [2025-03-03 18:32:50,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:50,162 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 11 mSDsluCounter, 4422 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5310 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:50,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5310 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2025-03-03 18:32:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2025-03-03 18:32:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.4614315496872827) internal successors, (2103), 1439 states have internal predecessors, (2103), 0 states have call successors, (0), 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-03 18:32:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2103 transitions. [2025-03-03 18:32:50,177 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2103 transitions. Word has length 160 [2025-03-03 18:32:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2103 transitions. [2025-03-03 18:32:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-03 18:32:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2103 transitions. [2025-03-03 18:32:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 18:32:50,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:50,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:50,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 18:32:50,179 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:50,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1494024331, now seen corresponding path program 1 times [2025-03-03 18:32:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153510752] [2025-03-03 18:32:50,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:50,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 18:32:50,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 18:32:50,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:50,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:50,456 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-03 18:32:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153510752] [2025-03-03 18:32:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153510752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736990869] [2025-03-03 18:32:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:50,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:50,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:50,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:50,458 INFO L87 Difference]: Start difference. First operand 1440 states and 2103 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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-03 18:32:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:50,769 INFO L93 Difference]: Finished difference Result 2844 states and 4154 transitions. [2025-03-03 18:32:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-03 18:32:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:50,771 INFO L225 Difference]: With dead ends: 2844 [2025-03-03 18:32:50,771 INFO L226 Difference]: Without dead ends: 1460 [2025-03-03 18:32:50,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:50,772 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:50,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4448 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-03-03 18:32:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1452. [2025-03-03 18:32:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.4603721571330117) internal successors, (2119), 1451 states have internal predecessors, (2119), 0 states have call successors, (0), 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-03 18:32:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2119 transitions. [2025-03-03 18:32:50,784 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2119 transitions. Word has length 160 [2025-03-03 18:32:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:50,784 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2119 transitions. [2025-03-03 18:32:50,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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-03 18:32:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2119 transitions. [2025-03-03 18:32:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 18:32:50,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:50,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:50,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 18:32:50,785 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -281624372, now seen corresponding path program 1 times [2025-03-03 18:32:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:50,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847655293] [2025-03-03 18:32:50,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:32:50,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:32:50,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:50,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:51,200 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-03 18:32:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:51,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847655293] [2025-03-03 18:32:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847655293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:51,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723459831] [2025-03-03 18:32:51,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:51,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:51,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:51,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:51,201 INFO L87 Difference]: Start difference. First operand 1452 states and 2119 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 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-03 18:32:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:51,594 INFO L93 Difference]: Finished difference Result 2948 states and 4296 transitions. [2025-03-03 18:32:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:51,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-03 18:32:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:51,597 INFO L225 Difference]: With dead ends: 2948 [2025-03-03 18:32:51,597 INFO L226 Difference]: Without dead ends: 1552 [2025-03-03 18:32:51,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:51,598 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 983 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:51,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 4347 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-03-03 18:32:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2025-03-03 18:32:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 1.4539007092198581) internal successors, (2255), 1551 states have internal predecessors, (2255), 0 states have call successors, (0), 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-03 18:32:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2255 transitions. [2025-03-03 18:32:51,609 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2255 transitions. Word has length 161 [2025-03-03 18:32:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:51,609 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2255 transitions. [2025-03-03 18:32:51,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 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-03 18:32:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2255 transitions. [2025-03-03 18:32:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 18:32:51,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:51,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:51,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 18:32:51,610 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:51,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 439070055, now seen corresponding path program 1 times [2025-03-03 18:32:51,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:51,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973455852] [2025-03-03 18:32:51,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:51,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:32:51,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:32:51,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:51,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:51,927 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-03 18:32:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973455852] [2025-03-03 18:32:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973455852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:51,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046288068] [2025-03-03 18:32:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:51,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:51,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:51,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:51,929 INFO L87 Difference]: Start difference. First operand 1552 states and 2255 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 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-03 18:32:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:52,345 INFO L93 Difference]: Finished difference Result 3068 states and 4460 transitions. [2025-03-03 18:32:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-03 18:32:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:52,348 INFO L225 Difference]: With dead ends: 3068 [2025-03-03 18:32:52,349 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 18:32:52,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:52,351 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:52,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4448 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 18:32:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1568. [2025-03-03 18:32:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4518187619655392) internal successors, (2275), 1567 states have internal predecessors, (2275), 0 states have call successors, (0), 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-03 18:32:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2275 transitions. [2025-03-03 18:32:52,371 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2275 transitions. Word has length 161 [2025-03-03 18:32:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:52,371 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2275 transitions. [2025-03-03 18:32:52,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 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-03 18:32:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2275 transitions. [2025-03-03 18:32:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 18:32:52,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:52,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:52,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 18:32:52,373 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:52,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:52,373 INFO L85 PathProgramCache]: Analyzing trace with hash -81003993, now seen corresponding path program 1 times [2025-03-03 18:32:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:52,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407606515] [2025-03-03 18:32:52,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:52,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 18:32:52,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 18:32:52,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:52,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:52,814 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-03 18:32:52,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407606515] [2025-03-03 18:32:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407606515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:52,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:52,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:52,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416139369] [2025-03-03 18:32:52,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:52,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:52,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:52,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:52,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:52,816 INFO L87 Difference]: Start difference. First operand 1568 states and 2275 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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-03 18:32:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:53,214 INFO L93 Difference]: Finished difference Result 3130 states and 4538 transitions. [2025-03-03 18:32:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:53,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 18:32:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:53,217 INFO L225 Difference]: With dead ends: 3130 [2025-03-03 18:32:53,217 INFO L226 Difference]: Without dead ends: 1618 [2025-03-03 18:32:53,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:53,219 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1050 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 4345 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:53,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 4345 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-03 18:32:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2025-03-03 18:32:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1617 states have (on average 1.4477427334570192) internal successors, (2341), 1617 states have internal predecessors, (2341), 0 states have call successors, (0), 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-03 18:32:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2341 transitions. [2025-03-03 18:32:53,231 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2341 transitions. Word has length 162 [2025-03-03 18:32:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:53,231 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2341 transitions. [2025-03-03 18:32:53,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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-03 18:32:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2341 transitions. [2025-03-03 18:32:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 18:32:53,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:53,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:53,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 18:32:53,233 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -352585492, now seen corresponding path program 1 times [2025-03-03 18:32:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201678623] [2025-03-03 18:32:53,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:53,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 18:32:53,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 18:32:53,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:53,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:53,712 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-03 18:32:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201678623] [2025-03-03 18:32:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201678623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:53,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:53,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927930737] [2025-03-03 18:32:53,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:53,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:53,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:53,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:53,715 INFO L87 Difference]: Start difference. First operand 1618 states and 2341 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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-03 18:32:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:54,104 INFO L93 Difference]: Finished difference Result 3200 states and 4630 transitions. [2025-03-03 18:32:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:54,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 18:32:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:54,107 INFO L225 Difference]: With dead ends: 3200 [2025-03-03 18:32:54,107 INFO L226 Difference]: Without dead ends: 1638 [2025-03-03 18:32:54,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:54,109 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 4443 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5335 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:54,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5335 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:32:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-03-03 18:32:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1630. [2025-03-03 18:32:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 1.4468999386126458) internal successors, (2357), 1629 states have internal predecessors, (2357), 0 states have call successors, (0), 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-03 18:32:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2357 transitions. [2025-03-03 18:32:54,124 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2357 transitions. Word has length 162 [2025-03-03 18:32:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:54,124 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2357 transitions. [2025-03-03 18:32:54,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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-03 18:32:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2357 transitions. [2025-03-03 18:32:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 18:32:54,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:54,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 18:32:54,125 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:54,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2140691881, now seen corresponding path program 1 times [2025-03-03 18:32:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750903794] [2025-03-03 18:32:54,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:54,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 18:32:54,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 18:32:54,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:54,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:55,262 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-03 18:32:55,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:55,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750903794] [2025-03-03 18:32:55,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750903794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:55,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-03-03 18:32:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431339589] [2025-03-03 18:32:55,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:55,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 18:32:55,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:55,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 18:32:55,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2025-03-03 18:32:55,264 INFO L87 Difference]: Start difference. First operand 1630 states and 2357 transitions. Second operand has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 states have internal predecessors, (163), 0 states have call successors, (0), 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-03 18:32:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:57,467 INFO L93 Difference]: Finished difference Result 3696 states and 5344 transitions. [2025-03-03 18:32:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 18:32:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-03 18:32:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:57,470 INFO L225 Difference]: With dead ends: 3696 [2025-03-03 18:32:57,470 INFO L226 Difference]: Without dead ends: 2122 [2025-03-03 18:32:57,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=1050, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:32:57,472 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 132 mSDsluCounter, 24473 mSDsCounter, 0 mSdLazyCounter, 7002 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 25319 SdHoareTripleChecker+Invalid, 7022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:57,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 25319 Invalid, 7022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 7002 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 18:32:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2025-03-03 18:32:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2084. [2025-03-03 18:32:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2083 states have (on average 1.4483917426788286) internal successors, (3017), 2083 states have internal predecessors, (3017), 0 states have call successors, (0), 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-03 18:32:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3017 transitions. [2025-03-03 18:32:57,489 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3017 transitions. Word has length 163 [2025-03-03 18:32:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:57,489 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 3017 transitions. [2025-03-03 18:32:57,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 states have internal predecessors, (163), 0 states have call successors, (0), 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-03 18:32:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3017 transitions. [2025-03-03 18:32:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 18:32:57,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:57,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:57,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 18:32:57,491 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:57,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash -687711982, now seen corresponding path program 1 times [2025-03-03 18:32:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205628995] [2025-03-03 18:32:57,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:57,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 18:32:57,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 18:32:57,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:57,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:58,110 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-03 18:32:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:58,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205628995] [2025-03-03 18:32:58,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205628995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:58,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:58,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 18:32:58,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948599046] [2025-03-03 18:32:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:58,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:32:58,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:58,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:32:58,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:32:58,111 INFO L87 Difference]: Start difference. First operand 2084 states and 3017 transitions. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 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-03 18:32:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:59,009 INFO L93 Difference]: Finished difference Result 4284 states and 6208 transitions. [2025-03-03 18:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:32:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 18:32:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:59,012 INFO L225 Difference]: With dead ends: 4284 [2025-03-03 18:32:59,013 INFO L226 Difference]: Without dead ends: 2256 [2025-03-03 18:32:59,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:32:59,015 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 55 mSDsluCounter, 11769 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 12683 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:59,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 12683 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:32:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-03 18:32:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2116. [2025-03-03 18:32:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 1.4472813238770685) internal successors, (3061), 2115 states have internal predecessors, (3061), 0 states have call successors, (0), 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-03 18:32:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3061 transitions. [2025-03-03 18:32:59,032 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3061 transitions. Word has length 164 [2025-03-03 18:32:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:59,032 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 3061 transitions. [2025-03-03 18:32:59,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 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-03 18:32:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3061 transitions. [2025-03-03 18:32:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 18:32:59,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:59,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:59,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 18:32:59,034 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:59,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 306974338, now seen corresponding path program 1 times [2025-03-03 18:32:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457802227] [2025-03-03 18:32:59,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:59,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 18:32:59,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 18:32:59,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:59,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:59,435 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-03 18:32:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457802227] [2025-03-03 18:32:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457802227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:59,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:59,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96236230] [2025-03-03 18:32:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:59,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:59,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:59,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:59,437 INFO L87 Difference]: Start difference. First operand 2116 states and 3061 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:32:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:59,757 INFO L93 Difference]: Finished difference Result 4324 states and 6254 transitions. [2025-03-03 18:32:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:59,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-03 18:32:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:59,760 INFO L225 Difference]: With dead ends: 4324 [2025-03-03 18:32:59,760 INFO L226 Difference]: Without dead ends: 2264 [2025-03-03 18:32:59,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:59,762 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1003 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:59,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 3479 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:32:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2025-03-03 18:32:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2264. [2025-03-03 18:32:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2263 states have (on average 1.4427750773309767) internal successors, (3265), 2263 states have internal predecessors, (3265), 0 states have call successors, (0), 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-03 18:32:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3265 transitions. [2025-03-03 18:32:59,778 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3265 transitions. Word has length 165 [2025-03-03 18:32:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 3265 transitions. [2025-03-03 18:32:59,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:32:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3265 transitions. [2025-03-03 18:32:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 18:32:59,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:59,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:32:59,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 18:32:59,780 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:59,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1609593926, now seen corresponding path program 1 times [2025-03-03 18:32:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:59,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984323691] [2025-03-03 18:32:59,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:59,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 18:32:59,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 18:32:59,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:59,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984323691] [2025-03-03 18:33:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984323691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:00,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:33:00,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999069505] [2025-03-03 18:33:00,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:00,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:33:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:00,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:33:00,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:00,201 INFO L87 Difference]: Start difference. First operand 2264 states and 3265 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:33:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:00,495 INFO L93 Difference]: Finished difference Result 4498 states and 6490 transitions. [2025-03-03 18:33:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:33:00,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-03 18:33:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:00,498 INFO L225 Difference]: With dead ends: 4498 [2025-03-03 18:33:00,498 INFO L226 Difference]: Without dead ends: 2290 [2025-03-03 18:33:00,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:00,500 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:00,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4448 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-03-03 18:33:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2242. [2025-03-03 18:33:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 1.4444444444444444) internal successors, (3237), 2241 states have internal predecessors, (3237), 0 states have call successors, (0), 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-03 18:33:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3237 transitions. [2025-03-03 18:33:00,515 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3237 transitions. Word has length 165 [2025-03-03 18:33:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:00,515 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3237 transitions. [2025-03-03 18:33:00,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:33:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3237 transitions. [2025-03-03 18:33:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 18:33:00,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:00,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:00,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 18:33:00,516 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:00,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash 830183965, now seen corresponding path program 1 times [2025-03-03 18:33:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:00,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948428730] [2025-03-03 18:33:00,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:00,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 18:33:00,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 18:33:00,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:00,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:01,512 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-03 18:33:01,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948428730] [2025-03-03 18:33:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948428730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-03 18:33:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591489863] [2025-03-03 18:33:01,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 18:33:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:01,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 18:33:01,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2025-03-03 18:33:01,515 INFO L87 Difference]: Start difference. First operand 2242 states and 3237 transitions. Second operand has 25 states, 25 states have (on average 6.6) internal successors, (165), 25 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:33:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:03,212 INFO L93 Difference]: Finished difference Result 4472 states and 6452 transitions. [2025-03-03 18:33:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 18:33:03,212 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.6) internal successors, (165), 25 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-03 18:33:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:03,215 INFO L225 Difference]: With dead ends: 4472 [2025-03-03 18:33:03,215 INFO L226 Difference]: Without dead ends: 2286 [2025-03-03 18:33:03,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2025-03-03 18:33:03,217 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 103 mSDsluCounter, 19683 mSDsCounter, 0 mSdLazyCounter, 5314 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 20541 SdHoareTripleChecker+Invalid, 5328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:03,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 20541 Invalid, 5328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5314 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 18:33:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-03-03 18:33:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2258. [2025-03-03 18:33:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 1.4448382809038547) internal successors, (3261), 2257 states have internal predecessors, (3261), 0 states have call successors, (0), 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-03 18:33:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3261 transitions. [2025-03-03 18:33:03,234 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3261 transitions. Word has length 165 [2025-03-03 18:33:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:03,234 INFO L471 AbstractCegarLoop]: Abstraction has 2258 states and 3261 transitions. [2025-03-03 18:33:03,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.6) internal successors, (165), 25 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:33:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3261 transitions. [2025-03-03 18:33:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 18:33:03,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:03,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 18:33:03,236 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1418821391, now seen corresponding path program 1 times [2025-03-03 18:33:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193777572] [2025-03-03 18:33:03,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:03,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 18:33:03,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 18:33:03,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:03,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:03,589 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-03 18:33:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193777572] [2025-03-03 18:33:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193777572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:03,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:33:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462470576] [2025-03-03 18:33:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:03,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:33:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:03,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:33:03,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:03,591 INFO L87 Difference]: Start difference. First operand 2258 states and 3261 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:33:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:03,919 INFO L93 Difference]: Finished difference Result 4508 states and 6504 transitions. [2025-03-03 18:33:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:33:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-03 18:33:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:03,922 INFO L225 Difference]: With dead ends: 4508 [2025-03-03 18:33:03,922 INFO L226 Difference]: Without dead ends: 2306 [2025-03-03 18:33:03,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:03,924 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1050 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:03,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 3477 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-03 18:33:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2254. [2025-03-03 18:33:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.4456280514869064) internal successors, (3257), 2253 states have internal predecessors, (3257), 0 states have call successors, (0), 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-03 18:33:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3257 transitions. [2025-03-03 18:33:03,942 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3257 transitions. Word has length 165 [2025-03-03 18:33:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:03,942 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3257 transitions. [2025-03-03 18:33:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 18:33:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3257 transitions. [2025-03-03 18:33:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 18:33:03,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:03,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:03,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 18:33:03,944 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:03,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 439359966, now seen corresponding path program 1 times [2025-03-03 18:33:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501625767] [2025-03-03 18:33:03,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:03,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 18:33:04,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 18:33:04,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:04,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:04,281 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-03 18:33:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501625767] [2025-03-03 18:33:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501625767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:04,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159148995] [2025-03-03 18:33:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:04,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:04,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:04,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:04,283 INFO L87 Difference]: Start difference. First operand 2254 states and 3257 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:04,875 INFO L93 Difference]: Finished difference Result 5407 states and 7799 transitions. [2025-03-03 18:33:04,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:04,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 18:33:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:04,881 INFO L225 Difference]: With dead ends: 5407 [2025-03-03 18:33:04,881 INFO L226 Difference]: Without dead ends: 3209 [2025-03-03 18:33:04,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 18:33:04,885 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1883 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1883 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:04,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1883 Valid, 2026 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:33:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2025-03-03 18:33:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2281. [2025-03-03 18:33:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2280 states have (on average 1.4451754385964912) internal successors, (3295), 2280 states have internal predecessors, (3295), 0 states have call successors, (0), 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-03 18:33:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3295 transitions. [2025-03-03 18:33:04,909 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3295 transitions. Word has length 166 [2025-03-03 18:33:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:04,909 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 3295 transitions. [2025-03-03 18:33:04,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3295 transitions. [2025-03-03 18:33:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 18:33:04,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:04,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 18:33:04,911 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:04,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash 306529904, now seen corresponding path program 1 times [2025-03-03 18:33:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608040036] [2025-03-03 18:33:04,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:04,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 18:33:05,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 18:33:05,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:05,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:05,336 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-03 18:33:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608040036] [2025-03-03 18:33:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608040036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467626109] [2025-03-03 18:33:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:05,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:05,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:05,338 INFO L87 Difference]: Start difference. First operand 2281 states and 3295 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:05,612 INFO L93 Difference]: Finished difference Result 4543 states and 6562 transitions. [2025-03-03 18:33:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 18:33:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:05,615 INFO L225 Difference]: With dead ends: 4543 [2025-03-03 18:33:05,615 INFO L226 Difference]: Without dead ends: 2345 [2025-03-03 18:33:05,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:05,617 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 965 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:05,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 2607 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2025-03-03 18:33:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2025-03-03 18:33:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2344 states have (on average 1.4381399317406143) internal successors, (3371), 2344 states have internal predecessors, (3371), 0 states have call successors, (0), 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-03 18:33:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3371 transitions. [2025-03-03 18:33:05,632 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3371 transitions. Word has length 166 [2025-03-03 18:33:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:05,632 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 3371 transitions. [2025-03-03 18:33:05,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3371 transitions. [2025-03-03 18:33:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 18:33:05,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:05,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:05,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 18:33:05,634 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2009773774, now seen corresponding path program 1 times [2025-03-03 18:33:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687511648] [2025-03-03 18:33:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:05,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 18:33:05,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 18:33:05,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:05,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:06,170 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-03 18:33:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:06,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687511648] [2025-03-03 18:33:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687511648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:06,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:33:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044209843] [2025-03-03 18:33:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:06,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:33:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:06,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:33:06,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:33:06,171 INFO L87 Difference]: Start difference. First operand 2345 states and 3371 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:06,672 INFO L93 Difference]: Finished difference Result 4671 states and 6718 transitions. [2025-03-03 18:33:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:33:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 18:33:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:06,675 INFO L225 Difference]: With dead ends: 4671 [2025-03-03 18:33:06,675 INFO L226 Difference]: Without dead ends: 2409 [2025-03-03 18:33:06,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:33:06,677 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 15 mSDsluCounter, 6246 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7145 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:06,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7145 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:33:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-03-03 18:33:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2163. [2025-03-03 18:33:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.435245143385754) internal successors, (3103), 2162 states have internal predecessors, (3103), 0 states have call successors, (0), 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-03 18:33:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3103 transitions. [2025-03-03 18:33:06,693 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3103 transitions. Word has length 166 [2025-03-03 18:33:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:06,693 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 3103 transitions. [2025-03-03 18:33:06,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3103 transitions. [2025-03-03 18:33:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 18:33:06,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:06,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 18:33:06,695 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 405381578, now seen corresponding path program 1 times [2025-03-03 18:33:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003087524] [2025-03-03 18:33:06,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:06,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 18:33:06,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 18:33:06,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:06,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:07,092 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-03 18:33:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003087524] [2025-03-03 18:33:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003087524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:07,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:33:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211046608] [2025-03-03 18:33:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:33:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:07,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:33:07,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:07,093 INFO L87 Difference]: Start difference. First operand 2163 states and 3103 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:07,468 INFO L93 Difference]: Finished difference Result 4415 states and 6336 transitions. [2025-03-03 18:33:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:33:07,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 18:33:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:07,470 INFO L225 Difference]: With dead ends: 4415 [2025-03-03 18:33:07,470 INFO L226 Difference]: Without dead ends: 2335 [2025-03-03 18:33:07,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:07,472 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1031 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:07,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 3477 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2025-03-03 18:33:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2025-03-03 18:33:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.4323050556983719) internal successors, (3343), 2334 states have internal predecessors, (3343), 0 states have call successors, (0), 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-03 18:33:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3343 transitions. [2025-03-03 18:33:07,488 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3343 transitions. Word has length 166 [2025-03-03 18:33:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:07,488 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3343 transitions. [2025-03-03 18:33:07,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3343 transitions. [2025-03-03 18:33:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 18:33:07,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:07,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 18:33:07,489 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:07,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash 650965879, now seen corresponding path program 1 times [2025-03-03 18:33:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022092677] [2025-03-03 18:33:07,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:07,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 18:33:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 18:33:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:08,007 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-03 18:33:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:08,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022092677] [2025-03-03 18:33:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022092677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:33:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18870355] [2025-03-03 18:33:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:08,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:33:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:08,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:33:08,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:08,011 INFO L87 Difference]: Start difference. First operand 2335 states and 3343 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:08,315 INFO L93 Difference]: Finished difference Result 4613 states and 6608 transitions. [2025-03-03 18:33:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:33:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 18:33:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:08,317 INFO L225 Difference]: With dead ends: 4613 [2025-03-03 18:33:08,317 INFO L226 Difference]: Without dead ends: 2361 [2025-03-03 18:33:08,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:08,319 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:08,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4448 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-03 18:33:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2313. [2025-03-03 18:33:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2312 states have (on average 1.4338235294117647) internal successors, (3315), 2312 states have internal predecessors, (3315), 0 states have call successors, (0), 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-03 18:33:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3315 transitions. [2025-03-03 18:33:08,337 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3315 transitions. Word has length 166 [2025-03-03 18:33:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:08,337 INFO L471 AbstractCegarLoop]: Abstraction has 2313 states and 3315 transitions. [2025-03-03 18:33:08,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3315 transitions. [2025-03-03 18:33:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 18:33:08,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:08,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:08,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 18:33:08,339 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:08,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:08,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1046530097, now seen corresponding path program 1 times [2025-03-03 18:33:08,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:08,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243341159] [2025-03-03 18:33:08,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 18:33:08,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 18:33:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:08,975 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-03 18:33:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243341159] [2025-03-03 18:33:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243341159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:33:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732894109] [2025-03-03 18:33:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:08,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:33:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:08,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:33:08,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:33:08,977 INFO L87 Difference]: Start difference. First operand 2313 states and 3315 transitions. Second operand has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:09,961 INFO L93 Difference]: Finished difference Result 4913 states and 7042 transitions. [2025-03-03 18:33:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 18:33:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 18:33:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:09,964 INFO L225 Difference]: With dead ends: 4913 [2025-03-03 18:33:09,964 INFO L226 Difference]: Without dead ends: 2683 [2025-03-03 18:33:09,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:33:09,966 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 41 mSDsluCounter, 12690 mSDsCounter, 0 mSdLazyCounter, 3185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 13602 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:09,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 13602 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3185 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:33:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2025-03-03 18:33:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2655. [2025-03-03 18:33:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 1.437452901281085) internal successors, (3815), 2654 states have internal predecessors, (3815), 0 states have call successors, (0), 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-03 18:33:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3815 transitions. [2025-03-03 18:33:09,985 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3815 transitions. Word has length 166 [2025-03-03 18:33:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:09,985 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 3815 transitions. [2025-03-03 18:33:09,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:33:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3815 transitions. [2025-03-03 18:33:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 18:33:09,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:09,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:09,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 18:33:09,987 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:09,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1378247954, now seen corresponding path program 1 times [2025-03-03 18:33:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040684446] [2025-03-03 18:33:09,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:10,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 18:33:10,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 18:33:10,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:10,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:10,576 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-03 18:33:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040684446] [2025-03-03 18:33:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040684446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:10,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:33:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660604162] [2025-03-03 18:33:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:10,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:33:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:10,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:33:10,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:33:10,577 INFO L87 Difference]: Start difference. First operand 2655 states and 3815 transitions. Second operand has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:11,345 INFO L93 Difference]: Finished difference Result 5287 states and 7598 transitions. [2025-03-03 18:33:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:33:11,346 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 18:33:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:11,348 INFO L225 Difference]: With dead ends: 5287 [2025-03-03 18:33:11,348 INFO L226 Difference]: Without dead ends: 2715 [2025-03-03 18:33:11,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:33:11,350 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 46 mSDsluCounter, 9671 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 10553 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:11,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 10553 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:33:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-03-03 18:33:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2675. [2025-03-03 18:33:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2674 states have (on average 1.4386686611817503) internal successors, (3847), 2674 states have internal predecessors, (3847), 0 states have call successors, (0), 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-03 18:33:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3847 transitions. [2025-03-03 18:33:11,366 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3847 transitions. Word has length 167 [2025-03-03 18:33:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:11,366 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 3847 transitions. [2025-03-03 18:33:11,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3847 transitions. [2025-03-03 18:33:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 18:33:11,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:11,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:11,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 18:33:11,368 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:11,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash -353955768, now seen corresponding path program 1 times [2025-03-03 18:33:11,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:11,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065225607] [2025-03-03 18:33:11,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:11,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 18:33:11,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 18:33:11,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:33:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065225607] [2025-03-03 18:33:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065225607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:33:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748745808] [2025-03-03 18:33:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:11,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:33:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:11,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:33:11,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:11,766 INFO L87 Difference]: Start difference. First operand 2675 states and 3847 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:12,074 INFO L93 Difference]: Finished difference Result 5183 states and 7446 transitions. [2025-03-03 18:33:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:33:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 18:33:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:12,077 INFO L225 Difference]: With dead ends: 5183 [2025-03-03 18:33:12,077 INFO L226 Difference]: Without dead ends: 2591 [2025-03-03 18:33:12,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:33:12,079 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1022 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:12,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 3482 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-03 18:33:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2591. [2025-03-03 18:33:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 2590 states have (on average 1.4320463320463321) internal successors, (3709), 2590 states have internal predecessors, (3709), 0 states have call successors, (0), 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-03 18:33:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3709 transitions. [2025-03-03 18:33:12,094 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3709 transitions. Word has length 167 [2025-03-03 18:33:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:12,095 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 3709 transitions. [2025-03-03 18:33:12,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3709 transitions. [2025-03-03 18:33:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 18:33:12,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:12,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:12,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 18:33:12,096 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:12,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2082273093, now seen corresponding path program 1 times [2025-03-03 18:33:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733919459] [2025-03-03 18:33:12,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 18:33:12,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 18:33:12,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:12,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:12,509 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-03 18:33:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:12,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733919459] [2025-03-03 18:33:12,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733919459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:12,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:12,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399750487] [2025-03-03 18:33:12,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:12,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:12,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:12,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:12,510 INFO L87 Difference]: Start difference. First operand 2591 states and 3709 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:12,770 INFO L93 Difference]: Finished difference Result 5125 states and 7334 transitions. [2025-03-03 18:33:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 18:33:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:12,773 INFO L225 Difference]: With dead ends: 5125 [2025-03-03 18:33:12,773 INFO L226 Difference]: Without dead ends: 2617 [2025-03-03 18:33:12,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:12,775 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 941 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:12,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 2607 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:33:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2025-03-03 18:33:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2617. [2025-03-03 18:33:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2616 states have (on average 1.4292813455657492) internal successors, (3739), 2616 states have internal predecessors, (3739), 0 states have call successors, (0), 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-03 18:33:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 3739 transitions. [2025-03-03 18:33:12,793 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 3739 transitions. Word has length 167 [2025-03-03 18:33:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:12,793 INFO L471 AbstractCegarLoop]: Abstraction has 2617 states and 3739 transitions. [2025-03-03 18:33:12,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3739 transitions. [2025-03-03 18:33:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 18:33:12,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 18:33:12,795 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 865685584, now seen corresponding path program 1 times [2025-03-03 18:33:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997659080] [2025-03-03 18:33:12,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:12,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 18:33:12,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 18:33:12,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:12,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:13,275 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-03 18:33:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997659080] [2025-03-03 18:33:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997659080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:13,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:33:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249082408] [2025-03-03 18:33:13,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:13,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:33:13,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:13,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:33:13,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:33:13,276 INFO L87 Difference]: Start difference. First operand 2617 states and 3739 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:13,915 INFO L93 Difference]: Finished difference Result 5033 states and 7184 transitions. [2025-03-03 18:33:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:33:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-03-03 18:33:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:13,917 INFO L225 Difference]: With dead ends: 5033 [2025-03-03 18:33:13,917 INFO L226 Difference]: Without dead ends: 2499 [2025-03-03 18:33:13,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:33:13,919 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 12 mSDsluCounter, 7958 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8845 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:13,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8845 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:33:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-03-03 18:33:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2493. [2025-03-03 18:33:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2492 states have (on average 1.4273675762439808) internal successors, (3557), 2492 states have internal predecessors, (3557), 0 states have call successors, (0), 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-03 18:33:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3557 transitions. [2025-03-03 18:33:13,935 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3557 transitions. Word has length 167 [2025-03-03 18:33:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 3557 transitions. [2025-03-03 18:33:13,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 18:33:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3557 transitions. [2025-03-03 18:33:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 18:33:13,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:13,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:13,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 18:33:13,936 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 34997129, now seen corresponding path program 1 times [2025-03-03 18:33:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723175152] [2025-03-03 18:33:13,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:13,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 18:33:14,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 18:33:14,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:14,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:14,269 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-03 18:33:14,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:14,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723175152] [2025-03-03 18:33:14,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723175152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:14,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:14,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639547818] [2025-03-03 18:33:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:14,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:14,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:14,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:14,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:14,270 INFO L87 Difference]: Start difference. First operand 2493 states and 3557 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 18:33:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:14,854 INFO L93 Difference]: Finished difference Result 5904 states and 8403 transitions. [2025-03-03 18:33:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-03 18:33:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:14,857 INFO L225 Difference]: With dead ends: 5904 [2025-03-03 18:33:14,857 INFO L226 Difference]: Without dead ends: 3494 [2025-03-03 18:33:14,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 18:33:14,859 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1777 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:14,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 2038 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:33:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2025-03-03 18:33:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 2500. [2025-03-03 18:33:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.4269707883153262) internal successors, (3566), 2499 states have internal predecessors, (3566), 0 states have call successors, (0), 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-03 18:33:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3566 transitions. [2025-03-03 18:33:14,879 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3566 transitions. Word has length 168 [2025-03-03 18:33:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:14,879 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3566 transitions. [2025-03-03 18:33:14,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 18:33:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3566 transitions. [2025-03-03 18:33:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 18:33:14,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:14,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 18:33:14,881 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:14,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:14,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1275606163, now seen corresponding path program 1 times [2025-03-03 18:33:14,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:14,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655760557] [2025-03-03 18:33:14,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:14,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:14,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 18:33:14,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 18:33:14,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:14,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:15,755 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-03 18:33:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:15,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655760557] [2025-03-03 18:33:15,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655760557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:15,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:15,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:33:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61377126] [2025-03-03 18:33:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:33:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:15,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:33:15,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:33:15,756 INFO L87 Difference]: Start difference. First operand 2500 states and 3566 transitions. Second operand has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 18:33:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:16,813 INFO L93 Difference]: Finished difference Result 5042 states and 7191 transitions. [2025-03-03 18:33:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:33:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-03 18:33:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:16,815 INFO L225 Difference]: With dead ends: 5042 [2025-03-03 18:33:16,815 INFO L226 Difference]: Without dead ends: 2632 [2025-03-03 18:33:16,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:33:16,817 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 33 mSDsluCounter, 13205 mSDsCounter, 0 mSdLazyCounter, 3298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 14091 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:16,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 14091 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3298 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 18:33:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2025-03-03 18:33:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2592. [2025-03-03 18:33:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 1.4303357776920107) internal successors, (3706), 2591 states have internal predecessors, (3706), 0 states have call successors, (0), 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-03 18:33:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3706 transitions. [2025-03-03 18:33:16,832 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3706 transitions. Word has length 168 [2025-03-03 18:33:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:16,832 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 3706 transitions. [2025-03-03 18:33:16,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 18:33:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3706 transitions. [2025-03-03 18:33:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 18:33:16,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:16,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:16,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 18:33:16,833 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:16,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1788396323, now seen corresponding path program 1 times [2025-03-03 18:33:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786288193] [2025-03-03 18:33:16,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:16,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 18:33:16,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 18:33:16,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:16,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:17,220 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-03 18:33:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786288193] [2025-03-03 18:33:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786288193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:33:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779237987] [2025-03-03 18:33:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:33:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:33:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:17,221 INFO L87 Difference]: Start difference. First operand 2592 states and 3706 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 18:33:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:17,642 INFO L93 Difference]: Finished difference Result 5142 states and 7355 transitions. [2025-03-03 18:33:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:33:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-03-03 18:33:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:17,645 INFO L225 Difference]: With dead ends: 5142 [2025-03-03 18:33:17,645 INFO L226 Difference]: Without dead ends: 2640 [2025-03-03 18:33:17,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:33:17,646 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 999 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:17,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 4351 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:33:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2025-03-03 18:33:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2640. [2025-03-03 18:33:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.427055702917772) internal successors, (3766), 2639 states have internal predecessors, (3766), 0 states have call successors, (0), 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-03 18:33:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3766 transitions. [2025-03-03 18:33:17,661 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3766 transitions. Word has length 168 [2025-03-03 18:33:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 2640 states and 3766 transitions. [2025-03-03 18:33:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 18:33:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3766 transitions. [2025-03-03 18:33:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 18:33:17,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:17,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:17,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 18:33:17,663 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:17,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash 908561702, now seen corresponding path program 1 times [2025-03-03 18:33:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240298045] [2025-03-03 18:33:17,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:17,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:17,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:33:17,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:33:17,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:17,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:18,082 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-03 18:33:18,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240298045] [2025-03-03 18:33:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240298045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418583362] [2025-03-03 18:33:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:18,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:18,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:18,083 INFO L87 Difference]: Start difference. First operand 2640 states and 3766 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 18:33:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:18,343 INFO L93 Difference]: Finished difference Result 5258 states and 7503 transitions. [2025-03-03 18:33:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-03 18:33:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:18,345 INFO L225 Difference]: With dead ends: 5258 [2025-03-03 18:33:18,345 INFO L226 Difference]: Without dead ends: 2708 [2025-03-03 18:33:18,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:33:18,347 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 985 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:18,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2602 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:33:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2025-03-03 18:33:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2025-03-03 18:33:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2707 states have (on average 1.4207609900258589) internal successors, (3846), 2707 states have internal predecessors, (3846), 0 states have call successors, (0), 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-03 18:33:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3846 transitions. [2025-03-03 18:33:18,363 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3846 transitions. Word has length 169 [2025-03-03 18:33:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:18,364 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3846 transitions. [2025-03-03 18:33:18,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 18:33:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3846 transitions. [2025-03-03 18:33:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 18:33:18,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:18,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:18,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 18:33:18,365 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:18,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1798793179, now seen corresponding path program 1 times [2025-03-03 18:33:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171983691] [2025-03-03 18:33:18,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:18,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:18,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:33:18,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:33:18,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:18,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:19,918 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-03 18:33:19,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:19,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171983691] [2025-03-03 18:33:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171983691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:19,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-03 18:33:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952774118] [2025-03-03 18:33:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:19,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 18:33:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:19,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 18:33:19,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2025-03-03 18:33:19,919 INFO L87 Difference]: Start difference. First operand 2708 states and 3846 transitions. Second operand has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 18:33:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:22,500 INFO L93 Difference]: Finished difference Result 5613 states and 7963 transitions. [2025-03-03 18:33:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 18:33:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-03 18:33:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:22,503 INFO L225 Difference]: With dead ends: 5613 [2025-03-03 18:33:22,503 INFO L226 Difference]: Without dead ends: 2995 [2025-03-03 18:33:22,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1984, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 18:33:22,505 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1421 mSDsluCounter, 20033 mSDsCounter, 0 mSdLazyCounter, 6075 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 20869 SdHoareTripleChecker+Invalid, 6091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:22,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 20869 Invalid, 6091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 6075 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 18:33:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2025-03-03 18:33:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2982. [2025-03-03 18:33:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2981 states have (on average 1.4196578329419658) internal successors, (4232), 2981 states have internal predecessors, (4232), 0 states have call successors, (0), 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-03 18:33:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 4232 transitions. [2025-03-03 18:33:22,533 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 4232 transitions. Word has length 169 [2025-03-03 18:33:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:22,533 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 4232 transitions. [2025-03-03 18:33:22,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 18:33:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 4232 transitions. [2025-03-03 18:33:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 18:33:22,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:22,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:22,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 18:33:22,535 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:22,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash 523885779, now seen corresponding path program 1 times [2025-03-03 18:33:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:22,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641588271] [2025-03-03 18:33:22,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:22,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:33:22,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:33:22,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:22,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:22,978 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-03 18:33:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641588271] [2025-03-03 18:33:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641588271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:22,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:22,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:22,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632174175] [2025-03-03 18:33:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:22,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:22,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:22,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:22,979 INFO L87 Difference]: Start difference. First operand 2982 states and 4232 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 18:33:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:23,520 INFO L93 Difference]: Finished difference Result 6837 states and 9680 transitions. [2025-03-03 18:33:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-03 18:33:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:23,524 INFO L225 Difference]: With dead ends: 6837 [2025-03-03 18:33:23,524 INFO L226 Difference]: Without dead ends: 3945 [2025-03-03 18:33:23,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 18:33:23,526 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1715 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:23,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 2038 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:33:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-03 18:33:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3347. [2025-03-03 18:33:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3346 states have (on average 1.4178123132098028) internal successors, (4744), 3346 states have internal predecessors, (4744), 0 states have call successors, (0), 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-03 18:33:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4744 transitions. [2025-03-03 18:33:23,550 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4744 transitions. Word has length 169 [2025-03-03 18:33:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:23,551 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 4744 transitions. [2025-03-03 18:33:23,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 18:33:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4744 transitions. [2025-03-03 18:33:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:33:23,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:23,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:23,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 18:33:23,552 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:23,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 328079472, now seen corresponding path program 1 times [2025-03-03 18:33:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530880464] [2025-03-03 18:33:23,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:23,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:33:23,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:33:23,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:23,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:24,488 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-03 18:33:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:24,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530880464] [2025-03-03 18:33:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530880464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:33:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106376253] [2025-03-03 18:33:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:24,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:33:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:24,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:33:24,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:33:24,490 INFO L87 Difference]: Start difference. First operand 3347 states and 4744 transitions. Second operand has 20 states, 20 states have (on average 8.5) internal successors, (170), 20 states have internal predecessors, (170), 0 states have call successors, (0), 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-03 18:33:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:25,918 INFO L93 Difference]: Finished difference Result 6239 states and 8839 transitions. [2025-03-03 18:33:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:33:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.5) internal successors, (170), 20 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-03 18:33:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:25,921 INFO L225 Difference]: With dead ends: 6239 [2025-03-03 18:33:25,921 INFO L226 Difference]: Without dead ends: 3347 [2025-03-03 18:33:25,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:33:25,928 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 74 mSDsluCounter, 15617 mSDsCounter, 0 mSdLazyCounter, 3979 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 16487 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:25,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 16487 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3979 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 18:33:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2025-03-03 18:33:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3317. [2025-03-03 18:33:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.416767189384801) internal successors, (4698), 3316 states have internal predecessors, (4698), 0 states have call successors, (0), 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-03 18:33:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4698 transitions. [2025-03-03 18:33:25,952 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4698 transitions. Word has length 170 [2025-03-03 18:33:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:25,952 INFO L471 AbstractCegarLoop]: Abstraction has 3317 states and 4698 transitions. [2025-03-03 18:33:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.5) internal successors, (170), 20 states have internal predecessors, (170), 0 states have call successors, (0), 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-03 18:33:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4698 transitions. [2025-03-03 18:33:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:33:25,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:25,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 18:33:25,954 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash 505358662, now seen corresponding path program 1 times [2025-03-03 18:33:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184450983] [2025-03-03 18:33:25,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:25,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:33:26,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:33:26,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:26,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:26,732 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-03 18:33:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:26,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184450983] [2025-03-03 18:33:26,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184450983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:26,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:26,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:33:26,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951868838] [2025-03-03 18:33:26,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:26,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:33:26,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:26,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:33:26,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:33:26,733 INFO L87 Difference]: Start difference. First operand 3317 states and 4698 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 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-03 18:33:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:27,097 INFO L93 Difference]: Finished difference Result 6581 states and 9321 transitions. [2025-03-03 18:33:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:33:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-03 18:33:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:27,100 INFO L225 Difference]: With dead ends: 6581 [2025-03-03 18:33:27,100 INFO L226 Difference]: Without dead ends: 3338 [2025-03-03 18:33:27,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:33:27,102 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 1049 mSDsluCounter, 3542 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:27,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 4433 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-03-03 18:33:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3335. [2025-03-03 18:33:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 3334 states have (on average 1.4154169166166766) internal successors, (4719), 3334 states have internal predecessors, (4719), 0 states have call successors, (0), 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-03 18:33:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4719 transitions. [2025-03-03 18:33:27,125 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4719 transitions. Word has length 170 [2025-03-03 18:33:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 3335 states and 4719 transitions. [2025-03-03 18:33:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 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-03 18:33:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4719 transitions. [2025-03-03 18:33:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 18:33:27,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:27,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:27,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 18:33:27,126 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 235934531, now seen corresponding path program 1 times [2025-03-03 18:33:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:27,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260314360] [2025-03-03 18:33:27,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:27,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 18:33:27,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 18:33:27,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:27,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:27,423 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-03 18:33:27,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:33:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260314360] [2025-03-03 18:33:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260314360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:27,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:27,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:33:27,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742198774] [2025-03-03 18:33:27,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:27,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:33:27,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:33:27,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:33:27,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:27,424 INFO L87 Difference]: Start difference. First operand 3335 states and 4719 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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-03 18:33:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:27,804 INFO L93 Difference]: Finished difference Result 7294 states and 10310 transitions. [2025-03-03 18:33:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:33:27,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-03 18:33:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:27,809 INFO L225 Difference]: With dead ends: 7294 [2025-03-03 18:33:27,809 INFO L226 Difference]: Without dead ends: 4033 [2025-03-03 18:33:27,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03 18:33:27,811 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 2098 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:27,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 2545 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:33:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2025-03-03 18:33:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 3330. [2025-03-03 18:33:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 3329 states have (on average 1.414839291078402) internal successors, (4710), 3329 states have internal predecessors, (4710), 0 states have call successors, (0), 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-03 18:33:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 4710 transitions. [2025-03-03 18:33:27,831 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 4710 transitions. Word has length 171 [2025-03-03 18:33:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:27,831 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 4710 transitions. [2025-03-03 18:33:27,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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-03 18:33:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 4710 transitions. [2025-03-03 18:33:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 18:33:27,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:27,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:27,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 18:33:27,832 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:27,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1784526067, now seen corresponding path program 1 times [2025-03-03 18:33:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438529306] [2025-03-03 18:33:27,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:27,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 18:33:27,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 18:33:27,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:27,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:33:27,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:33:28,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 18:33:28,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 18:33:28,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:28,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:33:28,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:33:28,234 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:33:28,235 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:33:28,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 18:33:28,239 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:33:28,307 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:33:28,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:33:28,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:33:28 BoogieIcfgContainer [2025-03-03 18:33:28,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:33:28,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:33:28,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:33:28,337 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:33:28,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:26" (3/4) ... [2025-03-03 18:33:28,339 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:33:28,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:33:28,340 INFO L158 Benchmark]: Toolchain (without parser) took 65286.72ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 104.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2025-03-03 18:33:28,340 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:28,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.98ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 50.0MB in the end (delta: 53.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 18:33:28,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 209.23ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 46.9MB in the end (delta: 3.1MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-03-03 18:33:28,342 INFO L158 Benchmark]: Boogie Preprocessor took 259.28ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 46.5MB in the end (delta: 358.5kB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 18:33:28,342 INFO L158 Benchmark]: IcfgBuilder took 2477.44ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 46.5MB in the beginning and 193.3MB in the end (delta: -146.8MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. [2025-03-03 18:33:28,342 INFO L158 Benchmark]: TraceAbstraction took 61855.11ms. Allocated memory was 310.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 193.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 189.7MB. Max. memory is 16.1GB. [2025-03-03 18:33:28,342 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 145.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:28,343 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.98ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 50.0MB in the end (delta: 53.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 209.23ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 46.9MB in the end (delta: 3.1MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 259.28ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 46.5MB in the end (delta: 358.5kB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2477.44ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 46.5MB in the beginning and 193.3MB in the end (delta: -146.8MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. * TraceAbstraction took 61855.11ms. Allocated memory was 310.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 193.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 189.7MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 145.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 423, overapproximation of bitwiseAnd at line 308, overapproximation of bitwiseAnd at line 402, overapproximation of bitwiseAnd at line 355, overapproximation of bitwiseAnd at line 232, overapproximation of bitwiseAnd at line 261, overapproximation of bitwiseAnd at line 428. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 2); [L39] const SORT_24 msb_SORT_24 = (SORT_24)1 << (2 - 1); [L41] const SORT_181 mask_SORT_181 = (SORT_181)-1 >> (sizeof(SORT_181) * 8 - 4); [L42] const SORT_181 msb_SORT_181 = (SORT_181)1 << (4 - 1); [L44] const SORT_229 mask_SORT_229 = (SORT_229)-1 >> (sizeof(SORT_229) * 8 - 32); [L45] const SORT_229 msb_SORT_229 = (SORT_229)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 2; [L50] const SORT_10 var_18 = 0; [L51] const SORT_1 var_22 = 1; [L52] const SORT_24 var_26 = 0; [L53] const SORT_24 var_29 = 3; [L54] const SORT_3 var_34 = 0; [L55] const SORT_1 var_50 = 0; [L56] const SORT_10 var_146 = 1; [L57] const SORT_10 var_151 = 4; [L58] const SORT_10 var_153 = 5; [L59] const SORT_10 var_197 = 7; [L60] const SORT_10 var_202 = 6; [L61] const SORT_229 var_231 = 0; [L62] const SORT_3 var_246 = 2; [L63] const SORT_3 var_268 = 31; [L65] SORT_1 input_2; [L66] SORT_3 input_4; [L67] SORT_5 input_6; [L68] SORT_3 input_257; [L69] SORT_3 input_258; [L70] SORT_3 input_259; [L71] SORT_3 input_267; [L72] SORT_3 input_277; [L73] SORT_3 input_278; [L74] SORT_3 input_279; [L75] SORT_3 input_282; [L76] SORT_3 input_301; [L77] SORT_3 input_302; [L78] SORT_3 input_303; [L79] SORT_3 input_306; [L80] SORT_3 input_308; [L81] SORT_24 input_322; [L82] SORT_24 input_323; [L83] SORT_24 input_324; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L85] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L86] SORT_10 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L87] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L89] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L90] SORT_1 state_127 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L91] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L92] SORT_3 state_131 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L93] SORT_3 state_133 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L94] SORT_3 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L95] SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L96] SORT_3 state_139 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L97] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L99] SORT_5 init_9_arg_1 = var_7; [L100] state_8 = init_9_arg_1 [L101] SORT_10 init_20_arg_1 = var_18; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_36_arg_1 = var_34; [L104] state_35 = init_36_arg_1 [L105] SORT_3 init_40_arg_1 = var_34; [L106] state_39 = init_40_arg_1 [L107] SORT_3 init_46_arg_1 = var_34; [L108] state_45 = init_46_arg_1 [L109] SORT_1 init_128_arg_1 = var_50; [L110] state_127 = init_128_arg_1 [L111] SORT_3 init_130_arg_1 = var_34; [L112] state_129 = init_130_arg_1 [L113] SORT_3 init_132_arg_1 = var_34; [L114] state_131 = init_132_arg_1 [L115] SORT_3 init_134_arg_1 = var_34; [L116] state_133 = init_134_arg_1 [L117] SORT_3 init_136_arg_1 = var_34; [L118] state_135 = init_136_arg_1 [L119] SORT_3 init_138_arg_1 = var_34; [L120] state_137 = init_138_arg_1 [L121] SORT_3 init_140_arg_1 = var_34; [L122] state_139 = init_140_arg_1 [L123] SORT_3 init_142_arg_1 = var_34; [L124] state_141 = init_142_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_ushort() [L130] input_257 = __VERIFIER_nondet_uchar() [L131] input_258 = __VERIFIER_nondet_uchar() [L132] input_259 = __VERIFIER_nondet_uchar() [L133] input_267 = __VERIFIER_nondet_uchar() [L134] input_277 = __VERIFIER_nondet_uchar() [L135] input_278 = __VERIFIER_nondet_uchar() [L136] input_279 = __VERIFIER_nondet_uchar() [L137] input_282 = __VERIFIER_nondet_uchar() [L138] input_301 = __VERIFIER_nondet_uchar() [L139] input_302 = __VERIFIER_nondet_uchar() [L140] input_303 = __VERIFIER_nondet_uchar() [L141] input_306 = __VERIFIER_nondet_uchar() [L142] input_308 = __VERIFIER_nondet_uchar() [L143] input_322 = __VERIFIER_nondet_uchar() [L144] input_323 = __VERIFIER_nondet_uchar() [L145] input_324 = __VERIFIER_nondet_uchar() [L148] SORT_5 var_11_arg_0 = state_8; [L149] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L150] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L150] var_11 = var_11 & mask_SORT_10 [L151] SORT_10 var_13_arg_0 = var_11; [L152] SORT_10 var_13_arg_1 = var_12; [L153] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L154] SORT_5 var_14_arg_0 = state_8; [L155] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L156] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L156] var_14 = var_14 & mask_SORT_10 [L157] SORT_10 var_16_arg_0 = var_14; [L158] SORT_10 var_16_arg_1 = var_15; [L159] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L160] SORT_1 var_17_arg_0 = var_13; [L161] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17_arg_0=0, var_17_arg_1=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L162] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L162] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L163] SORT_10 var_21_arg_0 = state_19; [L164] SORT_1 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_21=0, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L165] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L165] var_21 = var_21 & mask_SORT_1 [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; [L168] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L169] SORT_10 var_25_arg_0 = state_19; [L170] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_23=0, var_246=2, var_25=0, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L171] EXPR var_25 & mask_SORT_24 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_23=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L171] var_25 = var_25 & mask_SORT_24 [L172] SORT_24 var_27_arg_0 = var_25; [L173] SORT_24 var_27_arg_1 = var_26; [L174] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L175] SORT_1 var_28_arg_0 = var_23; [L176] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_25=0, var_268=31, var_26=0, var_28_arg_0=0, var_28_arg_1=1, var_29=3, var_34=0, var_50=0] [L177] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_25=0, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L177] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L178] SORT_24 var_30_arg_0 = var_25; [L179] SORT_24 var_30_arg_1 = var_29; [L180] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L181] SORT_1 var_31_arg_0 = var_28; [L182] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_31_arg_0=1, var_31_arg_1=0, var_34=0, var_50=0] [L183] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L183] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L184] SORT_1 var_32_arg_0 = var_17; [L185] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_32_arg_0=0, var_32_arg_1=1, var_34=0, var_50=0] [L186] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L186] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L187] SORT_1 var_33_arg_0 = var_32; [L188] SORT_1 var_33 = ~var_33_arg_0; [L189] SORT_3 var_37_arg_0 = state_35; [L190] SORT_1 var_37 = var_37_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_50=0] [L191] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L191] var_37 = var_37 & mask_SORT_1 [L192] SORT_1 var_38_arg_0 = var_37; [L193] SORT_1 var_38_arg_1 = var_22; [L194] SORT_1 var_38 = var_38_arg_0 == var_38_arg_1; [L195] SORT_3 var_41_arg_0 = state_39; [L196] SORT_1 var_41 = var_41_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_38=0, var_41=0, var_50=0] [L197] EXPR var_41 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_38=0, var_50=0] [L197] var_41 = var_41 & mask_SORT_1 [L198] SORT_1 var_42_arg_0 = var_41; [L199] SORT_1 var_42_arg_1 = var_22; [L200] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L201] SORT_1 var_43_arg_0 = var_38; [L202] SORT_1 var_43_arg_1 = var_42; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_43_arg_0=0, var_43_arg_1=0, var_50=0] [L203] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_50=0] [L203] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L204] SORT_1 var_44_arg_0 = var_43; [L205] SORT_1 var_44 = ~var_44_arg_0; [L206] SORT_3 var_47_arg_0 = state_45; [L207] SORT_1 var_47 = var_47_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_44=-1, var_47=0, var_50=0] [L208] EXPR var_47 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_44=-1, var_50=0] [L208] var_47 = var_47 & mask_SORT_1 [L209] SORT_1 var_48_arg_0 = var_47; [L210] SORT_1 var_48_arg_1 = var_22; [L211] SORT_1 var_48 = var_48_arg_0 == var_48_arg_1; [L212] SORT_1 var_49_arg_0 = var_44; [L213] SORT_1 var_49_arg_1 = var_48; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_47=0, var_49_arg_0=-1, var_49_arg_1=0, var_50=0] [L214] EXPR var_49_arg_0 | var_49_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_47=0, var_50=0] [L214] SORT_1 var_49 = var_49_arg_0 | var_49_arg_1; [L215] SORT_1 var_51_arg_0 = var_47; [L216] SORT_1 var_51_arg_1 = var_50; [L217] SORT_1 var_51 = var_51_arg_0 == var_51_arg_1; [L218] SORT_1 var_52_arg_0 = var_37; [L219] SORT_1 var_52_arg_1 = var_22; [L220] SORT_1 var_52 = var_52_arg_0 == var_52_arg_1; [L221] SORT_1 var_53_arg_0 = var_41; [L222] SORT_1 var_53_arg_1 = var_22; [L223] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L224] SORT_1 var_54_arg_0 = var_52; [L225] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_51=1, var_54_arg_0=0, var_54_arg_1=0] [L226] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_51=1] [L226] SORT_1 var_54 = var_54_arg_0 & var_54_arg_1; [L227] SORT_1 var_55_arg_0 = var_51; [L228] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_55_arg_0=1, var_55_arg_1=0] [L229] EXPR var_55_arg_0 | var_55_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0] [L229] SORT_1 var_55 = var_55_arg_0 | var_55_arg_1; [L230] SORT_1 var_56_arg_0 = var_49; [L231] SORT_1 var_56_arg_1 = var_55; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56_arg_0=255, var_56_arg_1=1] [L232] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L232] SORT_1 var_56 = var_56_arg_0 & var_56_arg_1; [L233] SORT_3 var_57_arg_0 = state_35; [L234] SORT_1 var_57 = var_57_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0] [L235] EXPR var_57 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1] [L235] var_57 = var_57 & mask_SORT_1 [L236] SORT_1 var_58_arg_0 = var_57; [L237] SORT_1 var_58_arg_1 = var_22; [L238] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L239] SORT_3 var_59_arg_0 = state_39; [L240] SORT_1 var_59 = var_59_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_58=0, var_59=0] [L241] EXPR var_59 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_58=0] [L241] var_59 = var_59 & mask_SORT_1 [L242] SORT_1 var_60_arg_0 = var_59; [L243] SORT_1 var_60_arg_1 = var_22; [L244] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L245] SORT_1 var_61_arg_0 = var_58; [L246] SORT_1 var_61_arg_1 = var_60; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_61_arg_0=0, var_61_arg_1=0] [L247] EXPR var_61_arg_0 & var_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0] [L247] SORT_1 var_61 = var_61_arg_0 & var_61_arg_1; [L248] SORT_1 var_62_arg_0 = var_61; [L249] SORT_1 var_62 = ~var_62_arg_0; [L250] SORT_3 var_63_arg_0 = state_45; [L251] SORT_1 var_63 = var_63_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_62=-1, var_63=0] [L252] EXPR var_63 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_62=-1] [L252] var_63 = var_63 & mask_SORT_1 [L253] SORT_1 var_64_arg_0 = var_63; [L254] SORT_1 var_64_arg_1 = var_22; [L255] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L256] SORT_1 var_65_arg_0 = var_62; [L257] SORT_1 var_65_arg_1 = var_64; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_63=0, var_65_arg_0=-1, var_65_arg_1=0] [L258] EXPR var_65_arg_0 | var_65_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_63=0] [L258] SORT_1 var_65 = var_65_arg_0 | var_65_arg_1; [L259] SORT_1 var_66_arg_0 = var_56; [L260] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_57=0, var_59=0, var_63=0, var_66_arg_0=1, var_66_arg_1=255] [L261] EXPR var_66_arg_0 & var_66_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_57=0, var_59=0, var_63=0] [L261] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L262] SORT_1 var_67_arg_0 = var_63; [L263] SORT_1 var_67_arg_1 = var_50; [L264] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L265] SORT_1 var_68_arg_0 = var_57; [L266] SORT_1 var_68_arg_1 = var_22; [L267] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L268] SORT_1 var_69_arg_0 = var_59; [L269] SORT_1 var_69_arg_1 = var_22; [L270] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L271] SORT_1 var_70_arg_0 = var_68; [L272] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_67=1, var_70_arg_0=0, var_70_arg_1=0] [L273] EXPR var_70_arg_0 & var_70_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_67=1] [L273] SORT_1 var_70 = var_70_arg_0 & var_70_arg_1; [L274] SORT_1 var_71_arg_0 = var_67; [L275] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_71_arg_0=1, var_71_arg_1=0] [L276] EXPR var_71_arg_0 | var_71_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1] [L276] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L277] SORT_1 var_72_arg_0 = var_66; [L278] SORT_1 var_72_arg_1 = var_71; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72_arg_0=1, var_72_arg_1=1] [L279] EXPR var_72_arg_0 & var_72_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L279] SORT_1 var_72 = var_72_arg_0 & var_72_arg_1; [L280] SORT_3 var_73_arg_0 = state_35; [L281] SORT_1 var_73 = var_73_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0] [L282] EXPR var_73 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1] [L282] var_73 = var_73 & mask_SORT_1 [L283] SORT_1 var_74_arg_0 = var_73; [L284] SORT_1 var_74_arg_1 = var_22; [L285] SORT_1 var_74 = var_74_arg_0 == var_74_arg_1; [L286] SORT_3 var_75_arg_0 = state_39; [L287] SORT_1 var_75 = var_75_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_74=0, var_75=0] [L288] EXPR var_75 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_74=0] [L288] var_75 = var_75 & mask_SORT_1 [L289] SORT_1 var_76_arg_0 = var_75; [L290] SORT_1 var_76_arg_1 = var_22; [L291] SORT_1 var_76 = var_76_arg_0 == var_76_arg_1; [L292] SORT_1 var_77_arg_0 = var_74; [L293] SORT_1 var_77_arg_1 = var_76; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_77_arg_0=0, var_77_arg_1=0] [L294] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0] [L294] SORT_1 var_77 = var_77_arg_0 & var_77_arg_1; [L295] SORT_1 var_78_arg_0 = var_77; [L296] SORT_1 var_78 = ~var_78_arg_0; [L297] SORT_3 var_79_arg_0 = state_45; [L298] SORT_1 var_79 = var_79_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_78=-1, var_79=0] [L299] EXPR var_79 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_78=-1] [L299] var_79 = var_79 & mask_SORT_1 [L300] SORT_1 var_80_arg_0 = var_79; [L301] SORT_1 var_80_arg_1 = var_22; [L302] SORT_1 var_80 = var_80_arg_0 == var_80_arg_1; [L303] SORT_1 var_81_arg_0 = var_78; [L304] SORT_1 var_81_arg_1 = var_80; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_79=0, var_81_arg_0=-1, var_81_arg_1=0] [L305] EXPR var_81_arg_0 | var_81_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_79=0] [L305] SORT_1 var_81 = var_81_arg_0 | var_81_arg_1; [L306] SORT_1 var_82_arg_0 = var_72; [L307] SORT_1 var_82_arg_1 = var_81; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_73=0, var_75=0, var_79=0, var_82_arg_0=1, var_82_arg_1=255] [L308] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_73=0, var_75=0, var_79=0] [L308] SORT_1 var_82 = var_82_arg_0 & var_82_arg_1; [L309] SORT_1 var_83_arg_0 = var_79; [L310] SORT_1 var_83_arg_1 = var_50; [L311] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L312] SORT_1 var_84_arg_0 = var_73; [L313] SORT_1 var_84_arg_1 = var_22; [L314] SORT_1 var_84 = var_84_arg_0 == var_84_arg_1; [L315] SORT_1 var_85_arg_0 = var_75; [L316] SORT_1 var_85_arg_1 = var_22; [L317] SORT_1 var_85 = var_85_arg_0 == var_85_arg_1; [L318] SORT_1 var_86_arg_0 = var_84; [L319] SORT_1 var_86_arg_1 = var_85; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_83=1, var_86_arg_0=0, var_86_arg_1=0] [L320] EXPR var_86_arg_0 & var_86_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_83=1] [L320] SORT_1 var_86 = var_86_arg_0 & var_86_arg_1; [L321] SORT_1 var_87_arg_0 = var_83; [L322] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_87_arg_0=1, var_87_arg_1=0] [L323] EXPR var_87_arg_0 | var_87_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1] [L323] SORT_1 var_87 = var_87_arg_0 | var_87_arg_1; [L324] SORT_1 var_88_arg_0 = var_82; [L325] SORT_1 var_88_arg_1 = var_87; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88_arg_0=1, var_88_arg_1=1] [L326] EXPR var_88_arg_0 & var_88_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L326] SORT_1 var_88 = var_88_arg_0 & var_88_arg_1; [L327] SORT_3 var_89_arg_0 = state_35; [L328] SORT_1 var_89 = var_89_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0] [L329] EXPR var_89 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1] [L329] var_89 = var_89 & mask_SORT_1 [L330] SORT_1 var_90_arg_0 = var_89; [L331] SORT_1 var_90_arg_1 = var_22; [L332] SORT_1 var_90 = var_90_arg_0 == var_90_arg_1; [L333] SORT_3 var_91_arg_0 = state_39; [L334] SORT_1 var_91 = var_91_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_90=0, var_91=0] [L335] EXPR var_91 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_90=0] [L335] var_91 = var_91 & mask_SORT_1 [L336] SORT_1 var_92_arg_0 = var_91; [L337] SORT_1 var_92_arg_1 = var_22; [L338] SORT_1 var_92 = var_92_arg_0 == var_92_arg_1; [L339] SORT_1 var_93_arg_0 = var_90; [L340] SORT_1 var_93_arg_1 = var_92; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_93_arg_0=0, var_93_arg_1=0] [L341] EXPR var_93_arg_0 & var_93_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0] [L341] SORT_1 var_93 = var_93_arg_0 & var_93_arg_1; [L342] SORT_1 var_94_arg_0 = var_93; [L343] SORT_1 var_94 = ~var_94_arg_0; [L344] SORT_3 var_95_arg_0 = state_45; [L345] SORT_1 var_95 = var_95_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_94=-1, var_95=0] [L346] EXPR var_95 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_94=-1] [L346] var_95 = var_95 & mask_SORT_1 [L347] SORT_1 var_96_arg_0 = var_95; [L348] SORT_1 var_96_arg_1 = var_22; [L349] SORT_1 var_96 = var_96_arg_0 == var_96_arg_1; [L350] SORT_1 var_97_arg_0 = var_94; [L351] SORT_1 var_97_arg_1 = var_96; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_95=0, var_97_arg_0=-1, var_97_arg_1=0] [L352] EXPR var_97_arg_0 | var_97_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_95=0] [L352] SORT_1 var_97 = var_97_arg_0 | var_97_arg_1; [L353] SORT_1 var_98_arg_0 = var_88; [L354] SORT_1 var_98_arg_1 = var_97; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_89=0, var_91=0, var_95=0, var_98_arg_0=1, var_98_arg_1=255] [L355] EXPR var_98_arg_0 & var_98_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_89=0, var_91=0, var_95=0] [L355] SORT_1 var_98 = var_98_arg_0 & var_98_arg_1; [L356] SORT_1 var_99_arg_0 = var_95; [L357] SORT_1 var_99_arg_1 = var_50; [L358] SORT_1 var_99 = var_99_arg_0 == var_99_arg_1; [L359] SORT_1 var_100_arg_0 = var_89; [L360] SORT_1 var_100_arg_1 = var_22; [L361] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L362] SORT_1 var_101_arg_0 = var_91; [L363] SORT_1 var_101_arg_1 = var_22; [L364] SORT_1 var_101 = var_101_arg_0 == var_101_arg_1; [L365] SORT_1 var_102_arg_0 = var_100; [L366] SORT_1 var_102_arg_1 = var_101; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_102_arg_0=0, var_102_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1, var_99=1] [L367] EXPR var_102_arg_0 & var_102_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1, var_99=1] [L367] SORT_1 var_102 = var_102_arg_0 & var_102_arg_1; [L368] SORT_1 var_103_arg_0 = var_99; [L369] SORT_1 var_103_arg_1 = var_102; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_103_arg_0=1, var_103_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1] [L370] EXPR var_103_arg_0 | var_103_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1] [L370] SORT_1 var_103 = var_103_arg_0 | var_103_arg_1; [L371] SORT_1 var_104_arg_0 = var_98; [L372] SORT_1 var_104_arg_1 = var_103; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104_arg_0=1, var_104_arg_1=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L373] EXPR var_104_arg_0 & var_104_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L373] SORT_1 var_104 = var_104_arg_0 & var_104_arg_1; [L374] SORT_3 var_105_arg_0 = state_35; [L375] SORT_1 var_105 = var_105_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L376] EXPR var_105 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L376] var_105 = var_105 & mask_SORT_1 [L377] SORT_1 var_106_arg_0 = var_105; [L378] SORT_1 var_106_arg_1 = var_22; [L379] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L380] SORT_3 var_107_arg_0 = state_39; [L381] SORT_1 var_107 = var_107_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_106=0, var_107=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L382] EXPR var_107 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_106=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L382] var_107 = var_107 & mask_SORT_1 [L383] SORT_1 var_108_arg_0 = var_107; [L384] SORT_1 var_108_arg_1 = var_22; [L385] SORT_1 var_108 = var_108_arg_0 == var_108_arg_1; [L386] SORT_1 var_109_arg_0 = var_106; [L387] SORT_1 var_109_arg_1 = var_108; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_109_arg_0=0, var_109_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L388] EXPR var_109_arg_0 & var_109_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L388] SORT_1 var_109 = var_109_arg_0 & var_109_arg_1; [L389] SORT_1 var_110_arg_0 = var_109; [L390] SORT_1 var_110 = ~var_110_arg_0; [L391] SORT_3 var_111_arg_0 = state_45; [L392] SORT_1 var_111 = var_111_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_110=-1, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L393] EXPR var_111 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_110=-1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L393] var_111 = var_111 & mask_SORT_1 [L394] SORT_1 var_112_arg_0 = var_111; [L395] SORT_1 var_112_arg_1 = var_22; [L396] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L397] SORT_1 var_113_arg_0 = var_110; [L398] SORT_1 var_113_arg_1 = var_112; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_111=0, var_113_arg_0=-1, var_113_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L399] EXPR var_113_arg_0 | var_113_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L399] SORT_1 var_113 = var_113_arg_0 | var_113_arg_1; [L400] SORT_1 var_114_arg_0 = var_104; [L401] SORT_1 var_114_arg_1 = var_113; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_105=0, var_107=0, var_111=0, var_114_arg_0=1, var_114_arg_1=255, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L402] EXPR var_114_arg_0 & var_114_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_105=0, var_107=0, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L402] SORT_1 var_114 = var_114_arg_0 & var_114_arg_1; [L403] SORT_1 var_115_arg_0 = var_111; [L404] SORT_1 var_115_arg_1 = var_50; [L405] SORT_1 var_115 = var_115_arg_0 == var_115_arg_1; [L406] SORT_1 var_116_arg_0 = var_105; [L407] SORT_1 var_116_arg_1 = var_22; [L408] SORT_1 var_116 = var_116_arg_0 == var_116_arg_1; [L409] SORT_1 var_117_arg_0 = var_107; [L410] SORT_1 var_117_arg_1 = var_22; [L411] SORT_1 var_117 = var_117_arg_0 == var_117_arg_1; [L412] SORT_1 var_118_arg_0 = var_116; [L413] SORT_1 var_118_arg_1 = var_117; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_115=1, var_118_arg_0=0, var_118_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L414] EXPR var_118_arg_0 & var_118_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_115=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L414] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L415] SORT_1 var_119_arg_0 = var_115; [L416] SORT_1 var_119_arg_1 = var_118; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_119_arg_0=1, var_119_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L417] EXPR var_119_arg_0 | var_119_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L417] SORT_1 var_119 = var_119_arg_0 | var_119_arg_1; [L418] SORT_1 var_120_arg_0 = var_114; [L419] SORT_1 var_120_arg_1 = var_119; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_120_arg_0=1, var_120_arg_1=1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L420] EXPR var_120_arg_0 & var_120_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L420] SORT_1 var_120 = var_120_arg_0 & var_120_arg_1; [L421] SORT_1 var_121_arg_0 = var_33; [L422] SORT_1 var_121_arg_1 = var_120; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_121_arg_0=-1, var_121_arg_1=1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L423] EXPR var_121_arg_0 | var_121_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L423] SORT_1 var_121 = var_121_arg_0 | var_121_arg_1; [L424] SORT_1 var_124_arg_0 = var_121; [L425] SORT_1 var_124 = ~var_124_arg_0; [L426] SORT_1 var_125_arg_0 = var_22; [L427] SORT_1 var_125_arg_1 = var_124; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_125_arg_0=1, var_125_arg_1=-1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L428] EXPR var_125_arg_0 & var_125_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L428] SORT_1 var_125 = var_125_arg_0 & var_125_arg_1; [L429] EXPR var_125 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L429] var_125 = var_125 & mask_SORT_1 [L430] SORT_1 bad_126_arg_0 = var_125; [L431] CALL __VERIFIER_assert(!(bad_126_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 723 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.7s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29360 SdHoareTripleChecker+Valid, 28.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29360 mSDsluCounter, 332055 SdHoareTripleChecker+Invalid, 23.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281804 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79890 IncrementalHoareTripleChecker+Invalid, 79982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 50251 mSDtfsCounter, 79890 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 596 GetRequests, 163 SyntacticMatches, 12 SemanticMatches, 421 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3347occurred in iteration=54, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 57 MinimizatonAttempts, 5314 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 9220 NumberOfCodeBlocks, 9220 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 8992 ConstructedInterpolants, 0 QuantifiedInterpolants, 20496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 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-03 18:33:28,367 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.vis_arrays_vsaR_p09.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 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:33:30,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:33:30,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:33:30,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:33:30,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:33:30,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:33:30,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:33:30,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:33:30,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:33:30,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:33:30,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:33:30,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:33:30,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:33:30,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:33:30,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:33:30,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:33:30,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:33:30,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:33:30,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:30,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:33:30,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:33:30,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:33:30,381 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 -> 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 [2025-03-03 18:33:30,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:33:30,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:33:30,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:33:30,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:33:30,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:33:30,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-03 18:33:31,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d053784bb/ad11a8f393da4b3a9dc982d01ecebf0f/FLAGd3ae9020f [2025-03-03 18:33:32,024 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:33:32,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-03 18:33:32,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d053784bb/ad11a8f393da4b3a9dc982d01ecebf0f/FLAGd3ae9020f [2025-03-03 18:33:32,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d053784bb/ad11a8f393da4b3a9dc982d01ecebf0f [2025-03-03 18:33:32,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:33:32,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:33:32,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:32,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:33:32,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:33:32,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7a8357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32, skipping insertion in model container [2025-03-03 18:33:32,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:33:32,514 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.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-03 18:33:32,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:32,709 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:33:32,716 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.vis_arrays_vsaR_p09.c[1259,1272] [2025-03-03 18:33:32,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:33:32,805 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:33:32,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32 WrapperNode [2025-03-03 18:33:32,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:33:32,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:32,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:33:32,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:33:32,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,897 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1325 [2025-03-03 18:33:32,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:33:32,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:33:32,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:33:32,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:33:32,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,959 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-03 18:33:32,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:32,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:33,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:33:33,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:33:33,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:33:33,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:33:33,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (1/1) ... [2025-03-03 18:33:33,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:33:33,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:33,033 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-03 18:33:33,036 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-03 18:33:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:33:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:33:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:33:33,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:33:33,285 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:33:33,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:33:34,400 INFO L? ?]: Removed 306 outVars from TransFormulas that were not future-live. [2025-03-03 18:33:34,400 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:33:34,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:33:34,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:33:34,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:34 BoogieIcfgContainer [2025-03-03 18:33:34,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:33:34,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:33:34,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:33:34,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:33:34,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:33:32" (1/3) ... [2025-03-03 18:33:34,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605cefd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:34, skipping insertion in model container [2025-03-03 18:33:34,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:33:32" (2/3) ... [2025-03-03 18:33:34,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605cefd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:33:34, skipping insertion in model container [2025-03-03 18:33:34,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:33:34" (3/3) ... [2025-03-03 18:33:34,415 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c [2025-03-03 18:33:34,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:33:34,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:33:34,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:33:34,468 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;@1ba8c272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:33:34,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:33:34,471 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-03 18:33:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:33:34,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:34,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:33:34,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:34,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:33:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:33:34,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675210657] [2025-03-03 18:33:34,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:34,489 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-03 18:33:34,490 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-03 18:33:34,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:33:34,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:33:34,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:34,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:34,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 149 conjuncts are in the unsatisfiable core [2025-03-03 18:33:34,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:33:36,086 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-03 18:33:36,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:33:36,088 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:33:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675210657] [2025-03-03 18:33:36,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675210657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:33:36,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:33:36,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:33:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388586039] [2025-03-03 18:33:36,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:33:36,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:33:36,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:33:36,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:33:36,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:33:36,111 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-03 18:33:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:36,205 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:33:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:33:36,208 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-03 18:33:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:36,211 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:33:36,212 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:33:36,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:33:36,217 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-03 18:33:36,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:33:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:33:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:33:36,236 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-03 18:33:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:33:36,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:33:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:36,240 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:33:36,241 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-03 18:33:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:33:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:33:36,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:33:36,241 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:36,250 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-03 18:33:36,442 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-03 18:33:36,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:36,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:33:36,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:33:36,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104825744] [2025-03-03 18:33:36,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:36,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:33:36,448 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-03 18:33:36,452 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-03 18:33:36,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:33:36,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:33:36,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:33:36,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:33:36,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 153 conjuncts are in the unsatisfiable core [2025-03-03 18:33:36,989 INFO L279 TraceCheckSpWp]: Computing forward predicates...