./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_lcr-var-start-time.5.2.ufo.UNBOUNDED.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 eb6a86313c6847913ca8b6f4f78c128447d9c9cbacc492e7ef1a5540e3f6a711 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:36:29,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:36:30,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:36:30,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:36:30,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:36:30,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:36:30,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:36:30,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:36:30,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:36:30,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:36:30,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:36:30,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:36:30,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:36:30,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:36:30,042 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:36:30,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:36:30,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:36:30,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:36:30,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:36:30,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:36:30,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:36:30,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:36:30,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:36:30,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:36:30,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:36:30,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:36:30,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:36:30,048 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 -> eb6a86313c6847913ca8b6f4f78c128447d9c9cbacc492e7ef1a5540e3f6a711 [2025-02-05 16:36:30,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:36:30,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:36:30,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:36:30,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:36:30,352 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:36:30,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:36:31,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd99fea41/dc0335d7df7e4ba38c72580d01a01e67/FLAG3aa1c175e [2025-02-05 16:36:31,714 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:36:31,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:36:31,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd99fea41/dc0335d7df7e4ba38c72580d01a01e67/FLAG3aa1c175e [2025-02-05 16:36:32,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd99fea41/dc0335d7df7e4ba38c72580d01a01e67 [2025-02-05 16:36:32,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:36:32,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:36:32,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:36:32,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:36:32,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:36:32,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32, skipping insertion in model container [2025-02-05 16:36:32,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:36:32,217 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_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2025-02-05 16:36:32,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:36:32,286 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:36:32,320 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_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2025-02-05 16:36:32,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:36:32,358 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:36:32,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32 WrapperNode [2025-02-05 16:36:32,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:36:32,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:36:32,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:36:32,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:36:32,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,399 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 838 [2025-02-05 16:36:32,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:36:32,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:36:32,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:36:32,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:36:32,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,422 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-02-05 16:36:32,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:36:32,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:36:32,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:36:32,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:36:32,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (1/1) ... [2025-02-05 16:36:32,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:36:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:36:32,459 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-02-05 16:36:32,461 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-02-05 16:36:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:36:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:36:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:36:32,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:36:32,570 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:36:32,572 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:36:33,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L647: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1113: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1201: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:33,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L906: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L824: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: havoc main_~node2__m2~2#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: havoc main_~node3__m3~2#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1157: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:33,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4__m4~2#1; [2025-02-05 16:36:33,262 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-02-05 16:36:33,262 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:36:33,276 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:36:33,276 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:36:33,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:36:33 BoogieIcfgContainer [2025-02-05 16:36:33,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:36:33,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:36:33,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:36:33,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:36:33,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:36:32" (1/3) ... [2025-02-05 16:36:33,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd8824b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:36:33, skipping insertion in model container [2025-02-05 16:36:33,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:32" (2/3) ... [2025-02-05 16:36:33,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd8824b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:36:33, skipping insertion in model container [2025-02-05 16:36:33,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:36:33" (3/3) ... [2025-02-05 16:36:33,283 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:36:33,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:36:33,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 206 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:36:33,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:36:33,394 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;@15c849fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:36:33,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:36:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.7205882352941178) internal successors, (351), 205 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:36:33,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:33,412 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] [2025-02-05 16:36:33,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash -825751310, now seen corresponding path program 1 times [2025-02-05 16:36:33,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063896823] [2025-02-05 16:36:33,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:33,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:36:33,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:36:33,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:33,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063896823] [2025-02-05 16:36:33,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063896823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:33,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062546432] [2025-02-05 16:36:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:33,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:33,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:33,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:33,967 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.7205882352941178) internal successors, (351), 205 states have internal predecessors, (351), 0 states have call successors, (0), 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 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:34,352 INFO L93 Difference]: Finished difference Result 828 states and 1339 transitions. [2025-02-05 16:36:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:34,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 16:36:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:34,362 INFO L225 Difference]: With dead ends: 828 [2025-02-05 16:36:34,362 INFO L226 Difference]: Without dead ends: 713 [2025-02-05 16:36:34,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:36:34,366 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 2286 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:34,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2286 Valid, 2610 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-02-05 16:36:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 314. [2025-02-05 16:36:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 1.5047923322683705) internal successors, (471), 313 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 471 transitions. [2025-02-05 16:36:34,405 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 471 transitions. Word has length 79 [2025-02-05 16:36:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:34,405 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 471 transitions. [2025-02-05 16:36:34,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 471 transitions. [2025-02-05 16:36:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:36:34,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:34,407 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] [2025-02-05 16:36:34,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:36:34,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:34,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 172473583, now seen corresponding path program 1 times [2025-02-05 16:36:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086489188] [2025-02-05 16:36:34,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:34,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:36:34,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:36:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:34,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:34,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086489188] [2025-02-05 16:36:34,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086489188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:34,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:34,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398814220] [2025-02-05 16:36:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:34,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:34,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:34,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:34,737 INFO L87 Difference]: Start difference. First operand 314 states and 471 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:34,911 INFO L93 Difference]: Finished difference Result 1370 states and 2124 transitions. [2025-02-05 16:36:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 16:36:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:34,915 INFO L225 Difference]: With dead ends: 1370 [2025-02-05 16:36:34,915 INFO L226 Difference]: Without dead ends: 1132 [2025-02-05 16:36:34,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:34,917 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1147 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:34,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 1492 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-02-05 16:36:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1124. [2025-02-05 16:36:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1123 states have (on average 1.545859305431879) internal successors, (1736), 1123 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1736 transitions. [2025-02-05 16:36:34,946 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1736 transitions. Word has length 80 [2025-02-05 16:36:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:34,946 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1736 transitions. [2025-02-05 16:36:34,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1736 transitions. [2025-02-05 16:36:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:36:34,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:34,949 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] [2025-02-05 16:36:34,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:36:34,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:34,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1311177295, now seen corresponding path program 1 times [2025-02-05 16:36:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950226420] [2025-02-05 16:36:34,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:34,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:36:34,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:36:34,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:34,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950226420] [2025-02-05 16:36:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950226420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:35,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:35,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:36:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114619288] [2025-02-05 16:36:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:35,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:36:35,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:35,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:36:35,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:36:35,123 INFO L87 Difference]: Start difference. First operand 1124 states and 1736 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:35,354 INFO L93 Difference]: Finished difference Result 3048 states and 4766 transitions. [2025-02-05 16:36:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:36:35,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:36:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:35,361 INFO L225 Difference]: With dead ends: 3048 [2025-02-05 16:36:35,361 INFO L226 Difference]: Without dead ends: 1978 [2025-02-05 16:36:35,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:35,364 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1143 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:35,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 285 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2025-02-05 16:36:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1976. [2025-02-05 16:36:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 1.5559493670886075) internal successors, (3073), 1975 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 3073 transitions. [2025-02-05 16:36:35,430 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 3073 transitions. Word has length 81 [2025-02-05 16:36:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:35,430 INFO L471 AbstractCegarLoop]: Abstraction has 1976 states and 3073 transitions. [2025-02-05 16:36:35,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 3073 transitions. [2025-02-05 16:36:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:36:35,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:35,434 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] [2025-02-05 16:36:35,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:36:35,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:35,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1920072969, now seen corresponding path program 1 times [2025-02-05 16:36:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:35,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132487895] [2025-02-05 16:36:35,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:35,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:36:35,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:36:35,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:35,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:35,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132487895] [2025-02-05 16:36:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132487895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:35,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:36:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147599170] [2025-02-05 16:36:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:35,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:36:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:35,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:36:35,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:36:35,568 INFO L87 Difference]: Start difference. First operand 1976 states and 3073 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:35,775 INFO L93 Difference]: Finished difference Result 5381 states and 8433 transitions. [2025-02-05 16:36:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:36:35,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:36:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:35,786 INFO L225 Difference]: With dead ends: 5381 [2025-02-05 16:36:35,786 INFO L226 Difference]: Without dead ends: 3512 [2025-02-05 16:36:35,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:35,789 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 1073 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:35,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 289 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2025-02-05 16:36:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3510. [2025-02-05 16:36:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3509 states have (on average 1.5577087489313195) internal successors, (5466), 3509 states have internal predecessors, (5466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5466 transitions. [2025-02-05 16:36:35,852 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5466 transitions. Word has length 81 [2025-02-05 16:36:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:35,852 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5466 transitions. [2025-02-05 16:36:35,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5466 transitions. [2025-02-05 16:36:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:36:35,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:35,854 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] [2025-02-05 16:36:35,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:36:35,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:35,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash -68045237, now seen corresponding path program 1 times [2025-02-05 16:36:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:35,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817612621] [2025-02-05 16:36:35,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:35,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:36:35,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:36:35,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:35,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:36,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:36,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817612621] [2025-02-05 16:36:36,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817612621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:36,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:36,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:36:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027079939] [2025-02-05 16:36:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:36,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:36:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:36,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:36:36,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:36:36,019 INFO L87 Difference]: Start difference. First operand 3510 states and 5466 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:36,232 INFO L93 Difference]: Finished difference Result 9921 states and 15547 transitions. [2025-02-05 16:36:36,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:36:36,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:36:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:36,252 INFO L225 Difference]: With dead ends: 9921 [2025-02-05 16:36:36,252 INFO L226 Difference]: Without dead ends: 6552 [2025-02-05 16:36:36,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:36,259 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1059 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:36,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 298 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2025-02-05 16:36:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 6550. [2025-02-05 16:36:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6550 states, 6549 states have (on average 1.5594747289662545) internal successors, (10213), 6549 states have internal predecessors, (10213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 10213 transitions. [2025-02-05 16:36:36,395 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 10213 transitions. Word has length 81 [2025-02-05 16:36:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:36,396 INFO L471 AbstractCegarLoop]: Abstraction has 6550 states and 10213 transitions. [2025-02-05 16:36:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 10213 transitions. [2025-02-05 16:36:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:36:36,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:36,399 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] [2025-02-05 16:36:36,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:36:36,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 698096035, now seen corresponding path program 1 times [2025-02-05 16:36:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:36,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418240793] [2025-02-05 16:36:36,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:36,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:36:36,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:36:36,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:36,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418240793] [2025-02-05 16:36:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418240793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:36:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031233670] [2025-02-05 16:36:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:36,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:36:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:36,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:36:36,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:36:36,496 INFO L87 Difference]: Start difference. First operand 6550 states and 10213 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:36,724 INFO L93 Difference]: Finished difference Result 19201 states and 30018 transitions. [2025-02-05 16:36:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:36:36,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 16:36:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:36,760 INFO L225 Difference]: With dead ends: 19201 [2025-02-05 16:36:36,760 INFO L226 Difference]: Without dead ends: 12728 [2025-02-05 16:36:36,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:36,772 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1097 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:36,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 285 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12728 states. [2025-02-05 16:36:36,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12728 to 12726. [2025-02-05 16:36:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12726 states, 12725 states have (on average 1.5544990176817288) internal successors, (19781), 12725 states have internal predecessors, (19781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12726 states to 12726 states and 19781 transitions. [2025-02-05 16:36:37,004 INFO L78 Accepts]: Start accepts. Automaton has 12726 states and 19781 transitions. Word has length 81 [2025-02-05 16:36:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:37,004 INFO L471 AbstractCegarLoop]: Abstraction has 12726 states and 19781 transitions. [2025-02-05 16:36:37,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states and 19781 transitions. [2025-02-05 16:36:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:36:37,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:37,007 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] [2025-02-05 16:36:37,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:36:37,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:37,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:37,008 INFO L85 PathProgramCache]: Analyzing trace with hash 443302902, now seen corresponding path program 1 times [2025-02-05 16:36:37,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132840312] [2025-02-05 16:36:37,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:37,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:36:37,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:36:37,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:37,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132840312] [2025-02-05 16:36:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132840312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:36:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754113468] [2025-02-05 16:36:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:37,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:36:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:37,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:36:37,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:36:37,096 INFO L87 Difference]: Start difference. First operand 12726 states and 19781 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:37,309 INFO L93 Difference]: Finished difference Result 35616 states and 55445 transitions. [2025-02-05 16:36:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:36:37,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-02-05 16:36:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:37,348 INFO L225 Difference]: With dead ends: 35616 [2025-02-05 16:36:37,348 INFO L226 Difference]: Without dead ends: 22953 [2025-02-05 16:36:37,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:37,368 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1158 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:37,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 288 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22953 states. [2025-02-05 16:36:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22953 to 22951. [2025-02-05 16:36:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22951 states, 22950 states have (on average 1.5500217864923747) internal successors, (35573), 22950 states have internal predecessors, (35573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22951 states to 22951 states and 35573 transitions. [2025-02-05 16:36:37,761 INFO L78 Accepts]: Start accepts. Automaton has 22951 states and 35573 transitions. Word has length 82 [2025-02-05 16:36:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:37,761 INFO L471 AbstractCegarLoop]: Abstraction has 22951 states and 35573 transitions. [2025-02-05 16:36:37,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 22951 states and 35573 transitions. [2025-02-05 16:36:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:36:37,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:37,766 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] [2025-02-05 16:36:37,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:36:37,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:37,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1212481359, now seen corresponding path program 1 times [2025-02-05 16:36:37,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:37,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837316943] [2025-02-05 16:36:37,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:37,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:36:37,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:36:37,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:37,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:38,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837316943] [2025-02-05 16:36:38,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837316943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:38,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:38,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:36:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009743155] [2025-02-05 16:36:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:38,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:36:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:38,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:36:38,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:36:38,104 INFO L87 Difference]: Start difference. First operand 22951 states and 35573 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:38,169 INFO L93 Difference]: Finished difference Result 23529 states and 36438 transitions. [2025-02-05 16:36:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:36:38,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-02-05 16:36:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:38,212 INFO L225 Difference]: With dead ends: 23529 [2025-02-05 16:36:38,212 INFO L226 Difference]: Without dead ends: 23527 [2025-02-05 16:36:38,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:36:38,225 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:38,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23527 states. [2025-02-05 16:36:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23527 to 23527. [2025-02-05 16:36:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23527 states, 23526 states have (on average 1.5365553005185753) internal successors, (36149), 23526 states have internal predecessors, (36149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23527 states to 23527 states and 36149 transitions. [2025-02-05 16:36:38,631 INFO L78 Accepts]: Start accepts. Automaton has 23527 states and 36149 transitions. Word has length 82 [2025-02-05 16:36:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:38,631 INFO L471 AbstractCegarLoop]: Abstraction has 23527 states and 36149 transitions. [2025-02-05 16:36:38,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 23527 states and 36149 transitions. [2025-02-05 16:36:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:36:38,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:38,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:38,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:36:38,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:38,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:38,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1072557200, now seen corresponding path program 1 times [2025-02-05 16:36:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:38,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322940970] [2025-02-05 16:36:38,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:38,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:36:38,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:36:38,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:38,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:38,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322940970] [2025-02-05 16:36:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322940970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:38,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:38,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:36:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268880820] [2025-02-05 16:36:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:36:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:38,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:36:38,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:36:38,932 INFO L87 Difference]: Start difference. First operand 23527 states and 36149 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:39,581 INFO L93 Difference]: Finished difference Result 53564 states and 81727 transitions. [2025-02-05 16:36:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:36:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-05 16:36:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:39,644 INFO L225 Difference]: With dead ends: 53564 [2025-02-05 16:36:39,644 INFO L226 Difference]: Without dead ends: 35181 [2025-02-05 16:36:39,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:36:39,678 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1824 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:39,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 933 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:36:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35181 states. [2025-02-05 16:36:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35181 to 23726. [2025-02-05 16:36:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23726 states, 23725 states have (on average 1.534668071654373) internal successors, (36410), 23725 states have internal predecessors, (36410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23726 states to 23726 states and 36410 transitions. [2025-02-05 16:36:40,244 INFO L78 Accepts]: Start accepts. Automaton has 23726 states and 36410 transitions. Word has length 83 [2025-02-05 16:36:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:40,245 INFO L471 AbstractCegarLoop]: Abstraction has 23726 states and 36410 transitions. [2025-02-05 16:36:40,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23726 states and 36410 transitions. [2025-02-05 16:36:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:36:40,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:40,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:40,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:36:40,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:40,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1629410704, now seen corresponding path program 1 times [2025-02-05 16:36:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698009735] [2025-02-05 16:36:40,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:40,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:36:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:36:40,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:40,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:40,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698009735] [2025-02-05 16:36:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698009735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:36:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628715137] [2025-02-05 16:36:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:40,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:36:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:40,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:36:40,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:36:40,576 INFO L87 Difference]: Start difference. First operand 23726 states and 36410 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:41,496 INFO L93 Difference]: Finished difference Result 39391 states and 59890 transitions. [2025-02-05 16:36:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:36:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-05 16:36:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:41,546 INFO L225 Difference]: With dead ends: 39391 [2025-02-05 16:36:41,546 INFO L226 Difference]: Without dead ends: 31037 [2025-02-05 16:36:41,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:36:41,566 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1786 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:41,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 987 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:36:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31037 states. [2025-02-05 16:36:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31037 to 24187. [2025-02-05 16:36:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24187 states, 24186 states have (on average 1.5332010253865873) internal successors, (37082), 24186 states have internal predecessors, (37082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24187 states to 24187 states and 37082 transitions. [2025-02-05 16:36:41,975 INFO L78 Accepts]: Start accepts. Automaton has 24187 states and 37082 transitions. Word has length 83 [2025-02-05 16:36:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:41,975 INFO L471 AbstractCegarLoop]: Abstraction has 24187 states and 37082 transitions. [2025-02-05 16:36:41,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24187 states and 37082 transitions. [2025-02-05 16:36:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:36:41,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:41,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:41,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:36:41,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:41,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash -517690864, now seen corresponding path program 1 times [2025-02-05 16:36:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:41,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921255284] [2025-02-05 16:36:41,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:41,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:42,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:36:42,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:36:42,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:42,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:42,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:42,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921255284] [2025-02-05 16:36:42,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921255284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:42,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:42,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:36:42,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969029655] [2025-02-05 16:36:42,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:42,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:36:42,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:42,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:36:42,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:36:42,399 INFO L87 Difference]: Start difference. First operand 24187 states and 37082 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:42,923 INFO L93 Difference]: Finished difference Result 30588 states and 46568 transitions. [2025-02-05 16:36:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:36:42,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-05 16:36:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:42,959 INFO L225 Difference]: With dead ends: 30588 [2025-02-05 16:36:42,959 INFO L226 Difference]: Without dead ends: 27501 [2025-02-05 16:36:42,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:36:42,974 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1552 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:42,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 905 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:36:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27501 states. [2025-02-05 16:36:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27501 to 24187. [2025-02-05 16:36:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24187 states, 24186 states have (on average 1.5330356404531547) internal successors, (37078), 24186 states have internal predecessors, (37078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24187 states to 24187 states and 37078 transitions. [2025-02-05 16:36:43,354 INFO L78 Accepts]: Start accepts. Automaton has 24187 states and 37078 transitions. Word has length 83 [2025-02-05 16:36:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:43,354 INFO L471 AbstractCegarLoop]: Abstraction has 24187 states and 37078 transitions. [2025-02-05 16:36:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24187 states and 37078 transitions. [2025-02-05 16:36:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:36:43,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:43,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:36:43,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:43,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1189658352, now seen corresponding path program 1 times [2025-02-05 16:36:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747752054] [2025-02-05 16:36:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:43,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:36:43,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:36:43,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:43,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747752054] [2025-02-05 16:36:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747752054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:43,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:43,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:36:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479108069] [2025-02-05 16:36:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:43,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:36:43,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:36:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:36:43,611 INFO L87 Difference]: Start difference. First operand 24187 states and 37078 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:44,181 INFO L93 Difference]: Finished difference Result 47532 states and 72340 transitions. [2025-02-05 16:36:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:36:44,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-05 16:36:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:44,227 INFO L225 Difference]: With dead ends: 47532 [2025-02-05 16:36:44,227 INFO L226 Difference]: Without dead ends: 33908 [2025-02-05 16:36:44,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:36:44,249 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 771 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:44,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 991 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:36:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33908 states. [2025-02-05 16:36:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33908 to 24773. [2025-02-05 16:36:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24773 states, 24772 states have (on average 1.528257710318101) internal successors, (37858), 24772 states have internal predecessors, (37858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24773 states to 24773 states and 37858 transitions. [2025-02-05 16:36:44,833 INFO L78 Accepts]: Start accepts. Automaton has 24773 states and 37858 transitions. Word has length 83 [2025-02-05 16:36:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:44,833 INFO L471 AbstractCegarLoop]: Abstraction has 24773 states and 37858 transitions. [2025-02-05 16:36:44,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 24773 states and 37858 transitions. [2025-02-05 16:36:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:36:44,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:44,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:44,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:36:44,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:44,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1727421365, now seen corresponding path program 1 times [2025-02-05 16:36:44,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:44,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632054777] [2025-02-05 16:36:44,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:44,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:36:44,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:36:44,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:44,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632054777] [2025-02-05 16:36:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632054777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:45,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:36:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459620097] [2025-02-05 16:36:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:45,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:36:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:45,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:36:45,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:36:45,152 INFO L87 Difference]: Start difference. First operand 24773 states and 37858 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:45,853 INFO L93 Difference]: Finished difference Result 62323 states and 94992 transitions. [2025-02-05 16:36:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:36:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:36:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:45,899 INFO L225 Difference]: With dead ends: 62323 [2025-02-05 16:36:45,899 INFO L226 Difference]: Without dead ends: 38969 [2025-02-05 16:36:45,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:36:45,925 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1730 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:45,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 1015 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:36:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38969 states. [2025-02-05 16:36:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38969 to 25148. [2025-02-05 16:36:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25148 states, 25147 states have (on average 1.5227263689505706) internal successors, (38292), 25147 states have internal predecessors, (38292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25148 states to 25148 states and 38292 transitions. [2025-02-05 16:36:46,404 INFO L78 Accepts]: Start accepts. Automaton has 25148 states and 38292 transitions. Word has length 84 [2025-02-05 16:36:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:46,404 INFO L471 AbstractCegarLoop]: Abstraction has 25148 states and 38292 transitions. [2025-02-05 16:36:46,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 25148 states and 38292 transitions. [2025-02-05 16:36:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:36:46,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:46,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:46,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:36:46,411 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash 3470615, now seen corresponding path program 1 times [2025-02-05 16:36:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416972418] [2025-02-05 16:36:46,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:46,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:36:46,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:36:46,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:46,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416972418] [2025-02-05 16:36:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416972418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:36:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101029186] [2025-02-05 16:36:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:36:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:46,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:36:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:36:46,529 INFO L87 Difference]: Start difference. First operand 25148 states and 38292 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:46,672 INFO L93 Difference]: Finished difference Result 67552 states and 103214 transitions. [2025-02-05 16:36:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:36:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:36:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:46,729 INFO L225 Difference]: With dead ends: 67552 [2025-02-05 16:36:46,729 INFO L226 Difference]: Without dead ends: 44830 [2025-02-05 16:36:46,758 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-02-05 16:36:46,759 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 191 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:46,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 698 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44830 states. [2025-02-05 16:36:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44830 to 44556. [2025-02-05 16:36:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44556 states, 44555 states have (on average 1.5131859499495006) internal successors, (67420), 44555 states have internal predecessors, (67420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44556 states to 44556 states and 67420 transitions. [2025-02-05 16:36:47,589 INFO L78 Accepts]: Start accepts. Automaton has 44556 states and 67420 transitions. Word has length 84 [2025-02-05 16:36:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:47,589 INFO L471 AbstractCegarLoop]: Abstraction has 44556 states and 67420 transitions. [2025-02-05 16:36:47,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 44556 states and 67420 transitions. [2025-02-05 16:36:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:36:47,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:47,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] [2025-02-05 16:36:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:36:47,595 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash 969308089, now seen corresponding path program 1 times [2025-02-05 16:36:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:47,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989859193] [2025-02-05 16:36:47,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:47,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:36:47,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:36:47,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:47,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989859193] [2025-02-05 16:36:47,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989859193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:47,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:47,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421317692] [2025-02-05 16:36:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:47,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:47,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:47,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:47,635 INFO L87 Difference]: Start difference. First operand 44556 states and 67420 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:47,792 INFO L93 Difference]: Finished difference Result 87477 states and 132630 transitions. [2025-02-05 16:36:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:47,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:36:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:48,016 INFO L225 Difference]: With dead ends: 87477 [2025-02-05 16:36:48,016 INFO L226 Difference]: Without dead ends: 56755 [2025-02-05 16:36:48,036 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-02-05 16:36:48,036 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 185 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:48,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 542 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56755 states. [2025-02-05 16:36:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56755 to 56281. [2025-02-05 16:36:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56281 states, 56280 states have (on average 1.4961975835110164) internal successors, (84206), 56280 states have internal predecessors, (84206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56281 states to 56281 states and 84206 transitions. [2025-02-05 16:36:48,968 INFO L78 Accepts]: Start accepts. Automaton has 56281 states and 84206 transitions. Word has length 84 [2025-02-05 16:36:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:48,968 INFO L471 AbstractCegarLoop]: Abstraction has 56281 states and 84206 transitions. [2025-02-05 16:36:48,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 56281 states and 84206 transitions. [2025-02-05 16:36:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:36:48,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:48,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:48,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:36:48,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:48,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash 603803506, now seen corresponding path program 1 times [2025-02-05 16:36:48,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:48,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970614706] [2025-02-05 16:36:48,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:48,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:36:48,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:36:48,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:48,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:49,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:49,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970614706] [2025-02-05 16:36:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970614706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001583621] [2025-02-05 16:36:49,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:49,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:49,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:49,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:49,023 INFO L87 Difference]: Start difference. First operand 56281 states and 84206 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:49,171 INFO L93 Difference]: Finished difference Result 77788 states and 116197 transitions. [2025-02-05 16:36:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:36:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:49,245 INFO L225 Difference]: With dead ends: 77788 [2025-02-05 16:36:49,245 INFO L226 Difference]: Without dead ends: 62146 [2025-02-05 16:36:49,276 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-02-05 16:36:49,277 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 166 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:49,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 545 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62146 states. [2025-02-05 16:36:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62146 to 55144. [2025-02-05 16:36:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55144 states, 55143 states have (on average 1.475273380120777) internal successors, (81351), 55143 states have internal predecessors, (81351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55144 states to 55144 states and 81351 transitions. [2025-02-05 16:36:49,956 INFO L78 Accepts]: Start accepts. Automaton has 55144 states and 81351 transitions. Word has length 84 [2025-02-05 16:36:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:49,957 INFO L471 AbstractCegarLoop]: Abstraction has 55144 states and 81351 transitions. [2025-02-05 16:36:49,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 55144 states and 81351 transitions. [2025-02-05 16:36:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:36:49,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:49,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:49,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:36:49,964 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:49,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1086409255, now seen corresponding path program 1 times [2025-02-05 16:36:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:49,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220062582] [2025-02-05 16:36:49,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:49,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:36:49,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:36:49,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:49,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:50,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220062582] [2025-02-05 16:36:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220062582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009698973] [2025-02-05 16:36:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:50,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:50,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:50,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:50,012 INFO L87 Difference]: Start difference. First operand 55144 states and 81351 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:50,492 INFO L93 Difference]: Finished difference Result 126014 states and 186186 transitions. [2025-02-05 16:36:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:36:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:50,580 INFO L225 Difference]: With dead ends: 126014 [2025-02-05 16:36:50,581 INFO L226 Difference]: Without dead ends: 76608 [2025-02-05 16:36:50,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-02-05 16:36:50,608 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 199 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:50,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 547 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76608 states. [2025-02-05 16:36:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76608 to 54256. [2025-02-05 16:36:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54256 states, 54255 states have (on average 1.460879181642245) internal successors, (79260), 54255 states have internal predecessors, (79260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54256 states to 54256 states and 79260 transitions. [2025-02-05 16:36:51,426 INFO L78 Accepts]: Start accepts. Automaton has 54256 states and 79260 transitions. Word has length 84 [2025-02-05 16:36:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:51,426 INFO L471 AbstractCegarLoop]: Abstraction has 54256 states and 79260 transitions. [2025-02-05 16:36:51,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 54256 states and 79260 transitions. [2025-02-05 16:36:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:36:51,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:51,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:51,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:36:51,433 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash -285965096, now seen corresponding path program 1 times [2025-02-05 16:36:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:51,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323436630] [2025-02-05 16:36:51,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:51,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:36:51,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:36:51,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:51,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323436630] [2025-02-05 16:36:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323436630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918291293] [2025-02-05 16:36:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:51,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:51,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:51,484 INFO L87 Difference]: Start difference. First operand 54256 states and 79260 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:51,718 INFO L93 Difference]: Finished difference Result 85101 states and 124275 transitions. [2025-02-05 16:36:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:51,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:36:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:51,793 INFO L225 Difference]: With dead ends: 85101 [2025-02-05 16:36:51,794 INFO L226 Difference]: Without dead ends: 57699 [2025-02-05 16:36:51,826 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-02-05 16:36:51,827 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 171 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:51,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 554 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57699 states. [2025-02-05 16:36:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57699 to 57153. [2025-02-05 16:36:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57153 states, 57152 states have (on average 1.4344729843225084) internal successors, (81983), 57152 states have internal predecessors, (81983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57153 states to 57153 states and 81983 transitions. [2025-02-05 16:36:52,694 INFO L78 Accepts]: Start accepts. Automaton has 57153 states and 81983 transitions. Word has length 84 [2025-02-05 16:36:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:52,694 INFO L471 AbstractCegarLoop]: Abstraction has 57153 states and 81983 transitions. [2025-02-05 16:36:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 57153 states and 81983 transitions. [2025-02-05 16:36:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:36:52,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:52,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:36:52,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:36:52,700 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1300488541, now seen corresponding path program 1 times [2025-02-05 16:36:52,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818570943] [2025-02-05 16:36:52,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:52,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:52,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:36:52,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:36:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818570943] [2025-02-05 16:36:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818570943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:52,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280595140] [2025-02-05 16:36:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:52,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:52,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:52,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:52,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:52,766 INFO L87 Difference]: Start difference. First operand 57153 states and 81983 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:53,047 INFO L93 Difference]: Finished difference Result 120075 states and 171830 transitions. [2025-02-05 16:36:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:53,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:36:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:53,137 INFO L225 Difference]: With dead ends: 120075 [2025-02-05 16:36:53,137 INFO L226 Difference]: Without dead ends: 68657 [2025-02-05 16:36:53,186 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-02-05 16:36:53,186 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 189 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:53,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 618 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68657 states. [2025-02-05 16:36:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68657 to 68167. [2025-02-05 16:36:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68167 states, 68166 states have (on average 1.403397588240472) internal successors, (95664), 68166 states have internal predecessors, (95664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68167 states to 68167 states and 95664 transitions. [2025-02-05 16:36:54,394 INFO L78 Accepts]: Start accepts. Automaton has 68167 states and 95664 transitions. Word has length 85 [2025-02-05 16:36:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:54,395 INFO L471 AbstractCegarLoop]: Abstraction has 68167 states and 95664 transitions. [2025-02-05 16:36:54,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 68167 states and 95664 transitions. [2025-02-05 16:36:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:36:54,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:54,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:36:54,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1674116975, now seen corresponding path program 1 times [2025-02-05 16:36:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770007198] [2025-02-05 16:36:54,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:54,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:36:54,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:36:54,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:54,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:54,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:54,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770007198] [2025-02-05 16:36:54,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770007198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:54,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:54,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628352319] [2025-02-05 16:36:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:54,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:54,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:54,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:54,488 INFO L87 Difference]: Start difference. First operand 68167 states and 95664 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:54,916 INFO L93 Difference]: Finished difference Result 173741 states and 245969 transitions. [2025-02-05 16:36:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:36:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:55,124 INFO L225 Difference]: With dead ends: 173741 [2025-02-05 16:36:55,124 INFO L226 Difference]: Without dead ends: 144207 [2025-02-05 16:36:55,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:36:55,184 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 1660 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:55,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 1626 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144207 states. [2025-02-05 16:36:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144207 to 97373. [2025-02-05 16:36:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97373 states, 97372 states have (on average 1.4038019143080147) internal successors, (136691), 97372 states have internal predecessors, (136691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97373 states to 97373 states and 136691 transitions. [2025-02-05 16:36:56,953 INFO L78 Accepts]: Start accepts. Automaton has 97373 states and 136691 transitions. Word has length 85 [2025-02-05 16:36:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:56,954 INFO L471 AbstractCegarLoop]: Abstraction has 97373 states and 136691 transitions. [2025-02-05 16:36:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 97373 states and 136691 transitions. [2025-02-05 16:36:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:36:56,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:56,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:56,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:36:56,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:56,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1130704569, now seen corresponding path program 1 times [2025-02-05 16:36:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250943206] [2025-02-05 16:36:56,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:56,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:36:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:36:56,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:56,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250943206] [2025-02-05 16:36:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250943206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791554411] [2025-02-05 16:36:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:57,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:57,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:57,040 INFO L87 Difference]: Start difference. First operand 97373 states and 136691 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:57,484 INFO L93 Difference]: Finished difference Result 183713 states and 259704 transitions. [2025-02-05 16:36:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:36:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:58,120 INFO L225 Difference]: With dead ends: 183713 [2025-02-05 16:36:58,120 INFO L226 Difference]: Without dead ends: 168051 [2025-02-05 16:36:58,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:36:58,183 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 1796 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:58,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 1708 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168051 states. [2025-02-05 16:36:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168051 to 107237. [2025-02-05 16:36:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107237 states, 107236 states have (on average 1.4056100563243688) internal successors, (150732), 107236 states have internal predecessors, (150732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107237 states to 107237 states and 150732 transitions. [2025-02-05 16:36:59,756 INFO L78 Accepts]: Start accepts. Automaton has 107237 states and 150732 transitions. Word has length 85 [2025-02-05 16:36:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:59,757 INFO L471 AbstractCegarLoop]: Abstraction has 107237 states and 150732 transitions. [2025-02-05 16:36:59,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 107237 states and 150732 transitions. [2025-02-05 16:36:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:36:59,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:59,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:59,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:36:59,762 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash -261199573, now seen corresponding path program 1 times [2025-02-05 16:36:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:59,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095314080] [2025-02-05 16:36:59,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:59,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:59,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:36:59,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:36:59,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:59,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095314080] [2025-02-05 16:37:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095314080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785674458] [2025-02-05 16:37:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:00,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:00,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:00,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:00,079 INFO L87 Difference]: Start difference. First operand 107237 states and 150732 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:00,636 INFO L93 Difference]: Finished difference Result 181985 states and 257007 transitions. [2025-02-05 16:37:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:00,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:00,883 INFO L225 Difference]: With dead ends: 181985 [2025-02-05 16:37:00,883 INFO L226 Difference]: Without dead ends: 174963 [2025-02-05 16:37:00,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:00,946 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 1722 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:00,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 1694 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174963 states. [2025-02-05 16:37:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174963 to 114149. [2025-02-05 16:37:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114149 states, 114148 states have (on average 1.4058853418369135) internal successors, (160479), 114148 states have internal predecessors, (160479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114149 states to 114149 states and 160479 transitions. [2025-02-05 16:37:02,973 INFO L78 Accepts]: Start accepts. Automaton has 114149 states and 160479 transitions. Word has length 85 [2025-02-05 16:37:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:02,973 INFO L471 AbstractCegarLoop]: Abstraction has 114149 states and 160479 transitions. [2025-02-05 16:37:02,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 114149 states and 160479 transitions. [2025-02-05 16:37:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:37:02,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:02,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:02,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:37:02,982 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2097738863, now seen corresponding path program 1 times [2025-02-05 16:37:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261152902] [2025-02-05 16:37:02,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:03,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:37:03,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:37:03,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:03,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:03,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:03,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261152902] [2025-02-05 16:37:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261152902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:03,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:03,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679811263] [2025-02-05 16:37:03,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:03,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:03,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:03,090 INFO L87 Difference]: Start difference. First operand 114149 states and 160479 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:03,655 INFO L93 Difference]: Finished difference Result 214281 states and 302888 transitions. [2025-02-05 16:37:03,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:03,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:04,292 INFO L225 Difference]: With dead ends: 214281 [2025-02-05 16:37:04,292 INFO L226 Difference]: Without dead ends: 190267 [2025-02-05 16:37:04,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:04,332 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1595 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:04,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 1950 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190267 states. [2025-02-05 16:37:06,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190267 to 125819. [2025-02-05 16:37:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125819 states, 125818 states have (on average 1.4076841151504553) internal successors, (177112), 125818 states have internal predecessors, (177112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125819 states to 125819 states and 177112 transitions. [2025-02-05 16:37:06,766 INFO L78 Accepts]: Start accepts. Automaton has 125819 states and 177112 transitions. Word has length 85 [2025-02-05 16:37:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:06,766 INFO L471 AbstractCegarLoop]: Abstraction has 125819 states and 177112 transitions. [2025-02-05 16:37:06,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 125819 states and 177112 transitions. [2025-02-05 16:37:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:37:06,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:06,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:06,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:37:06,776 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2134329164, now seen corresponding path program 1 times [2025-02-05 16:37:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234366642] [2025-02-05 16:37:06,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:06,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:37:06,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:37:06,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:06,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:06,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234366642] [2025-02-05 16:37:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234366642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:06,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:06,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560415312] [2025-02-05 16:37:06,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:06,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:06,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:06,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:06,930 INFO L87 Difference]: Start difference. First operand 125819 states and 177112 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:07,591 INFO L93 Difference]: Finished difference Result 252679 states and 356973 transitions. [2025-02-05 16:37:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:37:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:08,032 INFO L225 Difference]: With dead ends: 252679 [2025-02-05 16:37:08,032 INFO L226 Difference]: Without dead ends: 219417 [2025-02-05 16:37:08,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:08,112 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1669 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:08,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 1848 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219417 states. [2025-02-05 16:37:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219417 to 142897. [2025-02-05 16:37:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142897 states, 142896 states have (on average 1.408219964169746) internal successors, (201229), 142896 states have internal predecessors, (201229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142897 states to 142897 states and 201229 transitions. [2025-02-05 16:37:10,429 INFO L78 Accepts]: Start accepts. Automaton has 142897 states and 201229 transitions. Word has length 86 [2025-02-05 16:37:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:10,430 INFO L471 AbstractCegarLoop]: Abstraction has 142897 states and 201229 transitions. [2025-02-05 16:37:10,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 142897 states and 201229 transitions. [2025-02-05 16:37:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:37:10,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:10,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:37:10,439 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:10,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash -588944101, now seen corresponding path program 1 times [2025-02-05 16:37:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439878155] [2025-02-05 16:37:10,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:10,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:10,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:37:10,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:37:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:10,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439878155] [2025-02-05 16:37:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439878155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:37:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592899496] [2025-02-05 16:37:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:10,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:10,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:10,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:10,936 INFO L87 Difference]: Start difference. First operand 142897 states and 201229 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:12,407 INFO L93 Difference]: Finished difference Result 363607 states and 511674 transitions. [2025-02-05 16:37:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:37:12,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:37:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:12,918 INFO L225 Difference]: With dead ends: 363607 [2025-02-05 16:37:12,919 INFO L226 Difference]: Without dead ends: 310381 [2025-02-05 16:37:13,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:37:13,041 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2114 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:13,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 572 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:37:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310381 states. [2025-02-05 16:37:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310381 to 142921. [2025-02-05 16:37:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142921 states, 142920 states have (on average 1.4082073887489506) internal successors, (201261), 142920 states have internal predecessors, (201261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142921 states to 142921 states and 201261 transitions. [2025-02-05 16:37:15,896 INFO L78 Accepts]: Start accepts. Automaton has 142921 states and 201261 transitions. Word has length 90 [2025-02-05 16:37:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:15,896 INFO L471 AbstractCegarLoop]: Abstraction has 142921 states and 201261 transitions. [2025-02-05 16:37:15,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 142921 states and 201261 transitions. [2025-02-05 16:37:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:37:15,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:15,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:15,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:37:15,904 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:15,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1697448845, now seen corresponding path program 1 times [2025-02-05 16:37:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:15,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377468353] [2025-02-05 16:37:15,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:15,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:37:15,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:37:15,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:15,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:16,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:16,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377468353] [2025-02-05 16:37:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377468353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:16,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:16,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:37:16,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363667402] [2025-02-05 16:37:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:16,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:16,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:16,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:16,041 INFO L87 Difference]: Start difference. First operand 142921 states and 201261 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:17,854 INFO L93 Difference]: Finished difference Result 400456 states and 559702 transitions. [2025-02-05 16:37:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:37:17,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:37:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:18,386 INFO L225 Difference]: With dead ends: 400456 [2025-02-05 16:37:18,386 INFO L226 Difference]: Without dead ends: 352426 [2025-02-05 16:37:18,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:37:18,459 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1804 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:18,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 542 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:37:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352426 states.