./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 540d3c0609d7405bda84fb1e4871377b6f878aecec1441e3a226cb07c87fae75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:34:47,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:34:47,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:34:47,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:34:47,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:34:47,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:34:47,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:34:47,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:34:47,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:34:47,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:34:47,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:34:47,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:34:47,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:34:47,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:34:47,676 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:34:47,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:34:47,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:34:47,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:34:47,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:34:47,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:34:47,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:34:47,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:34:47,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:34:47,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:34:47,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:34:47,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:34:47,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:34:47,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:34:47,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:34:47,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:34:47,679 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 540d3c0609d7405bda84fb1e4871377b6f878aecec1441e3a226cb07c87fae75 [2025-01-09 06:34:47,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:34:47,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:34:47,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:34:47,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:34:47,917 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:34:47,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c [2025-01-09 06:34:49,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abffec91b/01bc1585ead64819a919200a63c2d3c4/FLAG37cd657b6 [2025-01-09 06:34:49,385 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:34:49,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c [2025-01-09 06:34:49,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abffec91b/01bc1585ead64819a919200a63c2d3c4/FLAG37cd657b6 [2025-01-09 06:34:49,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abffec91b/01bc1585ead64819a919200a63c2d3c4 [2025-01-09 06:34:49,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:34:49,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:34:49,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:34:49,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:34:49,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:34:49,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:34:49" (1/1) ... [2025-01-09 06:34:49,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c0200c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:49, skipping insertion in model container [2025-01-09 06:34:49,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:34:49" (1/1) ... [2025-01-09 06:34:49,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:34:49,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c[1245,1258] [2025-01-09 06:34:49,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:34:49,869 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:34:49,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal11.c[1245,1258] [2025-01-09 06:34:50,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:34:50,026 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:34:50,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50 WrapperNode [2025-01-09 06:34:50,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:34:50,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:34:50,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:34:50,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:34:50,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,462 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3740 [2025-01-09 06:34:50,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:34:50,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:34:50,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:34:50,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:34:50,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,670 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:34:50,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:50,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:51,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:34:51,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:34:51,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:34:51,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:34:51,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (1/1) ... [2025-01-09 06:34:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:34:51,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:34:51,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:34:51,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:34:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:34:51,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:34:51,330 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:34:51,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:34:54,277 INFO L? ?]: Removed 2085 outVars from TransFormulas that were not future-live. [2025-01-09 06:34:54,277 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:34:54,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:34:54,299 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:34:54,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:34:54 BoogieIcfgContainer [2025-01-09 06:34:54,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:34:54,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:34:54,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:34:54,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:34:54,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:34:49" (1/3) ... [2025-01-09 06:34:54,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758d421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:34:54, skipping insertion in model container [2025-01-09 06:34:54,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:34:50" (2/3) ... [2025-01-09 06:34:54,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758d421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:34:54, skipping insertion in model container [2025-01-09 06:34:54,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:34:54" (3/3) ... [2025-01-09 06:34:54,306 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal11.c [2025-01-09 06:34:54,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:34:54,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal11.c that has 1 procedures, 1109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:34:54,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:34:54,379 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;@48ad09d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:34:54,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:34:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 1109 states, 1107 states have (on average 1.5004516711833784) internal successors, (1661), 1108 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:34:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 06:34:54,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:34:54,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:34:54,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:34:54,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:34:54,407 INFO L85 PathProgramCache]: Analyzing trace with hash -142062964, now seen corresponding path program 1 times [2025-01-09 06:34:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:34:54,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137524256] [2025-01-09 06:34:54,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:34:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:34:54,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 06:34:55,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 06:34:55,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:34:55,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:34:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:34:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:34:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137524256] [2025-01-09 06:34:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137524256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:34:57,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:34:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:34:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850701447] [2025-01-09 06:34:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:34:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:34:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:34:57,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:34:57,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:34:57,288 INFO L87 Difference]: Start difference. First operand has 1109 states, 1107 states have (on average 1.5004516711833784) internal successors, (1661), 1108 states have internal predecessors, (1661), 0 states have call successors, (0), 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 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:34:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:34:57,409 INFO L93 Difference]: Finished difference Result 2183 states and 3273 transitions. [2025-01-09 06:34:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:34:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 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 501 [2025-01-09 06:34:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:34:57,424 INFO L225 Difference]: With dead ends: 2183 [2025-01-09 06:34:57,424 INFO L226 Difference]: Without dead ends: 1108 [2025-01-09 06:34:57,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:34:57,431 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 0 mSDsluCounter, 3304 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4959 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:34:57,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4959 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:34:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-01-09 06:34:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2025-01-09 06:34:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.4986449864498645) internal successors, (1659), 1107 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:34:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1659 transitions. [2025-01-09 06:34:57,508 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1659 transitions. Word has length 501 [2025-01-09 06:34:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:34:57,512 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1659 transitions. [2025-01-09 06:34:57,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:34:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1659 transitions. [2025-01-09 06:34:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-09 06:34:57,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:34:57,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:34:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:34:57,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:34:57,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:34:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -107286196, now seen corresponding path program 1 times [2025-01-09 06:34:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:34:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614739201] [2025-01-09 06:34:57,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:34:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:34:57,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 06:34:57,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 06:34:57,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:34:57,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:34:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:34:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:34:58,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614739201] [2025-01-09 06:34:58,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614739201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:34:58,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:34:58,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:34:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229753837] [2025-01-09 06:34:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:34:58,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:34:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:34:58,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:34:58,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:34:58,791 INFO L87 Difference]: Start difference. First operand 1108 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:34:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:34:58,860 INFO L93 Difference]: Finished difference Result 2184 states and 3271 transitions. [2025-01-09 06:34:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:34:58,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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 502 [2025-01-09 06:34:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:34:58,868 INFO L225 Difference]: With dead ends: 2184 [2025-01-09 06:34:58,869 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 06:34:58,870 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-01-09 06:34:58,875 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 0 mSDsluCounter, 3300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:34:58,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4955 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:34:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 06:34:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2025-01-09 06:34:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.4977457168620378) internal successors, (1661), 1109 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:34:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1661 transitions. [2025-01-09 06:34:58,948 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1661 transitions. Word has length 502 [2025-01-09 06:34:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:34:58,949 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1661 transitions. [2025-01-09 06:34:58,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:34:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1661 transitions. [2025-01-09 06:34:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-01-09 06:34:58,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:34:58,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:34:58,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:34:58,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:34:58,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:34:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash -128867483, now seen corresponding path program 1 times [2025-01-09 06:34:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:34:58,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717779568] [2025-01-09 06:34:58,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:34:58,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:34:59,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 06:35:00,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 06:35:00,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:00,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:01,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717779568] [2025-01-09 06:35:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717779568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:01,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:35:01,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775859938] [2025-01-09 06:35:01,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:01,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:35:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:01,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:35:01,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:01,677 INFO L87 Difference]: Start difference. First operand 1110 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:02,012 INFO L93 Difference]: Finished difference Result 3190 states and 4777 transitions. [2025-01-09 06:35:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:35:02,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 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 503 [2025-01-09 06:35:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:02,018 INFO L225 Difference]: With dead ends: 3190 [2025-01-09 06:35:02,018 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 06:35:02,020 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-01-09 06:35:02,021 INFO L435 NwaCegarLoop]: 2870 mSDtfsCounter, 1436 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 7207 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:02,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 7207 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:35:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 06:35:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2025-01-09 06:35:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 1.496844003606853) internal successors, (1660), 1109 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1660 transitions. [2025-01-09 06:35:02,040 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1660 transitions. Word has length 503 [2025-01-09 06:35:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:02,041 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1660 transitions. [2025-01-09 06:35:02,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1660 transitions. [2025-01-09 06:35:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 06:35:02,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:02,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:02,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:35:02,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:02,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:02,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1062062812, now seen corresponding path program 1 times [2025-01-09 06:35:02,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:02,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145010510] [2025-01-09 06:35:02,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:02,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:02,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 06:35:02,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 06:35:02,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:02,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145010510] [2025-01-09 06:35:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145010510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:03,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:03,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:35:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194121394] [2025-01-09 06:35:03,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:03,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:35:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:03,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:35:03,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:35:03,856 INFO L87 Difference]: Start difference. First operand 1110 states and 1660 transitions. Second operand has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:04,191 INFO L93 Difference]: Finished difference Result 4073 states and 6097 transitions. [2025-01-09 06:35:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:35:04,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 504 [2025-01-09 06:35:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:04,199 INFO L225 Difference]: With dead ends: 4073 [2025-01-09 06:35:04,199 INFO L226 Difference]: Without dead ends: 2174 [2025-01-09 06:35:04,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:35:04,202 INFO L435 NwaCegarLoop]: 1629 mSDtfsCounter, 3586 mSDsluCounter, 6358 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3586 SdHoareTripleChecker+Valid, 7987 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:04,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3586 Valid, 7987 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:35:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2025-01-09 06:35:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 1132. [2025-01-09 06:35:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.4960212201591512) internal successors, (1692), 1131 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1692 transitions. [2025-01-09 06:35:04,226 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1692 transitions. Word has length 504 [2025-01-09 06:35:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:04,226 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1692 transitions. [2025-01-09 06:35:04,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1692 transitions. [2025-01-09 06:35:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-09 06:35:04,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:04,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:04,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:35:04,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:04,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash 602358620, now seen corresponding path program 1 times [2025-01-09 06:35:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:04,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923325433] [2025-01-09 06:35:04,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:04,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 06:35:04,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 06:35:04,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:04,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:05,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-01-09 06:35:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923325433] [2025-01-09 06:35:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923325433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:05,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:05,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:35:05,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967140265] [2025-01-09 06:35:05,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:05,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:35:05,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:05,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:35:05,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:05,922 INFO L87 Difference]: Start difference. First operand 1132 states and 1692 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:06,186 INFO L93 Difference]: Finished difference Result 2230 states and 3334 transitions. [2025-01-09 06:35:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:35:06,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2025-01-09 06:35:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:06,191 INFO L225 Difference]: With dead ends: 2230 [2025-01-09 06:35:06,191 INFO L226 Difference]: Without dead ends: 1132 [2025-01-09 06:35:06,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:06,193 INFO L435 NwaCegarLoop]: 1472 mSDtfsCounter, 1236 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:06,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 2941 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:35:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-01-09 06:35:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2025-01-09 06:35:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.4951370468611849) internal successors, (1691), 1131 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1691 transitions. [2025-01-09 06:35:06,210 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1691 transitions. Word has length 505 [2025-01-09 06:35:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:06,210 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1691 transitions. [2025-01-09 06:35:06,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1691 transitions. [2025-01-09 06:35:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 06:35:06,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:06,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:35:06,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:06,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:06,217 INFO L85 PathProgramCache]: Analyzing trace with hash 600227074, now seen corresponding path program 1 times [2025-01-09 06:35:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174769807] [2025-01-09 06:35:06,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:06,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 06:35:08,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 06:35:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:08,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:08,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174769807] [2025-01-09 06:35:08,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174769807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:08,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:08,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:35:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480201460] [2025-01-09 06:35:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:08,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:35:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:08,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:35:08,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:35:08,984 INFO L87 Difference]: Start difference. First operand 1132 states and 1691 transitions. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:09,720 INFO L93 Difference]: Finished difference Result 3272 states and 4890 transitions. [2025-01-09 06:35:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:35:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 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 506 [2025-01-09 06:35:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:09,726 INFO L225 Difference]: With dead ends: 3272 [2025-01-09 06:35:09,726 INFO L226 Difference]: Without dead ends: 2174 [2025-01-09 06:35:09,728 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-01-09 06:35:09,728 INFO L435 NwaCegarLoop]: 2875 mSDtfsCounter, 3228 mSDsluCounter, 7200 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 10075 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:09,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 10075 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:35:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2025-01-09 06:35:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 1133. [2025-01-09 06:35:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4946996466431095) internal successors, (1692), 1132 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1692 transitions. [2025-01-09 06:35:09,749 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1692 transitions. Word has length 506 [2025-01-09 06:35:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:09,749 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1692 transitions. [2025-01-09 06:35:09,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1692 transitions. [2025-01-09 06:35:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 06:35:09,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:09,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:35:09,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1182470036, now seen corresponding path program 1 times [2025-01-09 06:35:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279316844] [2025-01-09 06:35:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:09,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 06:35:11,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 06:35:11,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:11,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:12,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279316844] [2025-01-09 06:35:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279316844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:35:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089473110] [2025-01-09 06:35:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:35:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:12,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:35:12,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:35:12,631 INFO L87 Difference]: Start difference. First operand 1133 states and 1692 transitions. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:13,273 INFO L93 Difference]: Finished difference Result 3296 states and 4925 transitions. [2025-01-09 06:35:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:35:13,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 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 506 [2025-01-09 06:35:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:13,280 INFO L225 Difference]: With dead ends: 3296 [2025-01-09 06:35:13,280 INFO L226 Difference]: Without dead ends: 2197 [2025-01-09 06:35:13,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:35:13,283 INFO L435 NwaCegarLoop]: 2901 mSDtfsCounter, 3206 mSDsluCounter, 7253 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3206 SdHoareTripleChecker+Valid, 10154 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:13,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3206 Valid, 10154 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:35:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2025-01-09 06:35:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1133. [2025-01-09 06:35:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4946996466431095) internal successors, (1692), 1132 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1692 transitions. [2025-01-09 06:35:13,305 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1692 transitions. Word has length 506 [2025-01-09 06:35:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:13,305 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1692 transitions. [2025-01-09 06:35:13,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1692 transitions. [2025-01-09 06:35:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-01-09 06:35:13,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:13,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:13,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:35:13,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash 418868575, now seen corresponding path program 1 times [2025-01-09 06:35:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763306054] [2025-01-09 06:35:13,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:13,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-01-09 06:35:14,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-01-09 06:35:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763306054] [2025-01-09 06:35:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763306054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:35:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165775815] [2025-01-09 06:35:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:35:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:35:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:14,826 INFO L87 Difference]: Start difference. First operand 1133 states and 1692 transitions. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:15,051 INFO L93 Difference]: Finished difference Result 2232 states and 3334 transitions. [2025-01-09 06:35:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:35:15,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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 507 [2025-01-09 06:35:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:15,055 INFO L225 Difference]: With dead ends: 2232 [2025-01-09 06:35:15,055 INFO L226 Difference]: Without dead ends: 1133 [2025-01-09 06:35:15,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:15,057 INFO L435 NwaCegarLoop]: 1472 mSDtfsCounter, 1206 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:15,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 2942 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:35:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-01-09 06:35:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2025-01-09 06:35:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.493816254416961) internal successors, (1691), 1132 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1691 transitions. [2025-01-09 06:35:15,073 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1691 transitions. Word has length 507 [2025-01-09 06:35:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:15,075 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1691 transitions. [2025-01-09 06:35:15,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1691 transitions. [2025-01-09 06:35:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-01-09 06:35:15,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:15,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:15,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:35:15,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:15,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1878778737, now seen corresponding path program 1 times [2025-01-09 06:35:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:15,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061374258] [2025-01-09 06:35:15,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:15,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-01-09 06:35:16,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-01-09 06:35:16,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:16,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061374258] [2025-01-09 06:35:17,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061374258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:17,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:17,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:35:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491114225] [2025-01-09 06:35:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:17,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:35:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:17,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:35:17,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:17,552 INFO L87 Difference]: Start difference. First operand 1133 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:17,790 INFO L93 Difference]: Finished difference Result 2232 states and 3332 transitions. [2025-01-09 06:35:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:35:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 508 [2025-01-09 06:35:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:17,793 INFO L225 Difference]: With dead ends: 2232 [2025-01-09 06:35:17,793 INFO L226 Difference]: Without dead ends: 1133 [2025-01-09 06:35:17,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:17,796 INFO L435 NwaCegarLoop]: 1472 mSDtfsCounter, 1198 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:17,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2941 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:35:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-01-09 06:35:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2025-01-09 06:35:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4929328621908127) internal successors, (1690), 1132 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1690 transitions. [2025-01-09 06:35:17,810 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1690 transitions. Word has length 508 [2025-01-09 06:35:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:17,811 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1690 transitions. [2025-01-09 06:35:17,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1690 transitions. [2025-01-09 06:35:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-01-09 06:35:17,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:17,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:17,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:35:17,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:17,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash 978193550, now seen corresponding path program 1 times [2025-01-09 06:35:17,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:17,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111223933] [2025-01-09 06:35:17,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:17,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-01-09 06:35:20,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-01-09 06:35:20,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:20,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111223933] [2025-01-09 06:35:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111223933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:21,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:21,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:35:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614761203] [2025-01-09 06:35:21,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:35:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:21,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:35:21,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:35:21,805 INFO L87 Difference]: Start difference. First operand 1133 states and 1690 transitions. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:22,112 INFO L93 Difference]: Finished difference Result 2232 states and 3330 transitions. [2025-01-09 06:35:22,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:35:22,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 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 509 [2025-01-09 06:35:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:22,116 INFO L225 Difference]: With dead ends: 2232 [2025-01-09 06:35:22,116 INFO L226 Difference]: Without dead ends: 1133 [2025-01-09 06:35:22,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:35:22,117 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1427 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:22,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3892 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:35:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-01-09 06:35:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2025-01-09 06:35:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4920494699646643) internal successors, (1689), 1132 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1689 transitions. [2025-01-09 06:35:22,132 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1689 transitions. Word has length 509 [2025-01-09 06:35:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:22,132 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1689 transitions. [2025-01-09 06:35:22,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1689 transitions. [2025-01-09 06:35:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-01-09 06:35:22,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:22,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:22,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:35:22,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:22,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:22,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1708902773, now seen corresponding path program 1 times [2025-01-09 06:35:22,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:22,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623002723] [2025-01-09 06:35:22,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:22,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-01-09 06:35:24,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-01-09 06:35:24,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:24,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:25,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623002723] [2025-01-09 06:35:25,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623002723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:25,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:25,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:35:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457203435] [2025-01-09 06:35:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:25,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:35:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:25,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:35:25,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:25,635 INFO L87 Difference]: Start difference. First operand 1133 states and 1689 transitions. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:25,677 INFO L93 Difference]: Finished difference Result 2232 states and 3328 transitions. [2025-01-09 06:35:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:35:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 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 510 [2025-01-09 06:35:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:25,680 INFO L225 Difference]: With dead ends: 2232 [2025-01-09 06:35:25,680 INFO L226 Difference]: Without dead ends: 1133 [2025-01-09 06:35:25,681 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-01-09 06:35:25,682 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 815 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:25,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 3862 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:35:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-01-09 06:35:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2025-01-09 06:35:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.4911660777385158) internal successors, (1688), 1132 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1688 transitions. [2025-01-09 06:35:25,694 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1688 transitions. Word has length 510 [2025-01-09 06:35:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:25,695 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1688 transitions. [2025-01-09 06:35:25,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1688 transitions. [2025-01-09 06:35:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-01-09 06:35:25,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:25,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:25,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:35:25,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:25,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1023300531, now seen corresponding path program 1 times [2025-01-09 06:35:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:25,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132233026] [2025-01-09 06:35:25,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:25,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:25,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-01-09 06:35:27,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-01-09 06:35:27,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:27,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:28,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132233026] [2025-01-09 06:35:28,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132233026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:28,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:28,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:35:28,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970091151] [2025-01-09 06:35:28,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:28,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:35:28,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:28,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:35:28,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:35:28,507 INFO L87 Difference]: Start difference. First operand 1133 states and 1688 transitions. Second operand has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:28,916 INFO L93 Difference]: Finished difference Result 2401 states and 3574 transitions. [2025-01-09 06:35:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:35:28,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 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 511 [2025-01-09 06:35:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:28,920 INFO L225 Difference]: With dead ends: 2401 [2025-01-09 06:35:28,920 INFO L226 Difference]: Without dead ends: 1302 [2025-01-09 06:35:28,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:35:28,922 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 3060 mSDsluCounter, 4385 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3060 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:28,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 5851 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:35:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-01-09 06:35:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1167. [2025-01-09 06:35:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1166 states have (on average 1.4897084048027445) internal successors, (1737), 1166 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1737 transitions. [2025-01-09 06:35:28,938 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1737 transitions. Word has length 511 [2025-01-09 06:35:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:28,938 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1737 transitions. [2025-01-09 06:35:28,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1737 transitions. [2025-01-09 06:35:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-01-09 06:35:28,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:28,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:28,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:35:28,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1715370016, now seen corresponding path program 1 times [2025-01-09 06:35:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046552253] [2025-01-09 06:35:28,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:29,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-01-09 06:35:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-01-09 06:35:30,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:30,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:31,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-01-09 06:35:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:31,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046552253] [2025-01-09 06:35:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046552253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:31,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:35:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065735249] [2025-01-09 06:35:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:35:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:31,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:35:31,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:35:31,953 INFO L87 Difference]: Start difference. First operand 1167 states and 1737 transitions. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:32,466 INFO L93 Difference]: Finished difference Result 2815 states and 4195 transitions. [2025-01-09 06:35:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:35:32,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 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 512 [2025-01-09 06:35:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:32,472 INFO L225 Difference]: With dead ends: 2815 [2025-01-09 06:35:32,472 INFO L226 Difference]: Without dead ends: 1682 [2025-01-09 06:35:32,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:35:32,474 INFO L435 NwaCegarLoop]: 1465 mSDtfsCounter, 2709 mSDsluCounter, 5846 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2709 SdHoareTripleChecker+Valid, 7311 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:32,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2709 Valid, 7311 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:35:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-01-09 06:35:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1656. [2025-01-09 06:35:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.4918429003021147) internal successors, (2469), 1655 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2469 transitions. [2025-01-09 06:35:32,505 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2469 transitions. Word has length 512 [2025-01-09 06:35:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:32,508 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2469 transitions. [2025-01-09 06:35:32,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2469 transitions. [2025-01-09 06:35:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-09 06:35:32,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:32,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:32,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:35:32,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:32,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1403734838, now seen corresponding path program 1 times [2025-01-09 06:35:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:32,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955030437] [2025-01-09 06:35:32,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:32,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:32,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 06:35:34,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 06:35:34,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:34,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955030437] [2025-01-09 06:35:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955030437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:35:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977310015] [2025-01-09 06:35:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:36,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:35:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:36,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:35:36,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:35:36,828 INFO L87 Difference]: Start difference. First operand 1656 states and 2469 transitions. Second operand has 10 states, 10 states have (on average 51.3) internal successors, (513), 10 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:38,156 INFO L93 Difference]: Finished difference Result 3293 states and 4909 transitions. [2025-01-09 06:35:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:35:38,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 51.3) internal successors, (513), 10 states have internal predecessors, (513), 0 states have call successors, (0), 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 513 [2025-01-09 06:35:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:38,161 INFO L225 Difference]: With dead ends: 3293 [2025-01-09 06:35:38,161 INFO L226 Difference]: Without dead ends: 1671 [2025-01-09 06:35:38,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:35:38,162 INFO L435 NwaCegarLoop]: 1148 mSDtfsCounter, 2374 mSDsluCounter, 5727 mSDsCounter, 0 mSdLazyCounter, 3032 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 6875 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:38,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 6875 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3032 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 06:35:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-01-09 06:35:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1666. [2025-01-09 06:35:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.4906906906906907) internal successors, (2482), 1665 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2482 transitions. [2025-01-09 06:35:38,181 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2482 transitions. Word has length 513 [2025-01-09 06:35:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:38,182 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2482 transitions. [2025-01-09 06:35:38,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 51.3) internal successors, (513), 10 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2482 transitions. [2025-01-09 06:35:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-09 06:35:38,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:38,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:38,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:35:38,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:38,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1571055677, now seen corresponding path program 1 times [2025-01-09 06:35:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717033732] [2025-01-09 06:35:38,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:38,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 06:35:40,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 06:35:40,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:40,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717033732] [2025-01-09 06:35:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717033732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:35:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938557593] [2025-01-09 06:35:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:41,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:35:41,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:41,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:35:41,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:35:41,426 INFO L87 Difference]: Start difference. First operand 1666 states and 2482 transitions. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:41,802 INFO L93 Difference]: Finished difference Result 3739 states and 5563 transitions. [2025-01-09 06:35:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:35:41,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 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 513 [2025-01-09 06:35:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:41,808 INFO L225 Difference]: With dead ends: 3739 [2025-01-09 06:35:41,808 INFO L226 Difference]: Without dead ends: 2107 [2025-01-09 06:35:41,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:35:41,811 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 2214 mSDsluCounter, 4384 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 5850 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:41,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 5850 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:35:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2025-01-09 06:35:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1929. [2025-01-09 06:35:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1928 states have (on average 1.4901452282157677) internal successors, (2873), 1928 states have internal predecessors, (2873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2873 transitions. [2025-01-09 06:35:41,861 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2873 transitions. Word has length 513 [2025-01-09 06:35:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:41,861 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2873 transitions. [2025-01-09 06:35:41,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2873 transitions. [2025-01-09 06:35:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-01-09 06:35:41,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:41,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:41,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:35:41,872 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:41,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash 148414825, now seen corresponding path program 1 times [2025-01-09 06:35:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422091917] [2025-01-09 06:35:41,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:41,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-01-09 06:35:44,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-01-09 06:35:44,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422091917] [2025-01-09 06:35:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422091917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:46,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:35:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961176816] [2025-01-09 06:35:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:46,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:35:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:46,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:35:46,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:35:46,032 INFO L87 Difference]: Start difference. First operand 1929 states and 2873 transitions. Second operand has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:46,766 INFO L93 Difference]: Finished difference Result 3828 states and 5702 transitions. [2025-01-09 06:35:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:35:46,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 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 514 [2025-01-09 06:35:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:46,770 INFO L225 Difference]: With dead ends: 3828 [2025-01-09 06:35:46,771 INFO L226 Difference]: Without dead ends: 1933 [2025-01-09 06:35:46,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:35:46,773 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 1350 mSDsluCounter, 4419 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 5743 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:46,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 5743 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:35:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-01-09 06:35:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1932. [2025-01-09 06:35:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1931 states have (on average 1.4893837389953393) internal successors, (2876), 1931 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2876 transitions. [2025-01-09 06:35:46,792 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2876 transitions. Word has length 514 [2025-01-09 06:35:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:46,792 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2876 transitions. [2025-01-09 06:35:46,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2876 transitions. [2025-01-09 06:35:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-01-09 06:35:46,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:46,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:46,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:35:46,796 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:46,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -59818598, now seen corresponding path program 1 times [2025-01-09 06:35:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705297041] [2025-01-09 06:35:46,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:46,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-01-09 06:35:47,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-01-09 06:35:47,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:47,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705297041] [2025-01-09 06:35:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705297041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:48,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:35:48,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125304041] [2025-01-09 06:35:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:48,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:35:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:48,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:35:48,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:35:48,919 INFO L87 Difference]: Start difference. First operand 1932 states and 2876 transitions. Second operand has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:48,997 INFO L93 Difference]: Finished difference Result 5370 states and 8006 transitions. [2025-01-09 06:35:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:35:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 0 states have call successors, (0), 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 515 [2025-01-09 06:35:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:49,005 INFO L225 Difference]: With dead ends: 5370 [2025-01-09 06:35:49,006 INFO L226 Difference]: Without dead ends: 3472 [2025-01-09 06:35:49,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:35:49,008 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 3684 mSDsluCounter, 6549 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3684 SdHoareTripleChecker+Valid, 8190 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:49,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3684 Valid, 8190 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:35:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2025-01-09 06:35:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 2970. [2025-01-09 06:35:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2970 states, 2969 states have (on average 1.4917480633209834) internal successors, (4429), 2969 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 4429 transitions. [2025-01-09 06:35:49,034 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 4429 transitions. Word has length 515 [2025-01-09 06:35:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:49,034 INFO L471 AbstractCegarLoop]: Abstraction has 2970 states and 4429 transitions. [2025-01-09 06:35:49,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.57142857142857) internal successors, (515), 7 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 4429 transitions. [2025-01-09 06:35:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-01-09 06:35:49,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:49,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:49,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:35:49,038 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:49,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:49,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1382652314, now seen corresponding path program 1 times [2025-01-09 06:35:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404952466] [2025-01-09 06:35:49,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:49,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-09 06:35:52,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-09 06:35:52,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:52,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404952466] [2025-01-09 06:35:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404952466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:53,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:35:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492599106] [2025-01-09 06:35:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:53,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:35:53,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:53,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:35:53,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:35:53,253 INFO L87 Difference]: Start difference. First operand 2970 states and 4429 transitions. Second operand has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:53,649 INFO L93 Difference]: Finished difference Result 8256 states and 12323 transitions. [2025-01-09 06:35:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:35:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 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 516 [2025-01-09 06:35:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:53,657 INFO L225 Difference]: With dead ends: 8256 [2025-01-09 06:35:53,657 INFO L226 Difference]: Without dead ends: 5320 [2025-01-09 06:35:53,659 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-01-09 06:35:53,660 INFO L435 NwaCegarLoop]: 1464 mSDtfsCounter, 2524 mSDsluCounter, 4380 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2524 SdHoareTripleChecker+Valid, 5844 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:53,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2524 Valid, 5844 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:35:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2025-01-09 06:35:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 4876. [2025-01-09 06:35:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.492923076923077) internal successors, (7278), 4875 states have internal predecessors, (7278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 7278 transitions. [2025-01-09 06:35:53,727 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 7278 transitions. Word has length 516 [2025-01-09 06:35:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:53,728 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 7278 transitions. [2025-01-09 06:35:53,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 7278 transitions. [2025-01-09 06:35:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 06:35:53,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:53,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:35:53,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:53,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 600308363, now seen corresponding path program 1 times [2025-01-09 06:35:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129824771] [2025-01-09 06:35:53,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:53,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 06:35:55,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 06:35:55,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129824771] [2025-01-09 06:35:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129824771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:56,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:35:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851877637] [2025-01-09 06:35:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:35:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:56,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:35:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:35:56,513 INFO L87 Difference]: Start difference. First operand 4876 states and 7278 transitions. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:57,024 INFO L93 Difference]: Finished difference Result 9936 states and 14832 transitions. [2025-01-09 06:35:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:35:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 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 517 [2025-01-09 06:35:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:57,030 INFO L225 Difference]: With dead ends: 9936 [2025-01-09 06:35:57,030 INFO L226 Difference]: Without dead ends: 5094 [2025-01-09 06:35:57,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:35:57,034 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 2065 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 7172 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:57,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 7172 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:35:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2025-01-09 06:35:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 4920. [2025-01-09 06:35:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4920 states, 4919 states have (on average 1.4925797926407807) internal successors, (7342), 4919 states have internal predecessors, (7342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 7342 transitions. [2025-01-09 06:35:57,066 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 7342 transitions. Word has length 517 [2025-01-09 06:35:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:57,066 INFO L471 AbstractCegarLoop]: Abstraction has 4920 states and 7342 transitions. [2025-01-09 06:35:57,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 7342 transitions. [2025-01-09 06:35:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 06:35:57,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:57,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:57,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:35:57,073 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1258608307, now seen corresponding path program 1 times [2025-01-09 06:35:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569541838] [2025-01-09 06:35:57,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:57,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 06:35:57,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 06:35:57,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:35:57,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:35:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:35:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:35:57,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569541838] [2025-01-09 06:35:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569541838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:35:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:35:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:35:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529034216] [2025-01-09 06:35:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:35:57,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:35:57,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:35:57,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:35:57,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:35:57,902 INFO L87 Difference]: Start difference. First operand 4920 states and 7342 transitions. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:35:57,958 INFO L93 Difference]: Finished difference Result 9814 states and 14646 transitions. [2025-01-09 06:35:57,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:35:57,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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 517 [2025-01-09 06:35:57,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:35:57,968 INFO L225 Difference]: With dead ends: 9814 [2025-01-09 06:35:57,969 INFO L226 Difference]: Without dead ends: 4928 [2025-01-09 06:35:57,975 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-01-09 06:35:57,976 INFO L435 NwaCegarLoop]: 1649 mSDtfsCounter, 0 mSDsluCounter, 3269 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:35:57,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4918 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:35:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-01-09 06:35:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4928. [2025-01-09 06:35:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 4927 states have (on average 1.4917799878222042) internal successors, (7350), 4927 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 7350 transitions. [2025-01-09 06:35:58,014 INFO L78 Accepts]: Start accepts. Automaton has 4928 states and 7350 transitions. Word has length 517 [2025-01-09 06:35:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:35:58,015 INFO L471 AbstractCegarLoop]: Abstraction has 4928 states and 7350 transitions. [2025-01-09 06:35:58,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:35:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4928 states and 7350 transitions. [2025-01-09 06:35:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 06:35:58,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:35:58,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:35:58,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:35:58,021 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:35:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:35:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1194278115, now seen corresponding path program 1 times [2025-01-09 06:35:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:35:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488183365] [2025-01-09 06:35:58,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:35:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:35:58,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 06:36:00,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 06:36:00,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:36:00,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:36:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:36:01,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:36:01,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488183365] [2025-01-09 06:36:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488183365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:36:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:36:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:36:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248595254] [2025-01-09 06:36:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:36:01,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:36:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:36:01,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:36:01,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:36:01,469 INFO L87 Difference]: Start difference. First operand 4928 states and 7350 transitions. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:36:01,533 INFO L93 Difference]: Finished difference Result 9822 states and 14650 transitions. [2025-01-09 06:36:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:36:01,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 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 518 [2025-01-09 06:36:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:36:01,542 INFO L225 Difference]: With dead ends: 9822 [2025-01-09 06:36:01,543 INFO L226 Difference]: Without dead ends: 4928 [2025-01-09 06:36:01,546 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-01-09 06:36:01,547 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 1186 mSDsluCounter, 3470 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5105 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:36:01,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5105 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:36:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-01-09 06:36:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4928. [2025-01-09 06:36:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 4927 states have (on average 1.4913740612949056) internal successors, (7348), 4927 states have internal predecessors, (7348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 7348 transitions. [2025-01-09 06:36:01,581 INFO L78 Accepts]: Start accepts. Automaton has 4928 states and 7348 transitions. Word has length 518 [2025-01-09 06:36:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:36:01,581 INFO L471 AbstractCegarLoop]: Abstraction has 4928 states and 7348 transitions. [2025-01-09 06:36:01,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4928 states and 7348 transitions. [2025-01-09 06:36:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 06:36:01,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:36:01,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:36:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:36:01,587 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:36:01,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:36:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -977763829, now seen corresponding path program 1 times [2025-01-09 06:36:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:36:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339204716] [2025-01-09 06:36:01,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:36:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:36:01,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 06:36:02,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 06:36:02,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:36:02,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:36:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:36:02,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:36:02,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339204716] [2025-01-09 06:36:02,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339204716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:36:02,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:36:02,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:36:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242818581] [2025-01-09 06:36:02,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:36:02,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:36:02,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:36:02,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:36:02,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:36:02,928 INFO L87 Difference]: Start difference. First operand 4928 states and 7348 transitions. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:36:03,146 INFO L93 Difference]: Finished difference Result 9822 states and 14646 transitions. [2025-01-09 06:36:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:36:03,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 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 519 [2025-01-09 06:36:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:36:03,155 INFO L225 Difference]: With dead ends: 9822 [2025-01-09 06:36:03,155 INFO L226 Difference]: Without dead ends: 4928 [2025-01-09 06:36:03,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:36:03,161 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1181 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:36:03,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 2937 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:36:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-01-09 06:36:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4892. [2025-01-09 06:36:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4891 states have (on average 1.4915150276017175) internal successors, (7295), 4891 states have internal predecessors, (7295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 7295 transitions. [2025-01-09 06:36:03,192 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 7295 transitions. Word has length 519 [2025-01-09 06:36:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:36:03,192 INFO L471 AbstractCegarLoop]: Abstraction has 4892 states and 7295 transitions. [2025-01-09 06:36:03,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 7295 transitions. [2025-01-09 06:36:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 06:36:03,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:36:03,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:36:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:36:03,198 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:36:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:36:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash -83826181, now seen corresponding path program 1 times [2025-01-09 06:36:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:36:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819115351] [2025-01-09 06:36:03,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:36:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:36:03,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 06:36:04,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 06:36:04,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:36:04,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:36:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:36:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:36:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819115351] [2025-01-09 06:36:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819115351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:36:05,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:36:05,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:36:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898754077] [2025-01-09 06:36:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:36:05,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:36:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:36:05,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:36:05,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:36:05,475 INFO L87 Difference]: Start difference. First operand 4892 states and 7295 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:36:05,683 INFO L93 Difference]: Finished difference Result 9750 states and 14540 transitions. [2025-01-09 06:36:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:36:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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 520 [2025-01-09 06:36:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:36:05,692 INFO L225 Difference]: With dead ends: 9750 [2025-01-09 06:36:05,692 INFO L226 Difference]: Without dead ends: 4892 [2025-01-09 06:36:05,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:36:05,697 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1157 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:36:05,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 2937 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:36:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2025-01-09 06:36:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4892. [2025-01-09 06:36:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4891 states have (on average 1.4913105704354939) internal successors, (7294), 4891 states have internal predecessors, (7294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 7294 transitions. [2025-01-09 06:36:05,735 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 7294 transitions. Word has length 520 [2025-01-09 06:36:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:36:05,735 INFO L471 AbstractCegarLoop]: Abstraction has 4892 states and 7294 transitions. [2025-01-09 06:36:05,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 7294 transitions. [2025-01-09 06:36:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 06:36:05,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:36:05,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:36:05,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:36:05,742 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:36:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:36:05,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2123709226, now seen corresponding path program 1 times [2025-01-09 06:36:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:36:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349715458] [2025-01-09 06:36:05,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:36:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:36:05,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 06:36:07,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 06:36:07,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:36:07,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:36:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:36:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:36:08,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349715458] [2025-01-09 06:36:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349715458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:36:08,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:36:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:36:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174322810] [2025-01-09 06:36:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:36:08,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:36:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:36:08,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:36:08,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:36:08,392 INFO L87 Difference]: Start difference. First operand 4892 states and 7294 transitions. Second operand has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:36:08,599 INFO L93 Difference]: Finished difference Result 14504 states and 21626 transitions. [2025-01-09 06:36:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:36:08,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 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 521 [2025-01-09 06:36:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:36:08,607 INFO L225 Difference]: With dead ends: 14504 [2025-01-09 06:36:08,608 INFO L226 Difference]: Without dead ends: 9646 [2025-01-09 06:36:08,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:36:08,613 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 5393 mSDsluCounter, 4880 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5393 SdHoareTripleChecker+Valid, 6506 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:36:08,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5393 Valid, 6506 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:36:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9646 states. [2025-01-09 06:36:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9646 to 9627. [2025-01-09 06:36:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9627 states, 9626 states have (on average 1.4914814045293996) internal successors, (14357), 9626 states have internal predecessors, (14357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 14357 transitions. [2025-01-09 06:36:08,683 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 14357 transitions. Word has length 521 [2025-01-09 06:36:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:36:08,684 INFO L471 AbstractCegarLoop]: Abstraction has 9627 states and 14357 transitions. [2025-01-09 06:36:08,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:36:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 14357 transitions. [2025-01-09 06:36:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-01-09 06:36:08,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:36:08,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:36:08,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:36:08,690 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:36:08,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:36:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash -501586526, now seen corresponding path program 1 times [2025-01-09 06:36:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:36:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483837749] [2025-01-09 06:36:08,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:36:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:36:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes.