./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash e2c31a6d36722edb2a8cb670626aeeca5f235139fff7eadbabd05db5fa398d5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:36:26,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:36:26,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:36:26,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:36:26,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:36:26,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:36:26,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:36:26,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:36:26,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:36:26,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:36:26,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:36:26,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:36:26,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:36:26,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:36:26,247 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:36:26,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:36:26,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:36:26,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:36:26,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:36:26,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:26,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:26,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:36:26,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:36:26,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:36:26,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:36:26,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:36:26,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:36:26,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:36:26,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:36:26,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:36:26,251 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2c31a6d36722edb2a8cb670626aeeca5f235139fff7eadbabd05db5fa398d5d [2025-01-09 04:36:26,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:36:26,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:36:26,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:36:26,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:36:26,593 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:36:26,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-01-09 04:36:27,994 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce3ac0ec3/5d4e79b689c8479a9fffe882ff11731b/FLAG916aebacc [2025-01-09 04:36:28,376 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:36:28,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-01-09 04:36:28,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce3ac0ec3/5d4e79b689c8479a9fffe882ff11731b/FLAG916aebacc [2025-01-09 04:36:28,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce3ac0ec3/5d4e79b689c8479a9fffe882ff11731b [2025-01-09 04:36:28,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:36:28,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:36:28,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:36:28,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:36:28,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:36:28,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:28" (1/1) ... [2025-01-09 04:36:28,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aafcc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:28, skipping insertion in model container [2025-01-09 04:36:28,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:28" (1/1) ... [2025-01-09 04:36:28,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:36:28,780 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/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2025-01-09 04:36:28,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:36:28,849 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:36:28,973 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/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532] [2025-01-09 04:36:29,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:36:29,029 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:36:29,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29 WrapperNode [2025-01-09 04:36:29,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:36:29,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:36:29,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:36:29,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:36:29,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,099 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1250 [2025-01-09 04:36:29,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:36:29,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:36:29,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:36:29,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:36:29,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,142 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:36:29,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:36:29,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:36:29,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:36:29,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:36:29,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (1/1) ... [2025-01-09 04:36:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:29,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:36:29,257 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 04:36:29,266 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 04:36:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:36:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:36:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:36:29,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:36:29,411 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:36:29,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:36:30,534 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-09 04:36:30,534 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:36:30,555 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:36:30,555 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:36:30,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:30 BoogieIcfgContainer [2025-01-09 04:36:30,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:36:30,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:36:30,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:36:30,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:36:30,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:36:28" (1/3) ... [2025-01-09 04:36:30,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6671ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:30, skipping insertion in model container [2025-01-09 04:36:30,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:29" (2/3) ... [2025-01-09 04:36:30,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6671ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:30, skipping insertion in model container [2025-01-09 04:36:30,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:30" (3/3) ... [2025-01-09 04:36:30,565 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-01-09 04:36:30,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:36:30,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 305 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:36:30,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:36:30,658 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;@54d9b76c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:36:30,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:36:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 0 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 04:36:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 04:36:30,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:30,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:30,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:30,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash 574427721, now seen corresponding path program 1 times [2025-01-09 04:36:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954408983] [2025-01-09 04:36:30,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:30,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 04:36:30,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 04:36:30,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:30,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:31,363 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 04:36:31,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:31,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954408983] [2025-01-09 04:36:31,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954408983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111277027] [2025-01-09 04:36:31,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:31,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:31,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:31,397 INFO L87 Difference]: Start difference. First operand has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:31,610 INFO L93 Difference]: Finished difference Result 612 states and 1078 transitions. [2025-01-09 04:36:31,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:31,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-01-09 04:36:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:31,626 INFO L225 Difference]: With dead ends: 612 [2025-01-09 04:36:31,626 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 04:36:31,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:31,632 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 361 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:31,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 895 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 04:36:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2025-01-09 04:36:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.4959349593495934) internal successors, (736), 492 states have internal predecessors, (736), 0 states have call successors, (0), 0 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 04:36:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 736 transitions. [2025-01-09 04:36:31,692 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 736 transitions. Word has length 144 [2025-01-09 04:36:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:31,693 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 736 transitions. [2025-01-09 04:36:31,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 736 transitions. [2025-01-09 04:36:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 04:36:31,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:31,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:31,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:36:31,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:31,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 505056235, now seen corresponding path program 1 times [2025-01-09 04:36:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473091533] [2025-01-09 04:36:31,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:31,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 04:36:31,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 04:36:31,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:31,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:32,026 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 04:36:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:32,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473091533] [2025-01-09 04:36:32,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473091533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:32,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659609075] [2025-01-09 04:36:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:32,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:32,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:32,031 INFO L87 Difference]: Start difference. First operand 493 states and 736 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:32,146 INFO L93 Difference]: Finished difference Result 1063 states and 1633 transitions. [2025-01-09 04:36:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-01-09 04:36:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:32,154 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 04:36:32,154 INFO L226 Difference]: Without dead ends: 865 [2025-01-09 04:36:32,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:32,156 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 274 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:32,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 726 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-01-09 04:36:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2025-01-09 04:36:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.5081206496519721) internal successors, (1300), 862 states have internal predecessors, (1300), 0 states have call successors, (0), 0 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 04:36:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1300 transitions. [2025-01-09 04:36:32,198 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1300 transitions. Word has length 144 [2025-01-09 04:36:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:32,199 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1300 transitions. [2025-01-09 04:36:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1300 transitions. [2025-01-09 04:36:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 04:36:32,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:32,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:32,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:36:32,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:32,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash 459957428, now seen corresponding path program 1 times [2025-01-09 04:36:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297849198] [2025-01-09 04:36:32,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:32,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 04:36:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 04:36:32,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:32,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:32,884 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 04:36:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:32,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297849198] [2025-01-09 04:36:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297849198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:32,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:32,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:32,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596566338] [2025-01-09 04:36:32,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:32,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:32,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:32,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:32,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:32,890 INFO L87 Difference]: Start difference. First operand 863 states and 1300 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:33,087 INFO L93 Difference]: Finished difference Result 4182 states and 6281 transitions. [2025-01-09 04:36:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-01-09 04:36:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:33,104 INFO L225 Difference]: With dead ends: 4182 [2025-01-09 04:36:33,105 INFO L226 Difference]: Without dead ends: 3328 [2025-01-09 04:36:33,109 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 04:36:33,110 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1257 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:33,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1900 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2025-01-09 04:36:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 1668. [2025-01-09 04:36:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.4913017396520696) internal successors, (2486), 1667 states have internal predecessors, (2486), 0 states have call successors, (0), 0 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 04:36:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2486 transitions. [2025-01-09 04:36:33,185 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2486 transitions. Word has length 144 [2025-01-09 04:36:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:33,185 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2486 transitions. [2025-01-09 04:36:33,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2486 transitions. [2025-01-09 04:36:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 04:36:33,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:33,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:33,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:36:33,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:33,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1789583768, now seen corresponding path program 1 times [2025-01-09 04:36:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719904616] [2025-01-09 04:36:33,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:33,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 04:36:33,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 04:36:33,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:33,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:33,295 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 04:36:33,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:33,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719904616] [2025-01-09 04:36:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719904616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:33,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159131203] [2025-01-09 04:36:33,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:33,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:33,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:33,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:33,298 INFO L87 Difference]: Start difference. First operand 1668 states and 2486 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:33,331 INFO L93 Difference]: Finished difference Result 3310 states and 4929 transitions. [2025-01-09 04:36:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:33,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-01-09 04:36:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:33,339 INFO L225 Difference]: With dead ends: 3310 [2025-01-09 04:36:33,340 INFO L226 Difference]: Without dead ends: 1670 [2025-01-09 04:36:33,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:33,346 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:33,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-01-09 04:36:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2025-01-09 04:36:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.4907130017974835) internal successors, (2488), 1669 states have internal predecessors, (2488), 0 states have call successors, (0), 0 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 04:36:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2488 transitions. [2025-01-09 04:36:33,390 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2488 transitions. Word has length 145 [2025-01-09 04:36:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:33,391 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2488 transitions. [2025-01-09 04:36:33,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2488 transitions. [2025-01-09 04:36:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:36:33,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:33,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:36:33,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:33,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 338353525, now seen corresponding path program 1 times [2025-01-09 04:36:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716530753] [2025-01-09 04:36:33,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:33,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:36:33,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:36:33,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:33,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:33,920 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 04:36:33,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:33,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716530753] [2025-01-09 04:36:33,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716530753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:33,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:33,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422297054] [2025-01-09 04:36:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:33,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:33,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:33,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:33,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:33,923 INFO L87 Difference]: Start difference. First operand 1670 states and 2488 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:33,961 INFO L93 Difference]: Finished difference Result 3326 states and 4955 transitions. [2025-01-09 04:36:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-01-09 04:36:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:33,969 INFO L225 Difference]: With dead ends: 3326 [2025-01-09 04:36:33,969 INFO L226 Difference]: Without dead ends: 1670 [2025-01-09 04:36:33,972 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 04:36:33,973 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 20 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:33,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1394 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-01-09 04:36:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1669. [2025-01-09 04:36:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.4898081534772183) internal successors, (2485), 1668 states have internal predecessors, (2485), 0 states have call successors, (0), 0 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 04:36:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2485 transitions. [2025-01-09 04:36:34,020 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2485 transitions. Word has length 146 [2025-01-09 04:36:34,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:34,020 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2485 transitions. [2025-01-09 04:36:34,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2485 transitions. [2025-01-09 04:36:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:36:34,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:34,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:34,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:36:34,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2057553317, now seen corresponding path program 1 times [2025-01-09 04:36:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:34,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369091437] [2025-01-09 04:36:34,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:34,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:36:34,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:36:34,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:34,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:34,150 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 04:36:34,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:34,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369091437] [2025-01-09 04:36:34,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369091437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:34,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:34,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:34,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145282367] [2025-01-09 04:36:34,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:34,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:34,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:34,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:34,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:34,154 INFO L87 Difference]: Start difference. First operand 1669 states and 2485 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:34,217 INFO L93 Difference]: Finished difference Result 4401 states and 6556 transitions. [2025-01-09 04:36:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:34,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-01-09 04:36:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:34,231 INFO L225 Difference]: With dead ends: 4401 [2025-01-09 04:36:34,231 INFO L226 Difference]: Without dead ends: 2909 [2025-01-09 04:36:34,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:34,237 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 369 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:34,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1198 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2025-01-09 04:36:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2907. [2025-01-09 04:36:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2906 states have (on average 1.4686854783207157) internal successors, (4268), 2906 states have internal predecessors, (4268), 0 states have call successors, (0), 0 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 04:36:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4268 transitions. [2025-01-09 04:36:34,362 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 4268 transitions. Word has length 146 [2025-01-09 04:36:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:34,363 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 4268 transitions. [2025-01-09 04:36:34,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4268 transitions. [2025-01-09 04:36:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:36:34,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:34,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:34,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:36:34,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:34,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -720713928, now seen corresponding path program 1 times [2025-01-09 04:36:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:34,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722915449] [2025-01-09 04:36:34,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:34,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:36:34,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:36:34,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:34,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:34,860 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 04:36:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722915449] [2025-01-09 04:36:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722915449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:34,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:34,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71564286] [2025-01-09 04:36:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:34,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:34,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:34,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:34,863 INFO L87 Difference]: Start difference. First operand 2907 states and 4268 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:34,904 INFO L93 Difference]: Finished difference Result 5213 states and 7677 transitions. [2025-01-09 04:36:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-01-09 04:36:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:34,915 INFO L225 Difference]: With dead ends: 5213 [2025-01-09 04:36:34,916 INFO L226 Difference]: Without dead ends: 2473 [2025-01-09 04:36:34,920 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 04:36:34,921 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 23 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:34,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1398 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2025-01-09 04:36:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2473. [2025-01-09 04:36:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 1.468042071197411) internal successors, (3629), 2472 states have internal predecessors, (3629), 0 states have call successors, (0), 0 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 04:36:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3629 transitions. [2025-01-09 04:36:34,984 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3629 transitions. Word has length 146 [2025-01-09 04:36:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:34,984 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3629 transitions. [2025-01-09 04:36:34,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3629 transitions. [2025-01-09 04:36:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 04:36:34,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:34,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:34,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:36:34,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2082628409, now seen corresponding path program 1 times [2025-01-09 04:36:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:34,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271577087] [2025-01-09 04:36:34,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:35,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:36:35,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:36:35,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:35,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:35,118 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 04:36:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:35,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271577087] [2025-01-09 04:36:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271577087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:35,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055924756] [2025-01-09 04:36:35,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:35,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:35,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:35,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:35,121 INFO L87 Difference]: Start difference. First operand 2473 states and 3629 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:35,364 INFO L93 Difference]: Finished difference Result 6622 states and 9825 transitions. [2025-01-09 04:36:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:35,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-01-09 04:36:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:35,384 INFO L225 Difference]: With dead ends: 6622 [2025-01-09 04:36:35,384 INFO L226 Difference]: Without dead ends: 4572 [2025-01-09 04:36:35,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:35,389 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 296 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:35,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 756 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2025-01-09 04:36:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4570. [2025-01-09 04:36:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4570 states, 4569 states have (on average 1.4690304224119064) internal successors, (6712), 4569 states have internal predecessors, (6712), 0 states have call successors, (0), 0 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 04:36:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6712 transitions. [2025-01-09 04:36:35,500 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6712 transitions. Word has length 152 [2025-01-09 04:36:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:35,501 INFO L471 AbstractCegarLoop]: Abstraction has 4570 states and 6712 transitions. [2025-01-09 04:36:35,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6712 transitions. [2025-01-09 04:36:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 04:36:35,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:35,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:35,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:36:35,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:35,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash 243591764, now seen corresponding path program 1 times [2025-01-09 04:36:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:35,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036442016] [2025-01-09 04:36:35,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:35,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:36:35,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:36:35,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:35,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:35,882 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 04:36:35,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:35,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036442016] [2025-01-09 04:36:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036442016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:35,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486331192] [2025-01-09 04:36:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:35,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:35,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:35,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:35,884 INFO L87 Difference]: Start difference. First operand 4570 states and 6712 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:36,001 INFO L93 Difference]: Finished difference Result 11892 states and 17462 transitions. [2025-01-09 04:36:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:36,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-01-09 04:36:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:36,032 INFO L225 Difference]: With dead ends: 11892 [2025-01-09 04:36:36,035 INFO L226 Difference]: Without dead ends: 7349 [2025-01-09 04:36:36,042 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 04:36:36,043 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 377 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:36,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1877 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2025-01-09 04:36:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 7347. [2025-01-09 04:36:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7347 states, 7346 states have (on average 1.452627280152464) internal successors, (10671), 7346 states have internal predecessors, (10671), 0 states have call successors, (0), 0 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 04:36:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7347 states to 7347 states and 10671 transitions. [2025-01-09 04:36:36,287 INFO L78 Accepts]: Start accepts. Automaton has 7347 states and 10671 transitions. Word has length 152 [2025-01-09 04:36:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:36,287 INFO L471 AbstractCegarLoop]: Abstraction has 7347 states and 10671 transitions. [2025-01-09 04:36:36,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 7347 states and 10671 transitions. [2025-01-09 04:36:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 04:36:36,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:36,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:36,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:36:36,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:36,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash -781954579, now seen corresponding path program 1 times [2025-01-09 04:36:36,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:36,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965678114] [2025-01-09 04:36:36,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:36,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:36,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 04:36:36,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 04:36:36,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:36,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:36,436 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 04:36:36,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:36,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965678114] [2025-01-09 04:36:36,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965678114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:36,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:36,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474493099] [2025-01-09 04:36:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:36,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:36,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:36,438 INFO L87 Difference]: Start difference. First operand 7347 states and 10671 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:36,561 INFO L93 Difference]: Finished difference Result 18332 states and 26629 transitions. [2025-01-09 04:36:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-01-09 04:36:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:36,594 INFO L225 Difference]: With dead ends: 18332 [2025-01-09 04:36:36,594 INFO L226 Difference]: Without dead ends: 11458 [2025-01-09 04:36:36,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:36,608 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 367 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:36,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1191 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2025-01-09 04:36:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 11456. [2025-01-09 04:36:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11456 states, 11455 states have (on average 1.4302051505892623) internal successors, (16383), 11455 states have internal predecessors, (16383), 0 states have call successors, (0), 0 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 04:36:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11456 states to 11456 states and 16383 transitions. [2025-01-09 04:36:36,937 INFO L78 Accepts]: Start accepts. Automaton has 11456 states and 16383 transitions. Word has length 154 [2025-01-09 04:36:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:36,938 INFO L471 AbstractCegarLoop]: Abstraction has 11456 states and 16383 transitions. [2025-01-09 04:36:36,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11456 states and 16383 transitions. [2025-01-09 04:36:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 04:36:36,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:36,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:36,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:36:36,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:36,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1626762016, now seen corresponding path program 1 times [2025-01-09 04:36:36,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:36,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790093225] [2025-01-09 04:36:36,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:36,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 04:36:37,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 04:36:37,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:37,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:37,688 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 04:36:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790093225] [2025-01-09 04:36:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790093225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:36:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532926875] [2025-01-09 04:36:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:37,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:36:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:37,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:36:37,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:36:37,691 INFO L87 Difference]: Start difference. First operand 11456 states and 16383 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:38,001 INFO L93 Difference]: Finished difference Result 26982 states and 39603 transitions. [2025-01-09 04:36:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-01-09 04:36:38,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:38,054 INFO L225 Difference]: With dead ends: 26982 [2025-01-09 04:36:38,055 INFO L226 Difference]: Without dead ends: 21668 [2025-01-09 04:36:38,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:36:38,071 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 565 mSDsluCounter, 2409 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:38,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 2814 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21668 states. [2025-01-09 04:36:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21668 to 21666. [2025-01-09 04:36:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21666 states, 21665 states have (on average 1.4312947149780753) internal successors, (31009), 21665 states have internal predecessors, (31009), 0 states have call successors, (0), 0 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 04:36:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 31009 transitions. [2025-01-09 04:36:38,569 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 31009 transitions. Word has length 160 [2025-01-09 04:36:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:38,570 INFO L471 AbstractCegarLoop]: Abstraction has 21666 states and 31009 transitions. [2025-01-09 04:36:38,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 31009 transitions. [2025-01-09 04:36:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 04:36:38,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:38,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:38,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:36:38,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:38,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 145948848, now seen corresponding path program 1 times [2025-01-09 04:36:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212198392] [2025-01-09 04:36:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:38,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 04:36:38,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 04:36:38,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:38,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:38,888 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 04:36:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212198392] [2025-01-09 04:36:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212198392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715656617] [2025-01-09 04:36:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:38,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:38,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:38,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:38,892 INFO L87 Difference]: Start difference. First operand 21666 states and 31009 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:39,233 INFO L93 Difference]: Finished difference Result 34010 states and 50881 transitions. [2025-01-09 04:36:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-01-09 04:36:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:39,312 INFO L225 Difference]: With dead ends: 34010 [2025-01-09 04:36:39,313 INFO L226 Difference]: Without dead ends: 29512 [2025-01-09 04:36:39,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:36:39,334 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 844 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:39,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1997 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29512 states. [2025-01-09 04:36:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29512 to 25026. [2025-01-09 04:36:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25026 states, 25025 states have (on average 1.4537862137862139) internal successors, (36381), 25025 states have internal predecessors, (36381), 0 states have call successors, (0), 0 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 04:36:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 36381 transitions. [2025-01-09 04:36:40,176 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 36381 transitions. Word has length 160 [2025-01-09 04:36:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:40,177 INFO L471 AbstractCegarLoop]: Abstraction has 25026 states and 36381 transitions. [2025-01-09 04:36:40,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 36381 transitions. [2025-01-09 04:36:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 04:36:40,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:40,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:40,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:36:40,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1252114169, now seen corresponding path program 1 times [2025-01-09 04:36:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69380856] [2025-01-09 04:36:40,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:40,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 04:36:40,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 04:36:40,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:40,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:40,539 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 04:36:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69380856] [2025-01-09 04:36:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69380856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:40,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:40,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:40,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548889079] [2025-01-09 04:36:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:40,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:40,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:40,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:40,541 INFO L87 Difference]: Start difference. First operand 25026 states and 36381 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:40,715 INFO L93 Difference]: Finished difference Result 35294 states and 52663 transitions. [2025-01-09 04:36:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:40,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-01-09 04:36:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:40,773 INFO L225 Difference]: With dead ends: 35294 [2025-01-09 04:36:40,773 INFO L226 Difference]: Without dead ends: 25028 [2025-01-09 04:36:40,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 04:36:40,793 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 539 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:40,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 892 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2025-01-09 04:36:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 25026. [2025-01-09 04:36:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25026 states, 25025 states have (on average 1.4467532467532467) internal successors, (36205), 25025 states have internal predecessors, (36205), 0 states have call successors, (0), 0 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 04:36:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 36205 transitions. [2025-01-09 04:36:41,408 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 36205 transitions. Word has length 160 [2025-01-09 04:36:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:41,408 INFO L471 AbstractCegarLoop]: Abstraction has 25026 states and 36205 transitions. [2025-01-09 04:36:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 36205 transitions. [2025-01-09 04:36:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 04:36:41,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:41,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:41,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:36:41,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash -93042081, now seen corresponding path program 1 times [2025-01-09 04:36:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354899865] [2025-01-09 04:36:41,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:41,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 04:36:41,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 04:36:41,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:41,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:41,843 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 04:36:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354899865] [2025-01-09 04:36:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354899865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:41,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:41,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275414499] [2025-01-09 04:36:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:41,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:41,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:41,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:41,847 INFO L87 Difference]: Start difference. First operand 25026 states and 36205 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:42,139 INFO L93 Difference]: Finished difference Result 96710 states and 139424 transitions. [2025-01-09 04:36:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:42,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-01-09 04:36:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:42,314 INFO L225 Difference]: With dead ends: 96710 [2025-01-09 04:36:42,315 INFO L226 Difference]: Without dead ends: 71735 [2025-01-09 04:36:42,368 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 04:36:42,368 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 812 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:42,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1504 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71735 states. [2025-01-09 04:36:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71735 to 48383. [2025-01-09 04:36:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48383 states, 48382 states have (on average 1.4286511512545987) internal successors, (69121), 48382 states have internal predecessors, (69121), 0 states have call successors, (0), 0 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 04:36:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48383 states to 48383 states and 69121 transitions. [2025-01-09 04:36:43,735 INFO L78 Accepts]: Start accepts. Automaton has 48383 states and 69121 transitions. Word has length 160 [2025-01-09 04:36:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:43,735 INFO L471 AbstractCegarLoop]: Abstraction has 48383 states and 69121 transitions. [2025-01-09 04:36:43,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 48383 states and 69121 transitions. [2025-01-09 04:36:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 04:36:43,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:43,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:43,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:36:43,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:43,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash 521996501, now seen corresponding path program 1 times [2025-01-09 04:36:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:43,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609188037] [2025-01-09 04:36:43,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:43,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 04:36:43,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 04:36:43,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:43,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:43,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609188037] [2025-01-09 04:36:43,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609188037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:43,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:43,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:43,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889145334] [2025-01-09 04:36:43,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:43,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:43,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:43,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:43,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:43,890 INFO L87 Difference]: Start difference. First operand 48383 states and 69121 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:44,184 INFO L93 Difference]: Finished difference Result 96667 states and 138110 transitions. [2025-01-09 04:36:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-01-09 04:36:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:44,320 INFO L225 Difference]: With dead ends: 96667 [2025-01-09 04:36:44,321 INFO L226 Difference]: Without dead ends: 48389 [2025-01-09 04:36:44,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:44,378 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:44,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48389 states. [2025-01-09 04:36:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48389 to 48389. [2025-01-09 04:36:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48389 states, 48388 states have (on average 1.4285979995040092) internal successors, (69127), 48388 states have internal predecessors, (69127), 0 states have call successors, (0), 0 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 04:36:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48389 states to 48389 states and 69127 transitions. [2025-01-09 04:36:45,599 INFO L78 Accepts]: Start accepts. Automaton has 48389 states and 69127 transitions. Word has length 161 [2025-01-09 04:36:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:45,599 INFO L471 AbstractCegarLoop]: Abstraction has 48389 states and 69127 transitions. [2025-01-09 04:36:45,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 48389 states and 69127 transitions. [2025-01-09 04:36:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:36:45,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:45,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:36:45,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -239709974, now seen corresponding path program 1 times [2025-01-09 04:36:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808500984] [2025-01-09 04:36:45,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:45,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:36:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:36:45,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:45,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:45,731 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 04:36:45,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:45,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808500984] [2025-01-09 04:36:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808500984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:45,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:45,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079640960] [2025-01-09 04:36:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:45,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:45,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:45,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:45,733 INFO L87 Difference]: Start difference. First operand 48389 states and 69127 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:46,402 INFO L93 Difference]: Finished difference Result 130318 states and 185462 transitions. [2025-01-09 04:36:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:46,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-09 04:36:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:46,624 INFO L225 Difference]: With dead ends: 130318 [2025-01-09 04:36:46,625 INFO L226 Difference]: Without dead ends: 82872 [2025-01-09 04:36:46,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:46,687 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 356 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:46,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1208 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82872 states. [2025-01-09 04:36:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82872 to 82870. [2025-01-09 04:36:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82870 states, 82869 states have (on average 1.4027440900698693) internal successors, (116244), 82869 states have internal predecessors, (116244), 0 states have call successors, (0), 0 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 04:36:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82870 states to 82870 states and 116244 transitions. [2025-01-09 04:36:48,429 INFO L78 Accepts]: Start accepts. Automaton has 82870 states and 116244 transitions. Word has length 162 [2025-01-09 04:36:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:48,429 INFO L471 AbstractCegarLoop]: Abstraction has 82870 states and 116244 transitions. [2025-01-09 04:36:48,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 82870 states and 116244 transitions. [2025-01-09 04:36:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:36:48,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:48,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:48,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:36:48,473 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:48,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1156613561, now seen corresponding path program 1 times [2025-01-09 04:36:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:48,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407680909] [2025-01-09 04:36:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:48,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:36:48,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:36:48,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:48,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:48,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:48,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407680909] [2025-01-09 04:36:48,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407680909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:48,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921796719] [2025-01-09 04:36:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:48,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:48,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:48,978 INFO L87 Difference]: Start difference. First operand 82870 states and 116244 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:49,542 INFO L93 Difference]: Finished difference Result 153820 states and 216042 transitions. [2025-01-09 04:36:49,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:49,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-09 04:36:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:49,671 INFO L225 Difference]: With dead ends: 153820 [2025-01-09 04:36:49,671 INFO L226 Difference]: Without dead ends: 71775 [2025-01-09 04:36:49,745 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 04:36:49,746 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 15 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:49,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71775 states. [2025-01-09 04:36:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71775 to 71775. [2025-01-09 04:36:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71775 states, 71774 states have (on average 1.4041853596009697) internal successors, (100784), 71774 states have internal predecessors, (100784), 0 states have call successors, (0), 0 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 04:36:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71775 states to 71775 states and 100784 transitions. [2025-01-09 04:36:50,988 INFO L78 Accepts]: Start accepts. Automaton has 71775 states and 100784 transitions. Word has length 162 [2025-01-09 04:36:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:50,988 INFO L471 AbstractCegarLoop]: Abstraction has 71775 states and 100784 transitions. [2025-01-09 04:36:50,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 71775 states and 100784 transitions. [2025-01-09 04:36:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:36:51,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:51,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:51,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:36:51,024 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1760978964, now seen corresponding path program 1 times [2025-01-09 04:36:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:51,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504441963] [2025-01-09 04:36:51,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:51,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:36:51,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:36:51,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:51,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:51,182 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 04:36:51,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:51,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504441963] [2025-01-09 04:36:51,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504441963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:51,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:51,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:51,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915200368] [2025-01-09 04:36:51,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:51,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:51,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:51,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:51,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:51,189 INFO L87 Difference]: Start difference. First operand 71775 states and 100784 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:52,110 INFO L93 Difference]: Finished difference Result 177435 states and 265970 transitions. [2025-01-09 04:36:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:36:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-01-09 04:36:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:52,387 INFO L225 Difference]: With dead ends: 177435 [2025-01-09 04:36:52,387 INFO L226 Difference]: Without dead ends: 141993 [2025-01-09 04:36:52,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 04:36:52,453 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1290 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:52,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1703 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141993 states. [2025-01-09 04:36:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141993 to 99951. [2025-01-09 04:36:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99951 states, 99950 states have (on average 1.439719859929965) internal successors, (143900), 99950 states have internal predecessors, (143900), 0 states have call successors, (0), 0 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 04:36:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99951 states to 99951 states and 143900 transitions. [2025-01-09 04:36:54,596 INFO L78 Accepts]: Start accepts. Automaton has 99951 states and 143900 transitions. Word has length 168 [2025-01-09 04:36:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:54,596 INFO L471 AbstractCegarLoop]: Abstraction has 99951 states and 143900 transitions. [2025-01-09 04:36:54,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 99951 states and 143900 transitions. [2025-01-09 04:36:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:36:54,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:54,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:54,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:36:54,633 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:54,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 699483931, now seen corresponding path program 1 times [2025-01-09 04:36:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:54,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562125923] [2025-01-09 04:36:54,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:54,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:36:54,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:36:54,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:54,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:54,813 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 04:36:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:54,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562125923] [2025-01-09 04:36:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562125923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:54,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834906511] [2025-01-09 04:36:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:54,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:54,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:54,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:54,819 INFO L87 Difference]: Start difference. First operand 99951 states and 143900 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:55,807 INFO L93 Difference]: Finished difference Result 167015 states and 248076 transitions. [2025-01-09 04:36:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:55,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-01-09 04:36:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:56,096 INFO L225 Difference]: With dead ends: 167015 [2025-01-09 04:36:56,097 INFO L226 Difference]: Without dead ends: 141461 [2025-01-09 04:36:56,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:36:56,132 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 799 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:56,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1690 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141461 states. [2025-01-09 04:36:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141461 to 109551. [2025-01-09 04:36:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109551 states, 109550 states have (on average 1.4492743039707896) internal successors, (158768), 109550 states have internal predecessors, (158768), 0 states have call successors, (0), 0 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 04:36:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109551 states to 109551 states and 158768 transitions. [2025-01-09 04:36:58,093 INFO L78 Accepts]: Start accepts. Automaton has 109551 states and 158768 transitions. Word has length 168 [2025-01-09 04:36:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:58,093 INFO L471 AbstractCegarLoop]: Abstraction has 109551 states and 158768 transitions. [2025-01-09 04:36:58,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 109551 states and 158768 transitions. [2025-01-09 04:36:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:36:58,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:58,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:58,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:36:58,120 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:58,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1542004675, now seen corresponding path program 1 times [2025-01-09 04:36:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175044687] [2025-01-09 04:36:58,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:58,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:36:58,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:36:58,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:58,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:58,825 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 04:36:58,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175044687] [2025-01-09 04:36:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175044687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:58,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:58,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:36:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71033379] [2025-01-09 04:36:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:58,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:36:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:58,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:36:58,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:36:58,827 INFO L87 Difference]: Start difference. First operand 109551 states and 158768 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:59,379 INFO L93 Difference]: Finished difference Result 178451 states and 264562 transitions. [2025-01-09 04:36:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-01-09 04:36:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:59,552 INFO L225 Difference]: With dead ends: 178451 [2025-01-09 04:36:59,552 INFO L226 Difference]: Without dead ends: 109553 [2025-01-09 04:36:59,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:36:59,628 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 657 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:59,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1233 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109553 states. [2025-01-09 04:37:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109553 to 103151. [2025-01-09 04:37:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103151 states, 103150 states have (on average 1.4365874939408627) internal successors, (148184), 103150 states have internal predecessors, (148184), 0 states have call successors, (0), 0 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 04:37:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103151 states to 103151 states and 148184 transitions. [2025-01-09 04:37:01,414 INFO L78 Accepts]: Start accepts. Automaton has 103151 states and 148184 transitions. Word has length 168 [2025-01-09 04:37:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:01,415 INFO L471 AbstractCegarLoop]: Abstraction has 103151 states and 148184 transitions. [2025-01-09 04:37:01,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 103151 states and 148184 transitions. [2025-01-09 04:37:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:37:01,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:01,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:01,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:37:01,450 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:37:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -685642807, now seen corresponding path program 1 times [2025-01-09 04:37:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:01,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744750178] [2025-01-09 04:37:01,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:01,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:37:01,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:37:01,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:01,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:01,908 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 04:37:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744750178] [2025-01-09 04:37:01,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744750178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:01,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:37:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462087754] [2025-01-09 04:37:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:01,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:37:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:01,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:37:01,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:37:01,910 INFO L87 Difference]: Start difference. First operand 103151 states and 148184 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:02,948 INFO L93 Difference]: Finished difference Result 193259 states and 277685 transitions. [2025-01-09 04:37:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:37:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-01-09 04:37:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:03,087 INFO L225 Difference]: With dead ends: 193259 [2025-01-09 04:37:03,088 INFO L226 Difference]: Without dead ends: 103151 [2025-01-09 04:37:03,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:37:03,141 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 2842 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:03,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 622 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:37:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103151 states. [2025-01-09 04:37:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103151 to 103151. [2025-01-09 04:37:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103151 states, 103150 states have (on average 1.4187300048473097) internal successors, (146342), 103150 states have internal predecessors, (146342), 0 states have call successors, (0), 0 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 04:37:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103151 states to 103151 states and 146342 transitions. [2025-01-09 04:37:04,904 INFO L78 Accepts]: Start accepts. Automaton has 103151 states and 146342 transitions. Word has length 168 [2025-01-09 04:37:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:04,904 INFO L471 AbstractCegarLoop]: Abstraction has 103151 states and 146342 transitions. [2025-01-09 04:37:04,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 103151 states and 146342 transitions. [2025-01-09 04:37:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:37:04,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:04,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:04,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:37:04,928 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:37:04,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1392447726, now seen corresponding path program 1 times [2025-01-09 04:37:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341487888] [2025-01-09 04:37:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:04,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:37:05,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:37:05,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:05,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:05,190 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 04:37:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:05,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341487888] [2025-01-09 04:37:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341487888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:05,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:05,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:37:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711552193] [2025-01-09 04:37:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:05,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:37:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:05,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:37:05,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:37:05,193 INFO L87 Difference]: Start difference. First operand 103151 states and 146342 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:05,610 INFO L93 Difference]: Finished difference Result 167215 states and 237080 transitions. [2025-01-09 04:37:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:37:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-01-09 04:37:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:05,722 INFO L225 Difference]: With dead ends: 167215 [2025-01-09 04:37:05,722 INFO L226 Difference]: Without dead ends: 91247 [2025-01-09 04:37:05,789 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 04:37:05,791 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 363 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:05,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1461 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:37:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91247 states. [2025-01-09 04:37:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91247 to 91080. [2025-01-09 04:37:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91080 states, 91079 states have (on average 1.4143435918268756) internal successors, (128817), 91079 states have internal predecessors, (128817), 0 states have call successors, (0), 0 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 04:37:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91080 states to 91080 states and 128817 transitions. [2025-01-09 04:37:07,648 INFO L78 Accepts]: Start accepts. Automaton has 91080 states and 128817 transitions. Word has length 168 [2025-01-09 04:37:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:07,648 INFO L471 AbstractCegarLoop]: Abstraction has 91080 states and 128817 transitions. [2025-01-09 04:37:07,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 91080 states and 128817 transitions. [2025-01-09 04:37:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 04:37:07,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:07,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:07,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:37:07,674 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:37:07,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash -462245595, now seen corresponding path program 1 times [2025-01-09 04:37:07,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:07,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708114444] [2025-01-09 04:37:07,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:07,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:07,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 04:37:07,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 04:37:07,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:07,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:07,738 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 04:37:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708114444] [2025-01-09 04:37:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708114444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:37:07,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666933081] [2025-01-09 04:37:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:07,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:37:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:07,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:37:07,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:07,740 INFO L87 Difference]: Start difference. First operand 91080 states and 128817 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:08,153 INFO L93 Difference]: Finished difference Result 204070 states and 288193 transitions. [2025-01-09 04:37:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:37:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2025-01-09 04:37:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:08,345 INFO L225 Difference]: With dead ends: 204070 [2025-01-09 04:37:08,345 INFO L226 Difference]: Without dead ends: 134990 [2025-01-09 04:37:08,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:08,422 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 396 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:08,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1158 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:37:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134990 states. [2025-01-09 04:37:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134990 to 91080. [2025-01-09 04:37:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91080 states, 91079 states have (on average 1.4143106533888163) internal successors, (128814), 91079 states have internal predecessors, (128814), 0 states have call successors, (0), 0 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 04:37:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91080 states to 91080 states and 128814 transitions. [2025-01-09 04:37:10,286 INFO L78 Accepts]: Start accepts. Automaton has 91080 states and 128814 transitions. Word has length 169 [2025-01-09 04:37:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:10,286 INFO L471 AbstractCegarLoop]: Abstraction has 91080 states and 128814 transitions. [2025-01-09 04:37:10,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 91080 states and 128814 transitions. [2025-01-09 04:37:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 04:37:10,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:10,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:10,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:37:10,320 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:37:10,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1988174699, now seen corresponding path program 1 times [2025-01-09 04:37:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253897851] [2025-01-09 04:37:10,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:10,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 04:37:10,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 04:37:10,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:10,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:10,559 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 04:37:10,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253897851] [2025-01-09 04:37:10,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253897851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:37:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278562045] [2025-01-09 04:37:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:10,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:37:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:10,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:37:10,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:37:10,563 INFO L87 Difference]: Start difference. First operand 91080 states and 128814 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:11,485 INFO L93 Difference]: Finished difference Result 193471 states and 273776 transitions. [2025-01-09 04:37:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:37:11,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-01-09 04:37:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:11,649 INFO L225 Difference]: With dead ends: 193471 [2025-01-09 04:37:11,650 INFO L226 Difference]: Without dead ends: 125167 [2025-01-09 04:37:11,699 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 04:37:11,700 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 726 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:11,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1428 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:37:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125167 states. [2025-01-09 04:37:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125167 to 91231. [2025-01-09 04:37:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91231 states, 91230 states have (on average 1.4139098980598488) internal successors, (128991), 91230 states have internal predecessors, (128991), 0 states have call successors, (0), 0 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 04:37:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91231 states to 91231 states and 128991 transitions. [2025-01-09 04:37:13,360 INFO L78 Accepts]: Start accepts. Automaton has 91231 states and 128991 transitions. Word has length 170 [2025-01-09 04:37:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:13,360 INFO L471 AbstractCegarLoop]: Abstraction has 91231 states and 128991 transitions. [2025-01-09 04:37:13,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 91231 states and 128991 transitions. [2025-01-09 04:37:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:13,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:13,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:13,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:37:13,387 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:37:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -419745207, now seen corresponding path program 1 times [2025-01-09 04:37:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491538106] [2025-01-09 04:37:13,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:13,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:13,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:13,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:13,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:13,449 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 04:37:13,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:13,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491538106] [2025-01-09 04:37:13,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491538106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:13,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:13,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:37:13,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781942166] [2025-01-09 04:37:13,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:13,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:37:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:13,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:37:13,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:13,451 INFO L87 Difference]: Start difference. First operand 91231 states and 128991 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:14,260 INFO L93 Difference]: Finished difference Result 182066 states and 257504 transitions. [2025-01-09 04:37:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:37:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:14,355 INFO L225 Difference]: With dead ends: 182066 [2025-01-09 04:37:14,355 INFO L226 Difference]: Without dead ends: 91253 [2025-01-09 04:37:14,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:14,392 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:14,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 858 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:37:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91253 states. [2025-01-09 04:37:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91253 to 91253. [2025-01-09 04:37:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91253 states, 91252 states have (on average 1.4138101082715995) internal successors, (129013), 91252 states have internal predecessors, (129013), 0 states have call successors, (0), 0 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 04:37:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91253 states to 91253 states and 129013 transitions. [2025-01-09 04:37:15,561 INFO L78 Accepts]: Start accepts. Automaton has 91253 states and 129013 transitions. Word has length 171 [2025-01-09 04:37:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:15,562 INFO L471 AbstractCegarLoop]: Abstraction has 91253 states and 129013 transitions. [2025-01-09 04:37:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 91253 states and 129013 transitions. [2025-01-09 04:37:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 04:37:15,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:15,588 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] [2025-01-09 04:37:15,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:37:15,588 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:37:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1437606036, now seen corresponding path program 1 times [2025-01-09 04:37:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785912696] [2025-01-09 04:37:15,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 04:37:15,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 04:37:15,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:15,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:15,860 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 04:37:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:15,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785912696] [2025-01-09 04:37:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785912696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:37:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822909089] [2025-01-09 04:37:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:15,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:37:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:15,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:37:15,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:37:15,863 INFO L87 Difference]: Start difference. First operand 91253 states and 129013 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 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 04:37:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:16,649 INFO L93 Difference]: Finished difference Result 182371 states and 257838 transitions. [2025-01-09 04:37:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:37:16,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-01-09 04:37:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:16,777 INFO L225 Difference]: With dead ends: 182371 [2025-01-09 04:37:16,777 INFO L226 Difference]: Without dead ends: 91231 [2025-01-09 04:37:16,814 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 04:37:16,814 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 4 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:16,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1324 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:37:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91231 states. [2025-01-09 04:37:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91231 to 91225. [2025-01-09 04:37:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91225 states, 91224 states have (on average 1.4137836534245374) internal successors, (128971), 91224 states have internal predecessors, (128971), 0 states have call successors, (0), 0 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 04:37:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91225 states to 91225 states and 128971 transitions. [2025-01-09 04:37:18,306 INFO L78 Accepts]: Start accepts. Automaton has 91225 states and 128971 transitions. Word has length 172 [2025-01-09 04:37:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:18,306 INFO L471 AbstractCegarLoop]: Abstraction has 91225 states and 128971 transitions. [2025-01-09 04:37:18,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 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 04:37:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 91225 states and 128971 transitions. [2025-01-09 04:37:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 04:37:18,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:18,330 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] [2025-01-09 04:37:18,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:37:18,330 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:37:18,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1590934886, now seen corresponding path program 1 times [2025-01-09 04:37:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:18,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364052945] [2025-01-09 04:37:18,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:18,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:18,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 04:37:18,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 04:37:18,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:18,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:18,583 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 04:37:18,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:18,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364052945] [2025-01-09 04:37:18,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364052945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:18,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:18,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:37:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450482763] [2025-01-09 04:37:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:18,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:37:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:18,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:37:18,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:37:18,585 INFO L87 Difference]: Start difference. First operand 91225 states and 128971 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 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 04:37:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:19,035 INFO L93 Difference]: Finished difference Result 170403 states and 240737 transitions. [2025-01-09 04:37:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:37:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-01-09 04:37:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:19,163 INFO L225 Difference]: With dead ends: 170403 [2025-01-09 04:37:19,164 INFO L226 Difference]: Without dead ends: 79515 [2025-01-09 04:37:19,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:37:19,243 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 363 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:19,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1726 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:37:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79515 states.