./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.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.8.1.ufo.BOUNDED-16.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 2164ea7ff9e119435a975a3ff24098e6247a3cb559bae891b283444f40f36a64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:46:26,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:46:26,812 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:46:26,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:46:26,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:46:26,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:46:26,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:46:26,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:46:26,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:46:26,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:46:26,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:46:26,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:46:26,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:46:26,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:46:26,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:46:26,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:46:26,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:46:26,847 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 -> 2164ea7ff9e119435a975a3ff24098e6247a3cb559bae891b283444f40f36a64 [2025-02-05 16:46:27,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:46:27,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:46:27,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:46:27,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:46:27,103 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:46:27,104 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.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2025-02-05 16:46:28,227 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e0be38f1/342d2417ccec42fe9f908e7271607b9a/FLAGbd220d911 [2025-02-05 16:46:28,501 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:46:28,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2025-02-05 16:46:28,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e0be38f1/342d2417ccec42fe9f908e7271607b9a/FLAGbd220d911 [2025-02-05 16:46:28,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e0be38f1/342d2417ccec42fe9f908e7271607b9a [2025-02-05 16:46:28,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:46:28,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:46:28,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:46:28,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:46:28,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:46:28,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:46:28" (1/1) ... [2025-02-05 16:46:28,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:28, skipping insertion in model container [2025-02-05 16:46:28,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:46:28" (1/1) ... [2025-02-05 16:46:28,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:46:29,049 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.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c[11829,11842] [2025-02-05 16:46:29,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:46:29,127 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:46:29,194 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.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c[11829,11842] [2025-02-05 16:46:29,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:46:29,244 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:46:29,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29 WrapperNode [2025-02-05 16:46:29,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:46:29,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:46:29,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:46:29,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:46:29,250 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:46:29" (1/1) ... [2025-02-05 16:46:29,258 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:46:29" (1/1) ... [2025-02-05 16:46:29,288 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1048 [2025-02-05 16:46:29,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:46:29,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:46:29,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:46:29,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:46:29,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,312 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:46:29,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:46:29,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:46:29,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:46:29,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:46:29,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (1/1) ... [2025-02-05 16:46:29,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:46:29,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:46:29,358 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:46:29,360 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:46:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:46:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:46:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:46:29,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:46:29,481 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:46:29,483 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:46:30,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L995: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:46:30,128 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128: havoc main_~node8____CPAchecker_TMP_0~1#1; [2025-02-05 16:46:30,128 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L703: havoc main_~node5__m5~2#1; [2025-02-05 16:46:30,128 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L673: havoc main_~node3__m3~2#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L905: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L580: havoc main_~node8__m8~1#1;havoc main_~node7__m7~1#1;havoc main_~node6__m6~1#1;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_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node8____CPAchecker_TMP_0~0#1;havoc main_~node8__m8~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;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:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L815: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L718: havoc main_~node6__m6~2#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L950: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: havoc main_~node4__m4~2#1; [2025-02-05 16:46:30,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2__m2~2#1; [2025-02-05 16:46:30,130 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L860: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:46:30,195 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-02-05 16:46:30,196 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:46:30,206 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:46:30,206 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:46:30,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:46:30 BoogieIcfgContainer [2025-02-05 16:46:30,206 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:46:30,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:46:30,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:46:30,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:46:30,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:46:28" (1/3) ... [2025-02-05 16:46:30,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74347a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:46:30, skipping insertion in model container [2025-02-05 16:46:30,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:29" (2/3) ... [2025-02-05 16:46:30,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74347a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:46:30, skipping insertion in model container [2025-02-05 16:46:30,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:46:30" (3/3) ... [2025-02-05 16:46:30,213 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c [2025-02-05 16:46:30,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:46:30,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+nlh-reducer.c that has 1 procedures, 232 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:46:30,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:46:30,281 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;@5ef9ca90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:46:30,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:46:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 230 states have (on average 1.7695652173913043) internal successors, (407), 231 states have internal predecessors, (407), 0 states have call successors, (0), 0 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:46:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:46:30,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:30,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:30,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1907687440, now seen corresponding path program 1 times [2025-02-05 16:46:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:30,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816491509] [2025-02-05 16:46:30,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:30,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:46:30,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:46:30,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:30,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816491509] [2025-02-05 16:46:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816491509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:31,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:31,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540294188] [2025-02-05 16:46:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:31,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:31,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:31,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:31,116 INFO L87 Difference]: Start difference. First operand has 232 states, 230 states have (on average 1.7695652173913043) internal successors, (407), 231 states have internal predecessors, (407), 0 states have call successors, (0), 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 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:46:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:31,856 INFO L93 Difference]: Finished difference Result 1848 states and 2971 transitions. [2025-02-05 16:46:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:46:31,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-05 16:46:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:31,878 INFO L225 Difference]: With dead ends: 1848 [2025-02-05 16:46:31,878 INFO L226 Difference]: Without dead ends: 1706 [2025-02-05 16:46:31,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:46:31,883 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 3398 mSDsluCounter, 8346 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 9586 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:31,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3398 Valid, 9586 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:46:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2025-02-05 16:46:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 349. [2025-02-05 16:46:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4396551724137931) internal successors, (501), 348 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 501 transitions. [2025-02-05 16:46:31,945 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 501 transitions. Word has length 125 [2025-02-05 16:46:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:31,945 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 501 transitions. [2025-02-05 16:46:31,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:46:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 501 transitions. [2025-02-05 16:46:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:31,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:31,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:31,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:46:31,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1594488972, now seen corresponding path program 1 times [2025-02-05 16:46:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514273954] [2025-02-05 16:46:31,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:31,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:31,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:31,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:31,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:32,287 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:46:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514273954] [2025-02-05 16:46:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514273954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:32,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727615380] [2025-02-05 16:46:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:32,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:32,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:32,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:32,290 INFO L87 Difference]: Start difference. First operand 349 states and 501 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:32,707 INFO L93 Difference]: Finished difference Result 1961 states and 3049 transitions. [2025-02-05 16:46:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:32,715 INFO L225 Difference]: With dead ends: 1961 [2025-02-05 16:46:32,715 INFO L226 Difference]: Without dead ends: 1781 [2025-02-05 16:46:32,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:32,717 INFO L435 NwaCegarLoop]: 1192 mSDtfsCounter, 2283 mSDsluCounter, 4439 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2283 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:32,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2283 Valid, 5631 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:46:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-02-05 16:46:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 553. [2025-02-05 16:46:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4945652173913044) internal successors, (825), 552 states have internal predecessors, (825), 0 states have call successors, (0), 0 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:46:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 825 transitions. [2025-02-05 16:46:32,755 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 825 transitions. Word has length 127 [2025-02-05 16:46:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:32,756 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 825 transitions. [2025-02-05 16:46:32,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 825 transitions. [2025-02-05 16:46:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:32,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:32,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:46:32,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:32,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2132596108, now seen corresponding path program 1 times [2025-02-05 16:46:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699396247] [2025-02-05 16:46:32,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:32,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:32,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:32,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:32,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:33,068 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:46:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699396247] [2025-02-05 16:46:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699396247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:33,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655561474] [2025-02-05 16:46:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:33,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:33,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:33,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:33,069 INFO L87 Difference]: Start difference. First operand 553 states and 825 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:33,396 INFO L93 Difference]: Finished difference Result 2165 states and 3373 transitions. [2025-02-05 16:46:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:33,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:33,404 INFO L225 Difference]: With dead ends: 2165 [2025-02-05 16:46:33,404 INFO L226 Difference]: Without dead ends: 1985 [2025-02-05 16:46:33,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:33,407 INFO L435 NwaCegarLoop]: 1060 mSDtfsCounter, 2451 mSDsluCounter, 3380 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:33,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2451 Valid, 4440 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-02-05 16:46:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 841. [2025-02-05 16:46:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.526190476190476) internal successors, (1282), 840 states have internal predecessors, (1282), 0 states have call successors, (0), 0 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:46:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1282 transitions. [2025-02-05 16:46:33,433 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1282 transitions. Word has length 127 [2025-02-05 16:46:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:33,434 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1282 transitions. [2025-02-05 16:46:33,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1282 transitions. [2025-02-05 16:46:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:33,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:33,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:46:33,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:33,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1284988052, now seen corresponding path program 1 times [2025-02-05 16:46:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595951025] [2025-02-05 16:46:33,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:33,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:33,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:33,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:33,711 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:46:33,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595951025] [2025-02-05 16:46:33,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595951025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:33,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:33,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032804094] [2025-02-05 16:46:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:33,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:33,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:33,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:33,715 INFO L87 Difference]: Start difference. First operand 841 states and 1282 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:34,067 INFO L93 Difference]: Finished difference Result 2359 states and 3681 transitions. [2025-02-05 16:46:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:34,074 INFO L225 Difference]: With dead ends: 2359 [2025-02-05 16:46:34,074 INFO L226 Difference]: Without dead ends: 2179 [2025-02-05 16:46:34,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:34,075 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 2576 mSDsluCounter, 3506 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:34,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2576 Valid, 4441 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2025-02-05 16:46:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 1035. [2025-02-05 16:46:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1034 states have (on average 1.5377176015473888) internal successors, (1590), 1034 states have internal predecessors, (1590), 0 states have call successors, (0), 0 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:46:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1590 transitions. [2025-02-05 16:46:34,106 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1590 transitions. Word has length 127 [2025-02-05 16:46:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:34,106 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1590 transitions. [2025-02-05 16:46:34,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1590 transitions. [2025-02-05 16:46:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:34,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:34,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:34,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:46:34,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:34,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1775858316, now seen corresponding path program 1 times [2025-02-05 16:46:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619072180] [2025-02-05 16:46:34,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:34,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:34,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:34,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:34,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:34,365 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:46:34,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619072180] [2025-02-05 16:46:34,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619072180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:34,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:34,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:34,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179118672] [2025-02-05 16:46:34,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:34,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:34,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:34,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:34,367 INFO L87 Difference]: Start difference. First operand 1035 states and 1590 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:34,681 INFO L93 Difference]: Finished difference Result 2548 states and 3981 transitions. [2025-02-05 16:46:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:34,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:34,688 INFO L225 Difference]: With dead ends: 2548 [2025-02-05 16:46:34,688 INFO L226 Difference]: Without dead ends: 2368 [2025-02-05 16:46:34,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:34,689 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 2695 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:34,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 4126 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2025-02-05 16:46:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 1224. [2025-02-05 16:46:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1223 states have (on average 1.5453802125919869) internal successors, (1890), 1223 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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:46:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1890 transitions. [2025-02-05 16:46:34,712 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1890 transitions. Word has length 127 [2025-02-05 16:46:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:34,712 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1890 transitions. [2025-02-05 16:46:34,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1890 transitions. [2025-02-05 16:46:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:34,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:34,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:34,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:46:34,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:34,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1801969556, now seen corresponding path program 1 times [2025-02-05 16:46:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888012537] [2025-02-05 16:46:34,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:34,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:34,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:34,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:34,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:34,923 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:46:34,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:34,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888012537] [2025-02-05 16:46:34,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888012537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:34,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:34,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257809442] [2025-02-05 16:46:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:34,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:34,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:34,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:34,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:34,924 INFO L87 Difference]: Start difference. First operand 1224 states and 1890 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:35,218 INFO L93 Difference]: Finished difference Result 2732 states and 4273 transitions. [2025-02-05 16:46:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:35,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:35,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:35,226 INFO L225 Difference]: With dead ends: 2732 [2025-02-05 16:46:35,226 INFO L226 Difference]: Without dead ends: 2552 [2025-02-05 16:46:35,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:35,227 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 2813 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 4025 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:35,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2813 Valid, 4025 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-02-05 16:46:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1408. [2025-02-05 16:46:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1407 states have (on average 1.550817341862118) internal successors, (2182), 1407 states have internal predecessors, (2182), 0 states have call successors, (0), 0 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:46:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2182 transitions. [2025-02-05 16:46:35,252 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2182 transitions. Word has length 127 [2025-02-05 16:46:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:35,252 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 2182 transitions. [2025-02-05 16:46:35,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2182 transitions. [2025-02-05 16:46:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:35,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:35,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:35,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:46:35,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:35,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash -779104372, now seen corresponding path program 1 times [2025-02-05 16:46:35,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:35,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723508167] [2025-02-05 16:46:35,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:35,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:35,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:35,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:35,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:35,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:35,448 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:46:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723508167] [2025-02-05 16:46:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723508167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:35,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:35,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717076883] [2025-02-05 16:46:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:35,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:35,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:35,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:35,450 INFO L87 Difference]: Start difference. First operand 1408 states and 2182 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:35,736 INFO L93 Difference]: Finished difference Result 2911 states and 4557 transitions. [2025-02-05 16:46:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:35,737 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:35,745 INFO L225 Difference]: With dead ends: 2911 [2025-02-05 16:46:35,745 INFO L226 Difference]: Without dead ends: 2731 [2025-02-05 16:46:35,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:35,748 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2932 mSDsluCounter, 3442 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 4002 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:35,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 4002 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2025-02-05 16:46:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 1587. [2025-02-05 16:46:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1586 states have (on average 1.5548549810844894) internal successors, (2466), 1586 states have internal predecessors, (2466), 0 states have call successors, (0), 0 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:46:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2466 transitions. [2025-02-05 16:46:35,777 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2466 transitions. Word has length 127 [2025-02-05 16:46:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:35,777 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2466 transitions. [2025-02-05 16:46:35,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2466 transitions. [2025-02-05 16:46:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:35,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:35,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:35,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:46:35,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:35,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash -571260116, now seen corresponding path program 1 times [2025-02-05 16:46:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676330228] [2025-02-05 16:46:35,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:35,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:35,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:35,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:35,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676330228] [2025-02-05 16:46:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676330228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:35,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:35,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795070542] [2025-02-05 16:46:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:35,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:35,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:35,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:35,990 INFO L87 Difference]: Start difference. First operand 1587 states and 2466 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:36,255 INFO L93 Difference]: Finished difference Result 3089 states and 4840 transitions. [2025-02-05 16:46:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:36,265 INFO L225 Difference]: With dead ends: 3089 [2025-02-05 16:46:36,265 INFO L226 Difference]: Without dead ends: 2909 [2025-02-05 16:46:36,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:36,267 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 3040 mSDsluCounter, 3992 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3040 SdHoareTripleChecker+Valid, 4434 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:36,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3040 Valid, 4434 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2025-02-05 16:46:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1765. [2025-02-05 16:46:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1764 states have (on average 1.558390022675737) internal successors, (2749), 1764 states have internal predecessors, (2749), 0 states have call successors, (0), 0 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:46:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2749 transitions. [2025-02-05 16:46:36,299 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2749 transitions. Word has length 127 [2025-02-05 16:46:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:36,300 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2749 transitions. [2025-02-05 16:46:36,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2749 transitions. [2025-02-05 16:46:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:36,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:36,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:46:36,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:36,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash 702462009, now seen corresponding path program 1 times [2025-02-05 16:46:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99847772] [2025-02-05 16:46:36,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:36,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:36,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:36,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:36,353 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:46:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99847772] [2025-02-05 16:46:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99847772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:36,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282150006] [2025-02-05 16:46:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:36,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:36,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:36,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:36,355 INFO L87 Difference]: Start difference. First operand 1765 states and 2749 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:36,377 INFO L93 Difference]: Finished difference Result 4685 states and 7369 transitions. [2025-02-05 16:46:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:36,386 INFO L225 Difference]: With dead ends: 4685 [2025-02-05 16:46:36,387 INFO L226 Difference]: Without dead ends: 3170 [2025-02-05 16:46:36,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:36,393 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 131 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:36,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 736 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-02-05 16:46:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3168. [2025-02-05 16:46:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 3167 states have (on average 1.5557309756867699) internal successors, (4927), 3167 states have internal predecessors, (4927), 0 states have call successors, (0), 0 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:46:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4927 transitions. [2025-02-05 16:46:36,437 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4927 transitions. Word has length 127 [2025-02-05 16:46:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:36,439 INFO L471 AbstractCegarLoop]: Abstraction has 3168 states and 4927 transitions. [2025-02-05 16:46:36,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4927 transitions. [2025-02-05 16:46:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:36,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:36,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:36,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:46:36,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 703623858, now seen corresponding path program 1 times [2025-02-05 16:46:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841147877] [2025-02-05 16:46:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:36,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:36,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:36,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:36,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:36,854 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:46:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841147877] [2025-02-05 16:46:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841147877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:36,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379516520] [2025-02-05 16:46:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:36,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:36,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:36,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:36,855 INFO L87 Difference]: Start difference. First operand 3168 states and 4927 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:37,243 INFO L93 Difference]: Finished difference Result 6088 states and 9513 transitions. [2025-02-05 16:46:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:37,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:37,251 INFO L225 Difference]: With dead ends: 6088 [2025-02-05 16:46:37,251 INFO L226 Difference]: Without dead ends: 3170 [2025-02-05 16:46:37,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:46:37,256 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 764 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:37,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1712 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-02-05 16:46:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3168. [2025-02-05 16:46:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 3167 states have (on average 1.552889169561099) internal successors, (4918), 3167 states have internal predecessors, (4918), 0 states have call successors, (0), 0 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:46:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4918 transitions. [2025-02-05 16:46:37,297 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4918 transitions. Word has length 127 [2025-02-05 16:46:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:37,298 INFO L471 AbstractCegarLoop]: Abstraction has 3168 states and 4918 transitions. [2025-02-05 16:46:37,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4918 transitions. [2025-02-05 16:46:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:46:37,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:37,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:37,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:46:37,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:37,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1183508076, now seen corresponding path program 1 times [2025-02-05 16:46:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:37,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868003110] [2025-02-05 16:46:37,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:37,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:46:37,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:46:37,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:37,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:37,529 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:46:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868003110] [2025-02-05 16:46:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868003110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718428301] [2025-02-05 16:46:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:37,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:37,532 INFO L87 Difference]: Start difference. First operand 3168 states and 4918 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:37,793 INFO L93 Difference]: Finished difference Result 6011 states and 9373 transitions. [2025-02-05 16:46:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:37,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:46:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:37,808 INFO L225 Difference]: With dead ends: 6011 [2025-02-05 16:46:37,808 INFO L226 Difference]: Without dead ends: 5666 [2025-02-05 16:46:37,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:37,811 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 2947 mSDsluCounter, 4793 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2947 SdHoareTripleChecker+Valid, 5278 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:37,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2947 Valid, 5278 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2025-02-05 16:46:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 3537. [2025-02-05 16:46:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 3536 states have (on average 1.554581447963801) internal successors, (5497), 3536 states have internal predecessors, (5497), 0 states have call successors, (0), 0 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:46:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 5497 transitions. [2025-02-05 16:46:37,865 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 5497 transitions. Word has length 127 [2025-02-05 16:46:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:37,865 INFO L471 AbstractCegarLoop]: Abstraction has 3537 states and 5497 transitions. [2025-02-05 16:46:37,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 5497 transitions. [2025-02-05 16:46:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:46:37,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:37,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:37,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:46:37,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:37,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash 306259821, now seen corresponding path program 1 times [2025-02-05 16:46:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715665752] [2025-02-05 16:46:37,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:37,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:37,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:46:37,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:46:37,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:37,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:37,966 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:46:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715665752] [2025-02-05 16:46:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715665752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:37,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:37,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:37,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080657484] [2025-02-05 16:46:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:37,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:37,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:37,967 INFO L87 Difference]: Start difference. First operand 3537 states and 5497 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:46:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:38,120 INFO L93 Difference]: Finished difference Result 6982 states and 10895 transitions. [2025-02-05 16:46:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-05 16:46:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:38,126 INFO L225 Difference]: With dead ends: 6982 [2025-02-05 16:46:38,126 INFO L226 Difference]: Without dead ends: 3537 [2025-02-05 16:46:38,129 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:46:38,129 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 785 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:38,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 220 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2025-02-05 16:46:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3537. [2025-02-05 16:46:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 3536 states have (on average 1.543552036199095) internal successors, (5458), 3536 states have internal predecessors, (5458), 0 states have call successors, (0), 0 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:46:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 5458 transitions. [2025-02-05 16:46:38,182 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 5458 transitions. Word has length 128 [2025-02-05 16:46:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:38,182 INFO L471 AbstractCegarLoop]: Abstraction has 3537 states and 5458 transitions. [2025-02-05 16:46:38,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:46:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 5458 transitions. [2025-02-05 16:46:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 16:46:38,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:38,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:38,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:46:38,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:38,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -504572833, now seen corresponding path program 1 times [2025-02-05 16:46:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:38,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085773430] [2025-02-05 16:46:38,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:38,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:46:38,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:46:38,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:38,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:38,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085773430] [2025-02-05 16:46:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085773430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:38,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:38,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939908321] [2025-02-05 16:46:38,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:38,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:38,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:38,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:38,297 INFO L87 Difference]: Start difference. First operand 3537 states and 5458 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:46:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:38,507 INFO L93 Difference]: Finished difference Result 10400 states and 16131 transitions. [2025-02-05 16:46:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:38,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-02-05 16:46:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:38,516 INFO L225 Difference]: With dead ends: 10400 [2025-02-05 16:46:38,516 INFO L226 Difference]: Without dead ends: 6931 [2025-02-05 16:46:38,521 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:46:38,521 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1227 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:38,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 272 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6931 states. [2025-02-05 16:46:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6931 to 6929. [2025-02-05 16:46:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.5447459584295613) internal successors, (10702), 6928 states have internal predecessors, (10702), 0 states have call successors, (0), 0 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:46:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10702 transitions. [2025-02-05 16:46:38,594 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10702 transitions. Word has length 129 [2025-02-05 16:46:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:38,594 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10702 transitions. [2025-02-05 16:46:38,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:46:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10702 transitions. [2025-02-05 16:46:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:46:38,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:38,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:38,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:46:38,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:38,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash 899984941, now seen corresponding path program 1 times [2025-02-05 16:46:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757180343] [2025-02-05 16:46:38,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:38,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:46:38,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:46:38,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:38,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:38,698 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:46:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757180343] [2025-02-05 16:46:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757180343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:38,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:38,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374546470] [2025-02-05 16:46:38,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:38,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:38,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:38,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:38,700 INFO L87 Difference]: Start difference. First operand 6929 states and 10702 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:46:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:38,840 INFO L93 Difference]: Finished difference Result 13778 states and 21321 transitions. [2025-02-05 16:46:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:38,850 INFO L225 Difference]: With dead ends: 13778 [2025-02-05 16:46:38,851 INFO L226 Difference]: Without dead ends: 6929 [2025-02-05 16:46:38,858 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:46:38,859 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 808 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:38,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 196 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2025-02-05 16:46:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6929. [2025-02-05 16:46:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.5336316397228638) internal successors, (10625), 6928 states have internal predecessors, (10625), 0 states have call successors, (0), 0 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:46:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10625 transitions. [2025-02-05 16:46:38,931 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10625 transitions. Word has length 130 [2025-02-05 16:46:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:38,932 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10625 transitions. [2025-02-05 16:46:38,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:46:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10625 transitions. [2025-02-05 16:46:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:46:38,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:38,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:38,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:46:38,934 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:38,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash 795637187, now seen corresponding path program 1 times [2025-02-05 16:46:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:38,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949554196] [2025-02-05 16:46:38,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:38,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:46:38,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:46:38,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:38,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:39,019 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:46:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949554196] [2025-02-05 16:46:39,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949554196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:39,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:39,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120111435] [2025-02-05 16:46:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:39,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:39,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:39,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:39,021 INFO L87 Difference]: Start difference. First operand 6929 states and 10625 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:46:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:39,161 INFO L93 Difference]: Finished difference Result 13774 states and 21163 transitions. [2025-02-05 16:46:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:39,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-02-05 16:46:39,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:39,171 INFO L225 Difference]: With dead ends: 13774 [2025-02-05 16:46:39,171 INFO L226 Difference]: Without dead ends: 6929 [2025-02-05 16:46:39,178 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:46:39,179 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 790 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:39,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 204 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2025-02-05 16:46:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6929. [2025-02-05 16:46:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.5225173210161662) internal successors, (10548), 6928 states have internal predecessors, (10548), 0 states have call successors, (0), 0 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:46:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10548 transitions. [2025-02-05 16:46:39,268 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10548 transitions. Word has length 131 [2025-02-05 16:46:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10548 transitions. [2025-02-05 16:46:39,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:46:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10548 transitions. [2025-02-05 16:46:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 16:46:39,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:39,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:46:39,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1495613879, now seen corresponding path program 1 times [2025-02-05 16:46:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461640589] [2025-02-05 16:46:39,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:39,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 16:46:39,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 16:46:39,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:39,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:39,359 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:46:39,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461640589] [2025-02-05 16:46:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461640589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564585498] [2025-02-05 16:46:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:39,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:39,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:39,360 INFO L87 Difference]: Start difference. First operand 6929 states and 10548 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:46:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:39,500 INFO L93 Difference]: Finished difference Result 13786 states and 21023 transitions. [2025-02-05 16:46:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:39,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-02-05 16:46:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:39,510 INFO L225 Difference]: With dead ends: 13786 [2025-02-05 16:46:39,510 INFO L226 Difference]: Without dead ends: 6929 [2025-02-05 16:46:39,516 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:46:39,516 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 818 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:39,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 180 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2025-02-05 16:46:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6929. [2025-02-05 16:46:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.511403002309469) internal successors, (10471), 6928 states have internal predecessors, (10471), 0 states have call successors, (0), 0 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:46:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10471 transitions. [2025-02-05 16:46:39,579 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10471 transitions. Word has length 132 [2025-02-05 16:46:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:39,579 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10471 transitions. [2025-02-05 16:46:39,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:46:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10471 transitions. [2025-02-05 16:46:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 16:46:39,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:39,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:39,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:46:39,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 435952351, now seen corresponding path program 1 times [2025-02-05 16:46:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107743802] [2025-02-05 16:46:39,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:39,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:39,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 16:46:39,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 16:46:39,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:39,682 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:46:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107743802] [2025-02-05 16:46:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107743802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:39,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:39,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197615860] [2025-02-05 16:46:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:39,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:39,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:39,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:39,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:39,684 INFO L87 Difference]: Start difference. First operand 6929 states and 10471 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:46:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:39,822 INFO L93 Difference]: Finished difference Result 13782 states and 20865 transitions. [2025-02-05 16:46:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:39,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-02-05 16:46:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:39,832 INFO L225 Difference]: With dead ends: 13782 [2025-02-05 16:46:39,832 INFO L226 Difference]: Without dead ends: 6929 [2025-02-05 16:46:39,838 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:46:39,839 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 800 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:39,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 188 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2025-02-05 16:46:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6929. [2025-02-05 16:46:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.5002886836027713) internal successors, (10394), 6928 states have internal predecessors, (10394), 0 states have call successors, (0), 0 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:46:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10394 transitions. [2025-02-05 16:46:39,901 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10394 transitions. Word has length 133 [2025-02-05 16:46:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:39,902 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10394 transitions. [2025-02-05 16:46:39,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:46:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10394 transitions. [2025-02-05 16:46:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:46:39,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:39,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:46:39,904 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:39,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1083288987, now seen corresponding path program 1 times [2025-02-05 16:46:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:39,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803535591] [2025-02-05 16:46:39,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:39,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:46:39,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:46:39,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:39,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:39,990 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:46:39,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:39,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803535591] [2025-02-05 16:46:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803535591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:39,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:39,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:39,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830914443] [2025-02-05 16:46:39,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:39,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:39,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:39,992 INFO L87 Difference]: Start difference. First operand 6929 states and 10394 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:46:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:40,131 INFO L93 Difference]: Finished difference Result 13770 states and 20699 transitions. [2025-02-05 16:46:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:40,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 16:46:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:40,141 INFO L225 Difference]: With dead ends: 13770 [2025-02-05 16:46:40,141 INFO L226 Difference]: Without dead ends: 6929 [2025-02-05 16:46:40,147 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:46:40,147 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 758 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:40,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 212 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2025-02-05 16:46:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6929. [2025-02-05 16:46:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.4891743648960738) internal successors, (10317), 6928 states have internal predecessors, (10317), 0 states have call successors, (0), 0 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:46:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10317 transitions. [2025-02-05 16:46:40,235 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10317 transitions. Word has length 134 [2025-02-05 16:46:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:40,236 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10317 transitions. [2025-02-05 16:46:40,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:46:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10317 transitions. [2025-02-05 16:46:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 16:46:40,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:40,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:40,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:46:40,238 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:40,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash -601901557, now seen corresponding path program 1 times [2025-02-05 16:46:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691758945] [2025-02-05 16:46:40,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:40,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 16:46:40,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 16:46:40,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:40,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:40,356 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:46:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691758945] [2025-02-05 16:46:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691758945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:40,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:46:40,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291339168] [2025-02-05 16:46:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:40,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:40,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:40,358 INFO L87 Difference]: Start difference. First operand 6929 states and 10317 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:46:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:40,500 INFO L93 Difference]: Finished difference Result 13762 states and 20537 transitions. [2025-02-05 16:46:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-02-05 16:46:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:40,511 INFO L225 Difference]: With dead ends: 13762 [2025-02-05 16:46:40,511 INFO L226 Difference]: Without dead ends: 6929 [2025-02-05 16:46:40,517 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:46:40,518 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 729 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:40,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 232 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2025-02-05 16:46:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6929. [2025-02-05 16:46:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.4780600461893765) internal successors, (10240), 6928 states have internal predecessors, (10240), 0 states have call successors, (0), 0 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:46:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10240 transitions. [2025-02-05 16:46:40,582 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10240 transitions. Word has length 135 [2025-02-05 16:46:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:40,583 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10240 transitions. [2025-02-05 16:46:40,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:46:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10240 transitions. [2025-02-05 16:46:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:46:40,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:40,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:40,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:46:40,585 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -360384035, now seen corresponding path program 1 times [2025-02-05 16:46:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529568096] [2025-02-05 16:46:40,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:40,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:46:40,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:46:40,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:40,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:41,041 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:46:41,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:41,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529568096] [2025-02-05 16:46:41,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529568096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:41,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:46:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399174978] [2025-02-05 16:46:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:41,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:46:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:41,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:46:41,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:46:41,042 INFO L87 Difference]: Start difference. First operand 6929 states and 10240 transitions. Second operand has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 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:46:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:41,642 INFO L93 Difference]: Finished difference Result 20336 states and 30032 transitions. [2025-02-05 16:46:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:46:41,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 16:46:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:41,662 INFO L225 Difference]: With dead ends: 20336 [2025-02-05 16:46:41,662 INFO L226 Difference]: Without dead ends: 13736 [2025-02-05 16:46:41,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:46:41,670 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1832 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:41,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 879 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:46:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2025-02-05 16:46:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 6929. [2025-02-05 16:46:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6928 states have (on average 1.4761836027713626) internal successors, (10227), 6928 states have internal predecessors, (10227), 0 states have call successors, (0), 0 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:46:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10227 transitions. [2025-02-05 16:46:41,788 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10227 transitions. Word has length 136 [2025-02-05 16:46:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:41,788 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10227 transitions. [2025-02-05 16:46:41,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.461538461538462) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 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:46:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10227 transitions. [2025-02-05 16:46:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 16:46:41,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:41,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:41,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:46:41,790 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:41,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash 948018368, now seen corresponding path program 1 times [2025-02-05 16:46:41,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:41,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370124904] [2025-02-05 16:46:41,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:41,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 16:46:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 16:46:41,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:41,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:42,158 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:46:42,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:42,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370124904] [2025-02-05 16:46:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370124904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:42,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:42,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:46:42,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70287089] [2025-02-05 16:46:42,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:42,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:46:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:42,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:46:42,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:46:42,159 INFO L87 Difference]: Start difference. First operand 6929 states and 10227 transitions. Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 13 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:46:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:42,873 INFO L93 Difference]: Finished difference Result 20659 states and 30370 transitions. [2025-02-05 16:46:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:46:42,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 13 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-02-05 16:46:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:42,895 INFO L225 Difference]: With dead ends: 20659 [2025-02-05 16:46:42,895 INFO L226 Difference]: Without dead ends: 14126 [2025-02-05 16:46:42,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:46:42,905 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1507 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:42,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1216 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:46:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14126 states. [2025-02-05 16:46:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14126 to 7113. [2025-02-05 16:46:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7112 states have (on average 1.4745500562429696) internal successors, (10487), 7112 states have internal predecessors, (10487), 0 states have call successors, (0), 0 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:46:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 10487 transitions. [2025-02-05 16:46:43,017 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 10487 transitions. Word has length 137 [2025-02-05 16:46:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:43,017 INFO L471 AbstractCegarLoop]: Abstraction has 7113 states and 10487 transitions. [2025-02-05 16:46:43,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 13 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:46:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 10487 transitions. [2025-02-05 16:46:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 16:46:43,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:43,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:43,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:46:43,019 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:43,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:43,020 INFO L85 PathProgramCache]: Analyzing trace with hash 187290048, now seen corresponding path program 1 times [2025-02-05 16:46:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69332318] [2025-02-05 16:46:43,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:43,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 16:46:43,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 16:46:43,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:43,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:43,364 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:46:43,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:43,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69332318] [2025-02-05 16:46:43,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69332318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:43,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:43,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497254820] [2025-02-05 16:46:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:43,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:43,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:43,366 INFO L87 Difference]: Start difference. First operand 7113 states and 10487 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:46:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:43,782 INFO L93 Difference]: Finished difference Result 20364 states and 30112 transitions. [2025-02-05 16:46:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:43,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-02-05 16:46:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:43,804 INFO L225 Difference]: With dead ends: 20364 [2025-02-05 16:46:43,804 INFO L226 Difference]: Without dead ends: 13633 [2025-02-05 16:46:43,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:46:43,814 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1490 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:43,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 738 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:46:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2025-02-05 16:46:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 7113. [2025-02-05 16:46:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7112 states have (on average 1.4744094488188977) internal successors, (10486), 7112 states have internal predecessors, (10486), 0 states have call successors, (0), 0 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:46:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 10486 transitions. [2025-02-05 16:46:43,917 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 10486 transitions. Word has length 137 [2025-02-05 16:46:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:43,918 INFO L471 AbstractCegarLoop]: Abstraction has 7113 states and 10486 transitions. [2025-02-05 16:46:43,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:46:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 10486 transitions. [2025-02-05 16:46:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:46:43,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:43,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:43,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:46:43,920 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:43,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1572972143, now seen corresponding path program 1 times [2025-02-05 16:46:43,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:43,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184902353] [2025-02-05 16:46:43,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:43,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:43,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:46:43,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:46:43,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:43,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:44,285 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:46:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184902353] [2025-02-05 16:46:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184902353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:44,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:44,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:46:44,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038177662] [2025-02-05 16:46:44,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:44,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:46:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:44,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:46:44,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:46:44,286 INFO L87 Difference]: Start difference. First operand 7113 states and 10486 transitions. Second operand has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:46:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:44,928 INFO L93 Difference]: Finished difference Result 21009 states and 30865 transitions. [2025-02-05 16:46:44,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:46:44,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:46:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:44,951 INFO L225 Difference]: With dead ends: 21009 [2025-02-05 16:46:44,951 INFO L226 Difference]: Without dead ends: 14346 [2025-02-05 16:46:44,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:46:44,959 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1773 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:44,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 1075 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:46:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14346 states. [2025-02-05 16:46:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14346 to 7113. [2025-02-05 16:46:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7112 states have (on average 1.4735658042744657) internal successors, (10480), 7112 states have internal predecessors, (10480), 0 states have call successors, (0), 0 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:46:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 10480 transitions. [2025-02-05 16:46:45,068 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 10480 transitions. Word has length 138 [2025-02-05 16:46:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:45,068 INFO L471 AbstractCegarLoop]: Abstraction has 7113 states and 10480 transitions. [2025-02-05 16:46:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:46:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 10480 transitions. [2025-02-05 16:46:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:46:45,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:45,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:45,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:46:45,071 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:45,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash -146771849, now seen corresponding path program 1 times [2025-02-05 16:46:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:45,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149942165] [2025-02-05 16:46:45,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:45,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:46:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:46:45,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:45,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:45,311 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:46:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149942165] [2025-02-05 16:46:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149942165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330315760] [2025-02-05 16:46:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:45,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:45,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:45,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:45,312 INFO L87 Difference]: Start difference. First operand 7113 states and 10480 transitions. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:46:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:45,869 INFO L93 Difference]: Finished difference Result 20433 states and 30113 transitions. [2025-02-05 16:46:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:46:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:46:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:45,889 INFO L225 Difference]: With dead ends: 20433 [2025-02-05 16:46:45,889 INFO L226 Difference]: Without dead ends: 13898 [2025-02-05 16:46:45,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:46:45,897 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1096 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:45,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1170 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:46:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13898 states. [2025-02-05 16:46:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13898 to 6962. [2025-02-05 16:46:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6962 states, 6961 states have (on average 1.4729205573911794) internal successors, (10253), 6961 states have internal predecessors, (10253), 0 states have call successors, (0), 0 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:46:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 10253 transitions. [2025-02-05 16:46:45,993 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 10253 transitions. Word has length 138 [2025-02-05 16:46:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:45,993 INFO L471 AbstractCegarLoop]: Abstraction has 6962 states and 10253 transitions. [2025-02-05 16:46:45,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:46:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 10253 transitions. [2025-02-05 16:46:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 16:46:45,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:45,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:45,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:46:45,995 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:45,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash 200170688, now seen corresponding path program 1 times [2025-02-05 16:46:45,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:45,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583793686] [2025-02-05 16:46:45,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:46,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 16:46:46,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 16:46:46,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:46,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:46,347 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:46:46,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:46,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583793686] [2025-02-05 16:46:46,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583793686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:46,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:46,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:46:46,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988872565] [2025-02-05 16:46:46,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:46,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:46:46,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:46,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:46:46,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:46:46,348 INFO L87 Difference]: Start difference. First operand 6962 states and 10253 transitions. Second operand has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:46:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:47,055 INFO L93 Difference]: Finished difference Result 20765 states and 30496 transitions. [2025-02-05 16:46:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:46:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-05 16:46:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:47,070 INFO L225 Difference]: With dead ends: 20765 [2025-02-05 16:46:47,070 INFO L226 Difference]: Without dead ends: 14087 [2025-02-05 16:46:47,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:46:47,077 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1083 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:47,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1609 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:46:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14087 states. [2025-02-05 16:46:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14087 to 6962. [2025-02-05 16:46:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6962 states, 6961 states have (on average 1.4724895848297659) internal successors, (10250), 6961 states have internal predecessors, (10250), 0 states have call successors, (0), 0 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:46:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 10250 transitions. [2025-02-05 16:46:47,174 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 10250 transitions. Word has length 139 [2025-02-05 16:46:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:47,175 INFO L471 AbstractCegarLoop]: Abstraction has 6962 states and 10250 transitions. [2025-02-05 16:46:47,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:46:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 10250 transitions. [2025-02-05 16:46:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 16:46:47,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:47,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:47,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:46:47,176 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash -848002360, now seen corresponding path program 1 times [2025-02-05 16:46:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:47,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122079232] [2025-02-05 16:46:47,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:47,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 16:46:47,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 16:46:47,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:47,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:47,451 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:46:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122079232] [2025-02-05 16:46:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122079232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563493681] [2025-02-05 16:46:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:47,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:47,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:47,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:47,452 INFO L87 Difference]: Start difference. First operand 6962 states and 10250 transitions. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:46:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:47,844 INFO L93 Difference]: Finished difference Result 20469 states and 30154 transitions. [2025-02-05 16:46:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:46:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-05 16:46:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:47,857 INFO L225 Difference]: With dead ends: 20469 [2025-02-05 16:46:47,857 INFO L226 Difference]: Without dead ends: 13814 [2025-02-05 16:46:47,865 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:46:47,865 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1226 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:47,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 790 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:46:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13814 states. [2025-02-05 16:46:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13814 to 6962. [2025-02-05 16:46:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6962 states, 6961 states have (on average 1.4709093521045826) internal successors, (10239), 6961 states have internal predecessors, (10239), 0 states have call successors, (0), 0 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:46:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 10239 transitions. [2025-02-05 16:46:47,971 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 10239 transitions. Word has length 139 [2025-02-05 16:46:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:47,971 INFO L471 AbstractCegarLoop]: Abstraction has 6962 states and 10239 transitions. [2025-02-05 16:46:47,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:46:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 10239 transitions. [2025-02-05 16:46:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 16:46:47,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:47,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:47,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:46:47,974 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1611764367, now seen corresponding path program 1 times [2025-02-05 16:46:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:47,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099400638] [2025-02-05 16:46:47,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:47,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 16:46:48,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 16:46:48,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:48,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:48,183 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:46:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099400638] [2025-02-05 16:46:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099400638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704130559] [2025-02-05 16:46:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:48,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:48,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:48,184 INFO L87 Difference]: Start difference. First operand 6962 states and 10239 transitions. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:46:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:48,710 INFO L93 Difference]: Finished difference Result 20425 states and 30072 transitions. [2025-02-05 16:46:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:46:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-02-05 16:46:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:48,721 INFO L225 Difference]: With dead ends: 20425 [2025-02-05 16:46:48,722 INFO L226 Difference]: Without dead ends: 13905 [2025-02-05 16:46:48,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:46:48,725 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1119 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:48,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1149 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:46:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13905 states. [2025-02-05 16:46:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13905 to 7013. [2025-02-05 16:46:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7013 states, 7012 states have (on average 1.4699087278950371) internal successors, (10307), 7012 states have internal predecessors, (10307), 0 states have call successors, (0), 0 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:46:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7013 states to 7013 states and 10307 transitions. [2025-02-05 16:46:48,812 INFO L78 Accepts]: Start accepts. Automaton has 7013 states and 10307 transitions. Word has length 140 [2025-02-05 16:46:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:48,812 INFO L471 AbstractCegarLoop]: Abstraction has 7013 states and 10307 transitions. [2025-02-05 16:46:48,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:46:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7013 states and 10307 transitions. [2025-02-05 16:46:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 16:46:48,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:48,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:48,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:46:48,813 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:48,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash 445814040, now seen corresponding path program 1 times [2025-02-05 16:46:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:48,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593791790] [2025-02-05 16:46:48,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:48,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 16:46:48,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 16:46:48,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:48,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:49,198 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:46:49,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593791790] [2025-02-05 16:46:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593791790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:46:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228951795] [2025-02-05 16:46:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:49,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:46:49,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:49,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:46:49,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:46:49,200 INFO L87 Difference]: Start difference. First operand 7013 states and 10307 transitions. Second operand has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:50,107 INFO L93 Difference]: Finished difference Result 42130 states and 61975 transitions. [2025-02-05 16:46:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:46:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-02-05 16:46:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:50,139 INFO L225 Difference]: With dead ends: 42130 [2025-02-05 16:46:50,139 INFO L226 Difference]: Without dead ends: 35355 [2025-02-05 16:46:50,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:46:50,152 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 4195 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4195 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:50,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4195 Valid, 1306 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:46:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35355 states. [2025-02-05 16:46:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35355 to 7022. [2025-02-05 16:46:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7022 states, 7021 states have (on average 1.4688790770545506) internal successors, (10313), 7021 states have internal predecessors, (10313), 0 states have call successors, (0), 0 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:46:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 10313 transitions. [2025-02-05 16:46:50,336 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 10313 transitions. Word has length 141 [2025-02-05 16:46:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:50,337 INFO L471 AbstractCegarLoop]: Abstraction has 7022 states and 10313 transitions. [2025-02-05 16:46:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 10313 transitions. [2025-02-05 16:46:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 16:46:50,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:50,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:50,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:46:50,338 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:50,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash 456159620, now seen corresponding path program 1 times [2025-02-05 16:46:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746064122] [2025-02-05 16:46:50,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:50,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 16:46:50,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 16:46:50,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:50,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:50,710 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:46:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746064122] [2025-02-05 16:46:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746064122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:50,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:46:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917549295] [2025-02-05 16:46:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:50,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:46:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:50,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:46:50,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:46:50,711 INFO L87 Difference]: Start difference. First operand 7022 states and 10313 transitions. Second operand has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:51,509 INFO L93 Difference]: Finished difference Result 17469 states and 25671 transitions. [2025-02-05 16:46:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:46:51,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-02-05 16:46:51,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:51,518 INFO L225 Difference]: With dead ends: 17469 [2025-02-05 16:46:51,518 INFO L226 Difference]: Without dead ends: 10679 [2025-02-05 16:46:51,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:46:51,526 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 1459 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:51,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1994 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10679 states. [2025-02-05 16:46:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10679 to 6989. [2025-02-05 16:46:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6989 states, 6988 states have (on average 1.4698053806525473) internal successors, (10271), 6988 states have internal predecessors, (10271), 0 states have call successors, (0), 0 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:46:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 10271 transitions. [2025-02-05 16:46:51,599 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 10271 transitions. Word has length 142 [2025-02-05 16:46:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:51,599 INFO L471 AbstractCegarLoop]: Abstraction has 6989 states and 10271 transitions. [2025-02-05 16:46:51,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 10271 transitions. [2025-02-05 16:46:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 16:46:51,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:51,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:51,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:46:51,600 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:51,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -269054473, now seen corresponding path program 1 times [2025-02-05 16:46:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:51,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61098343] [2025-02-05 16:46:51,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:51,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:51,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 16:46:51,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 16:46:51,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:51,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:52,069 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:46:52,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:52,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61098343] [2025-02-05 16:46:52,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61098343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:52,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:52,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:46:52,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37140630] [2025-02-05 16:46:52,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:52,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:46:52,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:52,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:46:52,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:46:52,072 INFO L87 Difference]: Start difference. First operand 6989 states and 10271 transitions. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:52,948 INFO L93 Difference]: Finished difference Result 48752 states and 71755 transitions. [2025-02-05 16:46:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:46:52,948 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-02-05 16:46:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:52,988 INFO L225 Difference]: With dead ends: 48752 [2025-02-05 16:46:52,988 INFO L226 Difference]: Without dead ends: 42007 [2025-02-05 16:46:53,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:46:53,004 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 3252 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3252 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:53,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3252 Valid, 1378 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:46:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42007 states. [2025-02-05 16:46:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42007 to 7007. [2025-02-05 16:46:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7007 states, 7006 states have (on average 1.4681701398801028) internal successors, (10286), 7006 states have internal predecessors, (10286), 0 states have call successors, (0), 0 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:46:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 10286 transitions. [2025-02-05 16:46:53,231 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 10286 transitions. Word has length 142 [2025-02-05 16:46:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:53,231 INFO L471 AbstractCegarLoop]: Abstraction has 7007 states and 10286 transitions. [2025-02-05 16:46:53,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 10286 transitions. [2025-02-05 16:46:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 16:46:53,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:53,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:53,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:46:53,232 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1382410847, now seen corresponding path program 1 times [2025-02-05 16:46:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733274535] [2025-02-05 16:46:53,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:53,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:53,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 16:46:53,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 16:46:53,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:53,459 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:46:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733274535] [2025-02-05 16:46:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733274535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:53,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:53,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581396867] [2025-02-05 16:46:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:53,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:53,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:53,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:53,461 INFO L87 Difference]: Start difference. First operand 7007 states and 10286 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:53,930 INFO L93 Difference]: Finished difference Result 20666 states and 30395 transitions. [2025-02-05 16:46:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:46:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-02-05 16:46:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:53,943 INFO L225 Difference]: With dead ends: 20666 [2025-02-05 16:46:53,943 INFO L226 Difference]: Without dead ends: 13949 [2025-02-05 16:46:53,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:46:53,951 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 630 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:53,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1246 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:46:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13949 states. [2025-02-05 16:46:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13949 to 6998. [2025-02-05 16:46:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 6997 states have (on average 1.4683435758182077) internal successors, (10274), 6997 states have internal predecessors, (10274), 0 states have call successors, (0), 0 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:46:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 10274 transitions. [2025-02-05 16:46:54,036 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 10274 transitions. Word has length 142 [2025-02-05 16:46:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:54,037 INFO L471 AbstractCegarLoop]: Abstraction has 6998 states and 10274 transitions. [2025-02-05 16:46:54,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 10274 transitions. [2025-02-05 16:46:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:46:54,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:54,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:54,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:46:54,038 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:54,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2097448611, now seen corresponding path program 1 times [2025-02-05 16:46:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884594839] [2025-02-05 16:46:54,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:54,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:46:54,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:46:54,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:54,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:54,606 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:46:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884594839] [2025-02-05 16:46:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884594839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:46:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108352390] [2025-02-05 16:46:54,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:54,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:46:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:54,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:46:54,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:46:54,609 INFO L87 Difference]: Start difference. First operand 6998 states and 10274 transitions. Second operand has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:55,464 INFO L93 Difference]: Finished difference Result 28574 states and 42161 transitions. [2025-02-05 16:46:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:46:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:46:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:55,490 INFO L225 Difference]: With dead ends: 28574 [2025-02-05 16:46:55,490 INFO L226 Difference]: Without dead ends: 27124 [2025-02-05 16:46:55,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:46:55,500 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 1657 mSDsluCounter, 4756 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 5265 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:55,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 5265 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:46:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27124 states. [2025-02-05 16:46:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27124 to 6960. [2025-02-05 16:46:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6960 states, 6959 states have (on average 1.4675959189538728) internal successors, (10213), 6959 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:46:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6960 states to 6960 states and 10213 transitions. [2025-02-05 16:46:55,660 INFO L78 Accepts]: Start accepts. Automaton has 6960 states and 10213 transitions. Word has length 143 [2025-02-05 16:46:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:55,660 INFO L471 AbstractCegarLoop]: Abstraction has 6960 states and 10213 transitions. [2025-02-05 16:46:55,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6960 states and 10213 transitions. [2025-02-05 16:46:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:46:55,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:55,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:55,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:46:55,662 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1505599520, now seen corresponding path program 1 times [2025-02-05 16:46:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:55,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649651553] [2025-02-05 16:46:55,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:55,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:46:55,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:46:55,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:55,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:56,272 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:46:56,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:56,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649651553] [2025-02-05 16:46:56,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649651553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:56,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:56,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:46:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343352856] [2025-02-05 16:46:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:56,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:46:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:56,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:46:56,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:46:56,274 INFO L87 Difference]: Start difference. First operand 6960 states and 10213 transitions. Second operand has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:56,778 INFO L93 Difference]: Finished difference Result 15079 states and 22213 transitions. [2025-02-05 16:46:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:46:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:46:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:56,790 INFO L225 Difference]: With dead ends: 15079 [2025-02-05 16:46:56,790 INFO L226 Difference]: Without dead ends: 13649 [2025-02-05 16:46:56,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:46:56,794 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1032 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:56,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 2766 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13649 states. [2025-02-05 16:46:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13649 to 6932. [2025-02-05 16:46:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6932 states, 6931 states have (on average 1.4667436156398788) internal successors, (10166), 6931 states have internal predecessors, (10166), 0 states have call successors, (0), 0 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:46:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6932 states to 6932 states and 10166 transitions. [2025-02-05 16:46:56,877 INFO L78 Accepts]: Start accepts. Automaton has 6932 states and 10166 transitions. Word has length 143 [2025-02-05 16:46:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:56,878 INFO L471 AbstractCegarLoop]: Abstraction has 6932 states and 10166 transitions. [2025-02-05 16:46:56,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6932 states and 10166 transitions. [2025-02-05 16:46:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:46:56,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:56,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:56,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:46:56,879 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2011226512, now seen corresponding path program 1 times [2025-02-05 16:46:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023307234] [2025-02-05 16:46:56,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:56,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:46:56,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:46:56,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:56,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:00,667 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:47:00,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023307234] [2025-02-05 16:47:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023307234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2025-02-05 16:47:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484792994] [2025-02-05 16:47:00,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:00,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-05 16:47:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-05 16:47:00,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2468, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 16:47:00,670 INFO L87 Difference]: Start difference. First operand 6932 states and 10166 transitions. Second operand has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:14,274 INFO L93 Difference]: Finished difference Result 19313 states and 28418 transitions. [2025-02-05 16:47:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-05 16:47:14,274 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:47:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:14,287 INFO L225 Difference]: With dead ends: 19313 [2025-02-05 16:47:14,287 INFO L226 Difference]: Without dead ends: 18625 [2025-02-05 16:47:14,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1322, Invalid=8380, Unknown=0, NotChecked=0, Total=9702 [2025-02-05 16:47:14,291 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 3767 mSDsluCounter, 26747 mSDsCounter, 0 mSdLazyCounter, 18558 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3767 SdHoareTripleChecker+Valid, 27766 SdHoareTripleChecker+Invalid, 18587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 18558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:14,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3767 Valid, 27766 Invalid, 18587 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 18558 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-02-05 16:47:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18625 states. [2025-02-05 16:47:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18625 to 7023. [2025-02-05 16:47:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7023 states, 7022 states have (on average 1.465252064938764) internal successors, (10289), 7022 states have internal predecessors, (10289), 0 states have call successors, (0), 0 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:47:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 10289 transitions. [2025-02-05 16:47:14,382 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 10289 transitions. Word has length 143 [2025-02-05 16:47:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:14,382 INFO L471 AbstractCegarLoop]: Abstraction has 7023 states and 10289 transitions. [2025-02-05 16:47:14,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 10289 transitions. [2025-02-05 16:47:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:47:14,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:14,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:14,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:47:14,384 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:14,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1906963784, now seen corresponding path program 1 times [2025-02-05 16:47:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:14,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236134330] [2025-02-05 16:47:14,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:14,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:47:14,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:47:14,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236134330] [2025-02-05 16:47:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236134330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:14,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:14,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:47:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815786884] [2025-02-05 16:47:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:14,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:47:14,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:14,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:47:14,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:47:14,816 INFO L87 Difference]: Start difference. First operand 7023 states and 10289 transitions. Second operand has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:15,280 INFO L93 Difference]: Finished difference Result 15080 states and 22203 transitions. [2025-02-05 16:47:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:47:15,282 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:47:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:15,294 INFO L225 Difference]: With dead ends: 15080 [2025-02-05 16:47:15,294 INFO L226 Difference]: Without dead ends: 13654 [2025-02-05 16:47:15,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:47:15,298 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1028 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:15,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2746 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:47:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13654 states. [2025-02-05 16:47:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13654 to 6996. [2025-02-05 16:47:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6996 states, 6995 states have (on average 1.4640457469621158) internal successors, (10241), 6995 states have internal predecessors, (10241), 0 states have call successors, (0), 0 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:47:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 10241 transitions. [2025-02-05 16:47:15,378 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 10241 transitions. Word has length 143 [2025-02-05 16:47:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 6996 states and 10241 transitions. [2025-02-05 16:47:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 10241 transitions. [2025-02-05 16:47:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:47:15,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:15,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:15,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:47:15,379 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:15,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 408383952, now seen corresponding path program 1 times [2025-02-05 16:47:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:15,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200644265] [2025-02-05 16:47:15,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:15,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:47:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:47:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:15,811 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:47:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200644265] [2025-02-05 16:47:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200644265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:15,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:47:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15165550] [2025-02-05 16:47:15,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:15,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:47:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:15,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:47:15,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:47:15,812 INFO L87 Difference]: Start difference. First operand 6996 states and 10241 transitions. Second operand has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:16,316 INFO L93 Difference]: Finished difference Result 15024 states and 22106 transitions. [2025-02-05 16:47:16,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:47:16,317 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:47:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:16,329 INFO L225 Difference]: With dead ends: 15024 [2025-02-05 16:47:16,329 INFO L226 Difference]: Without dead ends: 13514 [2025-02-05 16:47:16,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:47:16,334 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 1056 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:16,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 2869 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:47:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13514 states. [2025-02-05 16:47:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13514 to 6893. [2025-02-05 16:47:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6893 states, 6892 states have (on average 1.4660475914103308) internal successors, (10104), 6892 states have internal predecessors, (10104), 0 states have call successors, (0), 0 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:47:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6893 states to 6893 states and 10104 transitions. [2025-02-05 16:47:16,425 INFO L78 Accepts]: Start accepts. Automaton has 6893 states and 10104 transitions. Word has length 143 [2025-02-05 16:47:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:16,425 INFO L471 AbstractCegarLoop]: Abstraction has 6893 states and 10104 transitions. [2025-02-05 16:47:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6893 states and 10104 transitions. [2025-02-05 16:47:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:47:16,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:16,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:16,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:47:16,426 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:16,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1631664378, now seen corresponding path program 1 times [2025-02-05 16:47:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:16,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243127737] [2025-02-05 16:47:16,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:16,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:47:16,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:47:16,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:16,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:16,622 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:47:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243127737] [2025-02-05 16:47:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243127737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:16,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:16,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:47:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037861045] [2025-02-05 16:47:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:47:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:16,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:47:16,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:47:16,624 INFO L87 Difference]: Start difference. First operand 6893 states and 10104 transitions. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 9 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:17,130 INFO L93 Difference]: Finished difference Result 20348 states and 29904 transitions. [2025-02-05 16:47:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:47:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 9 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:47:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:17,144 INFO L225 Difference]: With dead ends: 20348 [2025-02-05 16:47:17,144 INFO L226 Difference]: Without dead ends: 13702 [2025-02-05 16:47:17,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:47:17,152 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 614 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:17,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1205 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:47:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13702 states. [2025-02-05 16:47:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13702 to 6878. [2025-02-05 16:47:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6878 states, 6877 states have (on average 1.466191653337211) internal successors, (10083), 6877 states have internal predecessors, (10083), 0 states have call successors, (0), 0 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:47:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6878 states to 6878 states and 10083 transitions. [2025-02-05 16:47:17,285 INFO L78 Accepts]: Start accepts. Automaton has 6878 states and 10083 transitions. Word has length 143 [2025-02-05 16:47:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:17,286 INFO L471 AbstractCegarLoop]: Abstraction has 6878 states and 10083 transitions. [2025-02-05 16:47:17,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 9 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6878 states and 10083 transitions. [2025-02-05 16:47:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:47:17,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:17,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:17,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:47:17,287 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:17,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1127638872, now seen corresponding path program 1 times [2025-02-05 16:47:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:17,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194558350] [2025-02-05 16:47:17,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:17,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:47:17,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:47:17,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:17,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:17,761 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:47:17,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:17,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194558350] [2025-02-05 16:47:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194558350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:17,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:17,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:47:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166086505] [2025-02-05 16:47:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:17,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:47:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:17,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:47:17,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:47:17,763 INFO L87 Difference]: Start difference. First operand 6878 states and 10083 transitions. Second operand has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:18,283 INFO L93 Difference]: Finished difference Result 16247 states and 23930 transitions. [2025-02-05 16:47:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:47:18,283 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:47:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:18,297 INFO L225 Difference]: With dead ends: 16247 [2025-02-05 16:47:18,297 INFO L226 Difference]: Without dead ends: 14759 [2025-02-05 16:47:18,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:47:18,302 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1044 mSDsluCounter, 4222 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 4840 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:18,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 4840 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:47:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14759 states. [2025-02-05 16:47:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14759 to 6768. [2025-02-05 16:47:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6768 states, 6767 states have (on average 1.4691887099157677) internal successors, (9942), 6767 states have internal predecessors, (9942), 0 states have call successors, (0), 0 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:47:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 9942 transitions. [2025-02-05 16:47:18,397 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 9942 transitions. Word has length 143 [2025-02-05 16:47:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:18,397 INFO L471 AbstractCegarLoop]: Abstraction has 6768 states and 9942 transitions. [2025-02-05 16:47:18,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 9942 transitions. [2025-02-05 16:47:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:47:18,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:18,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:18,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:47:18,398 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:18,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash -73624704, now seen corresponding path program 1 times [2025-02-05 16:47:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557901935] [2025-02-05 16:47:18,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:18,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:47:18,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:47:18,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:18,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:22,107 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:47:22,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:22,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557901935] [2025-02-05 16:47:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557901935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:22,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:22,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2025-02-05 16:47:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145575084] [2025-02-05 16:47:22,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:22,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-05 16:47:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:22,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-05 16:47:22,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2479, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 16:47:22,109 INFO L87 Difference]: Start difference. First operand 6768 states and 9942 transitions. Second operand has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:37,788 INFO L93 Difference]: Finished difference Result 13121 states and 19288 transitions. [2025-02-05 16:47:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-05 16:47:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:47:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:37,801 INFO L225 Difference]: With dead ends: 13121 [2025-02-05 16:47:37,801 INFO L226 Difference]: Without dead ends: 12433 [2025-02-05 16:47:37,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1413, Invalid=8289, Unknown=0, NotChecked=0, Total=9702 [2025-02-05 16:47:37,806 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 3432 mSDsluCounter, 26580 mSDsCounter, 0 mSdLazyCounter, 19229 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3432 SdHoareTripleChecker+Valid, 27587 SdHoareTripleChecker+Invalid, 19252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 19229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:37,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3432 Valid, 27587 Invalid, 19252 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 19229 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-02-05 16:47:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12433 states. [2025-02-05 16:47:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12433 to 6801. [2025-02-05 16:47:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6801 states, 6800 states have (on average 1.4683823529411764) internal successors, (9985), 6800 states have internal predecessors, (9985), 0 states have call successors, (0), 0 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:47:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 9985 transitions. [2025-02-05 16:47:37,892 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 9985 transitions. Word has length 143 [2025-02-05 16:47:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:37,892 INFO L471 AbstractCegarLoop]: Abstraction has 6801 states and 9985 transitions. [2025-02-05 16:47:37,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 9985 transitions. [2025-02-05 16:47:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:47:37,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:37,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:37,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:47:37,893 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:37,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1377133973, now seen corresponding path program 1 times [2025-02-05 16:47:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:37,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936571582] [2025-02-05 16:47:37,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:47:37,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:47:37,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:38,317 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:47:38,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:38,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936571582] [2025-02-05 16:47:38,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936571582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:38,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:38,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:47:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662464434] [2025-02-05 16:47:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:38,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:47:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:38,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:47:38,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:47:38,319 INFO L87 Difference]: Start difference. First operand 6801 states and 9985 transitions. Second operand has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:38,698 INFO L93 Difference]: Finished difference Result 14695 states and 21679 transitions. [2025-02-05 16:47:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:47:38,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 16:47:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:38,717 INFO L225 Difference]: With dead ends: 14695 [2025-02-05 16:47:38,718 INFO L226 Difference]: Without dead ends: 13250 [2025-02-05 16:47:38,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:47:38,727 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 806 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:38,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1660 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:47:38,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13250 states. [2025-02-05 16:47:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13250 to 6730. [2025-02-05 16:47:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6730 states, 6729 states have (on average 1.4703522068658048) internal successors, (9894), 6729 states have internal predecessors, (9894), 0 states have call successors, (0), 0 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:47:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 9894 transitions. [2025-02-05 16:47:38,844 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 9894 transitions. Word has length 143 [2025-02-05 16:47:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:38,844 INFO L471 AbstractCegarLoop]: Abstraction has 6730 states and 9894 transitions. [2025-02-05 16:47:38,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 12 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 9894 transitions. [2025-02-05 16:47:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:47:38,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:38,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:38,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:47:38,846 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:38,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1232731543, now seen corresponding path program 1 times [2025-02-05 16:47:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:38,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376936057] [2025-02-05 16:47:38,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:38,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:47:38,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:47:38,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:38,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:39,325 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:47:39,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:39,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376936057] [2025-02-05 16:47:39,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376936057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:39,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:39,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:47:39,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90322061] [2025-02-05 16:47:39,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:39,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:47:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:39,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:47:39,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:47:39,327 INFO L87 Difference]: Start difference. First operand 6730 states and 9894 transitions. Second operand has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:39,773 INFO L93 Difference]: Finished difference Result 14674 states and 21658 transitions. [2025-02-05 16:47:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:47:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-02-05 16:47:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:39,789 INFO L225 Difference]: With dead ends: 14674 [2025-02-05 16:47:39,790 INFO L226 Difference]: Without dead ends: 13300 [2025-02-05 16:47:39,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:47:39,796 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1045 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:39,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 2660 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:47:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13300 states. [2025-02-05 16:47:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13300 to 6711. [2025-02-05 16:47:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6711 states, 6710 states have (on average 1.4710879284649776) internal successors, (9871), 6710 states have internal predecessors, (9871), 0 states have call successors, (0), 0 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:47:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 9871 transitions. [2025-02-05 16:47:39,886 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 9871 transitions. Word has length 144 [2025-02-05 16:47:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:39,886 INFO L471 AbstractCegarLoop]: Abstraction has 6711 states and 9871 transitions. [2025-02-05 16:47:39,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 13 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 9871 transitions. [2025-02-05 16:47:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:47:39,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:39,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:47:39,887 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash 801279768, now seen corresponding path program 1 times [2025-02-05 16:47:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91838099] [2025-02-05 16:47:39,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:39,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:47:39,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:47:39,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:39,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:39,999 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:47:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91838099] [2025-02-05 16:47:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91838099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:39,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:47:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762222600] [2025-02-05 16:47:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:40,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:47:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:40,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:47:40,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:47:40,000 INFO L87 Difference]: Start difference. First operand 6711 states and 9871 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:40,044 INFO L93 Difference]: Finished difference Result 16073 states and 23748 transitions. [2025-02-05 16:47:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:47:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-02-05 16:47:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:40,052 INFO L225 Difference]: With dead ends: 16073 [2025-02-05 16:47:40,052 INFO L226 Difference]: Without dead ends: 9553 [2025-02-05 16:47:40,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:47:40,057 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 133 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:40,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 668 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9553 states. [2025-02-05 16:47:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9553 to 9551. [2025-02-05 16:47:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9551 states, 9550 states have (on average 1.4699476439790575) internal successors, (14038), 9550 states have internal predecessors, (14038), 0 states have call successors, (0), 0 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:47:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 14038 transitions. [2025-02-05 16:47:40,163 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 14038 transitions. Word has length 144 [2025-02-05 16:47:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 9551 states and 14038 transitions. [2025-02-05 16:47:40,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 14038 transitions. [2025-02-05 16:47:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:47:40,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:40,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:40,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:47:40,165 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:40,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash 833483839, now seen corresponding path program 1 times [2025-02-05 16:47:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:40,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665564733] [2025-02-05 16:47:40,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:40,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:47:40,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:47:40,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:40,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:40,317 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:47:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:40,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665564733] [2025-02-05 16:47:40,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665564733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:40,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:40,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:47:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691976987] [2025-02-05 16:47:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:40,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:47:40,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:40,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:47:40,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:40,318 INFO L87 Difference]: Start difference. First operand 9551 states and 14038 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:40,347 INFO L93 Difference]: Finished difference Result 9589 states and 14093 transitions. [2025-02-05 16:47:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:47:40,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-02-05 16:47:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:40,355 INFO L225 Difference]: With dead ends: 9589 [2025-02-05 16:47:40,355 INFO L226 Difference]: Without dead ends: 9587 [2025-02-05 16:47:40,357 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:47:40,358 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:40,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1105 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9587 states. [2025-02-05 16:47:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9587 to 9587. [2025-02-05 16:47:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9587 states, 9586 states have (on average 1.4642186522011267) internal successors, (14036), 9586 states have internal predecessors, (14036), 0 states have call successors, (0), 0 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:47:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 14036 transitions. [2025-02-05 16:47:40,437 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 14036 transitions. Word has length 144 [2025-02-05 16:47:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:40,438 INFO L471 AbstractCegarLoop]: Abstraction has 9587 states and 14036 transitions. [2025-02-05 16:47:40,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 14036 transitions. [2025-02-05 16:47:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:47:40,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:40,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 16:47:40,439 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:40,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash 644028138, now seen corresponding path program 1 times [2025-02-05 16:47:40,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:40,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627365360] [2025-02-05 16:47:40,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:40,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:47:40,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:47:40,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:40,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:43,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:43,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627365360] [2025-02-05 16:47:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627365360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:43,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:43,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2025-02-05 16:47:43,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963882746] [2025-02-05 16:47:43,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:43,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 16:47:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:43,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 16:47:43,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2220, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 16:47:43,862 INFO L87 Difference]: Start difference. First operand 9587 states and 14036 transitions. Second operand has 49 states, 49 states have (on average 2.938775510204082) internal successors, (144), 49 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)