./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-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.6.1.ufo.UNBOUNDED.pals.c.p+lhb-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 06f1e7cb4ad4b39445b3c30d820384fbedafa8e52cac3d3c0cb4d178fb229699 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:43:39,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:43:39,449 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:43:39,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:43:39,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:43:39,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:43:39,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:43:39,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:43:39,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:43:39,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:43:39,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:43:39,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:43:39,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:43:39,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:43:39,491 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:43:39,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:43:39,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:43:39,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:43:39,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:43:39,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:43:39,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:43:39,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:43:39,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:43:39,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:39,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:43:39,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:43:39,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:43:39,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:43:39,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:43:39,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:43:39,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:43:39,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:43:39,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:43:39,494 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 -> 06f1e7cb4ad4b39445b3c30d820384fbedafa8e52cac3d3c0cb4d178fb229699 [2025-02-05 16:43:39,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:43:39,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:43:39,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:43:39,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:43:39,823 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:43:39,825 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.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-02-05 16:43:41,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c6461dd6/9af54d57f5c34b0d9233b7c30ff89ed1/FLAG28dc5cf96 [2025-02-05 16:43:41,582 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:43:41,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-02-05 16:43:41,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c6461dd6/9af54d57f5c34b0d9233b7c30ff89ed1/FLAG28dc5cf96 [2025-02-05 16:43:41,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c6461dd6/9af54d57f5c34b0d9233b7c30ff89ed1 [2025-02-05 16:43:41,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:43:41,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:43:41,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:41,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:43:41,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:43:41,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:41" (1/1) ... [2025-02-05 16:43:41,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77447d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:41, skipping insertion in model container [2025-02-05 16:43:41,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:41" (1/1) ... [2025-02-05 16:43:41,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:43:41,966 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.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[11714,11727] [2025-02-05 16:43:42,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:42,045 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:43:42,101 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.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[11714,11727] [2025-02-05 16:43:42,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:42,155 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:43:42,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42 WrapperNode [2025-02-05 16:43:42,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:42,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:42,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:43:42,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:43:42,163 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:43:42" (1/1) ... [2025-02-05 16:43:42,176 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:43:42" (1/1) ... [2025-02-05 16:43:42,243 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2025-02-05 16:43:42,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:42,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:43:42,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:43:42,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:43:42,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,298 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:43:42,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:43:42,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:43:42,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:43:42,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:43:42,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (1/1) ... [2025-02-05 16:43:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:43:42,395 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:43:42,399 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:43:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:43:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:43:42,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:43:42,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:43:42,567 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:43:42,569 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:43:43,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1159: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:43,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node6__m6~0#1; [2025-02-05 16:43:43,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: havoc main_~node6__m6~1#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node6__m6~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: havoc main_~node4__m4~0#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc main_~node4__m4~1#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L802: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node4__m4~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L274: havoc main_~node2__m2~0#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node2__m2~1#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1336: havoc main_~node6____CPAchecker_TMP_0~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1204: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L943: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:43,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L847: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L319: havoc main_~node5__m5~0#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: havoc main_~node5__m5~1#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L254: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L387: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: havoc main_~node5__m5~2#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: havoc main_~node3__m3~0#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: havoc main_~node3__m3~1#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1381: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L556: havoc main_~node3__m3~2#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1516: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L757: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1255: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:43,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L892: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:43,553 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 16:43:43,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:43:43,578 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:43:43,582 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:43:43,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:43:43 BoogieIcfgContainer [2025-02-05 16:43:43,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:43:43,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:43:43,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:43:43,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:43:43,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:43:41" (1/3) ... [2025-02-05 16:43:43,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4cd8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:43:43, skipping insertion in model container [2025-02-05 16:43:43,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:42" (2/3) ... [2025-02-05 16:43:43,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4cd8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:43:43, skipping insertion in model container [2025-02-05 16:43:43,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:43:43" (3/3) ... [2025-02-05 16:43:43,592 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-02-05 16:43:43,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:43:43,610 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c that has 1 procedures, 257 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:43:43,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:43:43,697 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;@3e20be41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:43:43,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:43:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 255 states have (on average 1.6705882352941177) internal successors, (426), 256 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:43:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:43:43,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:43,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] [2025-02-05 16:43:43,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:43,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash -708833910, now seen corresponding path program 1 times [2025-02-05 16:43:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335609455] [2025-02-05 16:43:43,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:43,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:43:43,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:43:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:44,362 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:43:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335609455] [2025-02-05 16:43:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335609455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:44,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:43:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693624013] [2025-02-05 16:43:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:44,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:43:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:44,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:43:44,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:43:44,408 INFO L87 Difference]: Start difference. First operand has 257 states, 255 states have (on average 1.6705882352941177) internal successors, (426), 256 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:43:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:44,544 INFO L93 Difference]: Finished difference Result 472 states and 770 transitions. [2025-02-05 16:43:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:43:44,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-02-05 16:43:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:44,558 INFO L225 Difference]: With dead ends: 472 [2025-02-05 16:43:44,560 INFO L226 Difference]: Without dead ends: 254 [2025-02-05 16:43:44,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:43:44,570 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1223 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-05 16:43:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-02-05 16:43:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.5019762845849802) internal successors, (380), 253 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:43:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2025-02-05 16:43:44,616 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 91 [2025-02-05 16:43:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:44,617 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2025-02-05 16:43:44,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:43:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2025-02-05 16:43:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:43:44,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:44,622 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:43:44,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:43:44,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:44,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -527949876, now seen corresponding path program 1 times [2025-02-05 16:43:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:44,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615405768] [2025-02-05 16:43:44,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:44,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:44,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:43:44,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:43:44,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:44,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:44,880 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:43:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615405768] [2025-02-05 16:43:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615405768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:44,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:44,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885448265] [2025-02-05 16:43:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:44,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:44,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:44,882 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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:43:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:44,963 INFO L93 Difference]: Finished difference Result 555 states and 860 transitions. [2025-02-05 16:43:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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:43:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:44,966 INFO L225 Difference]: With dead ends: 555 [2025-02-05 16:43:44,966 INFO L226 Difference]: Without dead ends: 362 [2025-02-05 16:43:44,967 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:43:44,970 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 207 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:44,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 662 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-05 16:43:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2025-02-05 16:43:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5264623955431755) internal successors, (548), 359 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:43:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 548 transitions. [2025-02-05 16:43:45,006 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 548 transitions. Word has length 130 [2025-02-05 16:43:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:45,006 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 548 transitions. [2025-02-05 16:43:45,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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:43:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 548 transitions. [2025-02-05 16:43:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 16:43:45,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:45,015 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:43:45,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:43:45,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:45,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1313822733, now seen corresponding path program 1 times [2025-02-05 16:43:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244222322] [2025-02-05 16:43:45,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:45,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 16:43:45,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 16:43:45,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:45,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:45,280 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:43:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244222322] [2025-02-05 16:43:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244222322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:45,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302237636] [2025-02-05 16:43:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:45,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:45,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:45,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:45,285 INFO L87 Difference]: Start difference. First operand 360 states and 548 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 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:43:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:45,333 INFO L93 Difference]: Finished difference Result 843 states and 1319 transitions. [2025-02-05 16:43:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 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:43:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:45,338 INFO L225 Difference]: With dead ends: 843 [2025-02-05 16:43:45,338 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 16:43:45,340 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:43:45,343 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 194 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:45,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 642 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 16:43:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2025-02-05 16:43:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.546617915904936) internal successors, (846), 547 states have internal predecessors, (846), 0 states have call successors, (0), 0 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:43:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 846 transitions. [2025-02-05 16:43:45,377 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 846 transitions. Word has length 132 [2025-02-05 16:43:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:45,377 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 846 transitions. [2025-02-05 16:43:45,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 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:43:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 846 transitions. [2025-02-05 16:43:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:43:45,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:45,384 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:43:45,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:43:45,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:45,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:45,386 INFO L85 PathProgramCache]: Analyzing trace with hash -107836462, now seen corresponding path program 1 times [2025-02-05 16:43:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:45,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756604580] [2025-02-05 16:43:45,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:45,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:45,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:43:45,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:43:45,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:45,558 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:43:45,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:45,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756604580] [2025-02-05 16:43:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756604580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:45,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:45,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:45,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828845939] [2025-02-05 16:43:45,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:45,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:45,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:45,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:45,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:45,560 INFO L87 Difference]: Start difference. First operand 548 states and 846 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 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:43:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:45,605 INFO L93 Difference]: Finished difference Result 1349 states and 2123 transitions. [2025-02-05 16:43:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:45,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 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:43:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:45,614 INFO L225 Difference]: With dead ends: 1349 [2025-02-05 16:43:45,615 INFO L226 Difference]: Without dead ends: 874 [2025-02-05 16:43:45,616 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:43:45,617 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 181 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:45,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 669 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-02-05 16:43:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2025-02-05 16:43:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.5591274397244546) internal successors, (1358), 871 states have internal predecessors, (1358), 0 states have call successors, (0), 0 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:43:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1358 transitions. [2025-02-05 16:43:45,657 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1358 transitions. Word has length 134 [2025-02-05 16:43:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:45,658 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1358 transitions. [2025-02-05 16:43:45,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 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:43:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1358 transitions. [2025-02-05 16:43:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:43:45,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:45,662 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:43:45,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:43:45,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:45,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1626154917, now seen corresponding path program 1 times [2025-02-05 16:43:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366455] [2025-02-05 16:43:45,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:45,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:43:45,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:43:45,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:45,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366455] [2025-02-05 16:43:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:45,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:45,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235603987] [2025-02-05 16:43:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:45,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:45,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:45,821 INFO L87 Difference]: Start difference. First operand 872 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 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:43:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:45,871 INFO L93 Difference]: Finished difference Result 2207 states and 3479 transitions. [2025-02-05 16:43:45,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 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:43:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:45,882 INFO L225 Difference]: With dead ends: 2207 [2025-02-05 16:43:45,883 INFO L226 Difference]: Without dead ends: 1414 [2025-02-05 16:43:45,885 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:43:45,888 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 168 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:45,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 602 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-02-05 16:43:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1412. [2025-02-05 16:43:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.56343019135365) internal successors, (2206), 1411 states have internal predecessors, (2206), 0 states have call successors, (0), 0 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:43:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2206 transitions. [2025-02-05 16:43:45,945 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2206 transitions. Word has length 136 [2025-02-05 16:43:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:45,946 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2206 transitions. [2025-02-05 16:43:45,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 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:43:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2206 transitions. [2025-02-05 16:43:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:43:45,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:45,953 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:43:45,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:43:45,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:45,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:45,954 INFO L85 PathProgramCache]: Analyzing trace with hash 813075370, now seen corresponding path program 1 times [2025-02-05 16:43:45,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:45,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247993198] [2025-02-05 16:43:45,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:45,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:45,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:43:46,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:43:46,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:46,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:46,111 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:43:46,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247993198] [2025-02-05 16:43:46,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247993198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:46,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031935949] [2025-02-05 16:43:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:46,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:46,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:46,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:46,113 INFO L87 Difference]: Start difference. First operand 1412 states and 2206 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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:43:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:46,157 INFO L93 Difference]: Finished difference Result 3601 states and 5663 transitions. [2025-02-05 16:43:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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:43:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:46,168 INFO L225 Difference]: With dead ends: 3601 [2025-02-05 16:43:46,168 INFO L226 Difference]: Without dead ends: 2274 [2025-02-05 16:43:46,170 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:43:46,171 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 155 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:46,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 597 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-02-05 16:43:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2272. [2025-02-05 16:43:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.5596653456627037) internal successors, (3542), 2271 states have internal predecessors, (3542), 0 states have call successors, (0), 0 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:43:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3542 transitions. [2025-02-05 16:43:46,230 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3542 transitions. Word has length 138 [2025-02-05 16:43:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:46,231 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 3542 transitions. [2025-02-05 16:43:46,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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:43:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3542 transitions. [2025-02-05 16:43:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 16:43:46,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:46,237 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:43:46,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:43:46,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:46,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1152020921, now seen corresponding path program 1 times [2025-02-05 16:43:46,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718225196] [2025-02-05 16:43:46,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:46,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 16:43:46,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 16:43:46,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:46,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:46,538 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:43:46,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:46,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718225196] [2025-02-05 16:43:46,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718225196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:46,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:46,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645761062] [2025-02-05 16:43:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:46,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:46,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:46,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:46,542 INFO L87 Difference]: Start difference. First operand 2272 states and 3542 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 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:43:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:47,278 INFO L93 Difference]: Finished difference Result 24689 states and 38597 transitions. [2025-02-05 16:43:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:43:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 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:43:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:47,379 INFO L225 Difference]: With dead ends: 24689 [2025-02-05 16:43:47,379 INFO L226 Difference]: Without dead ends: 22508 [2025-02-05 16:43:47,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:43:47,394 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 2519 mSDsluCounter, 5134 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2519 SdHoareTripleChecker+Valid, 5931 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:47,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2519 Valid, 5931 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:43:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22508 states. [2025-02-05 16:43:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22508 to 4488. [2025-02-05 16:43:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4488 states, 4487 states have (on average 1.53599286828616) internal successors, (6892), 4487 states have internal predecessors, (6892), 0 states have call successors, (0), 0 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:43:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6892 transitions. [2025-02-05 16:43:47,759 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6892 transitions. Word has length 140 [2025-02-05 16:43:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:47,759 INFO L471 AbstractCegarLoop]: Abstraction has 4488 states and 6892 transitions. [2025-02-05 16:43:47,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 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:43:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6892 transitions. [2025-02-05 16:43:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 16:43:47,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:47,770 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:43:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:43:47,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1351870091, now seen corresponding path program 1 times [2025-02-05 16:43:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:47,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751822213] [2025-02-05 16:43:47,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:47,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 16:43:47,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 16:43:47,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:47,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:47,875 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:43:47,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:47,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751822213] [2025-02-05 16:43:47,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751822213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:47,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:47,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:47,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876954567] [2025-02-05 16:43:47,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:47,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:47,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:47,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:47,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:47,877 INFO L87 Difference]: Start difference. First operand 4488 states and 6892 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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:43:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:47,975 INFO L93 Difference]: Finished difference Result 12513 states and 19228 transitions. [2025-02-05 16:43:47,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:47,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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:43:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:47,995 INFO L225 Difference]: With dead ends: 12513 [2025-02-05 16:43:47,995 INFO L226 Difference]: Without dead ends: 8074 [2025-02-05 16:43:48,004 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:43:48,005 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 205 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:48,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 777 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2025-02-05 16:43:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2025-02-05 16:43:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8072 states, 8071 states have (on average 1.5267005327716516) internal successors, (12322), 8071 states have internal predecessors, (12322), 0 states have call successors, (0), 0 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:43:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 12322 transitions. [2025-02-05 16:43:48,205 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 12322 transitions. Word has length 143 [2025-02-05 16:43:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:48,206 INFO L471 AbstractCegarLoop]: Abstraction has 8072 states and 12322 transitions. [2025-02-05 16:43:48,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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:43:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 12322 transitions. [2025-02-05 16:43:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:43:48,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:48,225 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:43:48,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:43:48,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1727984276, now seen corresponding path program 1 times [2025-02-05 16:43:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297239044] [2025-02-05 16:43:48,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:48,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:43:48,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:43:48,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:48,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:48,389 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:43:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297239044] [2025-02-05 16:43:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297239044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739107218] [2025-02-05 16:43:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:48,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:48,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:48,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:48,391 INFO L87 Difference]: Start difference. First operand 8072 states and 12322 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:48,549 INFO L93 Difference]: Finished difference Result 18816 states and 28711 transitions. [2025-02-05 16:43:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:48,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-02-05 16:43:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:48,575 INFO L225 Difference]: With dead ends: 18816 [2025-02-05 16:43:48,576 INFO L226 Difference]: Without dead ends: 10827 [2025-02-05 16:43:48,587 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:43:48,588 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 223 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:48,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 516 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10827 states. [2025-02-05 16:43:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10827 to 10761. [2025-02-05 16:43:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10760 states have (on average 1.5021375464684015) internal successors, (16163), 10760 states have internal predecessors, (16163), 0 states have call successors, (0), 0 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:43:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 16163 transitions. [2025-02-05 16:43:48,833 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 16163 transitions. Word has length 144 [2025-02-05 16:43:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:48,834 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 16163 transitions. [2025-02-05 16:43:48,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 16163 transitions. [2025-02-05 16:43:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:43:48,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:48,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:43:48,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:48,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1841463269, now seen corresponding path program 1 times [2025-02-05 16:43:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192647373] [2025-02-05 16:43:48,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:48,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:43:48,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:43:48,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:48,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:49,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:49,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192647373] [2025-02-05 16:43:49,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192647373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:49,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:49,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:49,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390744675] [2025-02-05 16:43:49,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:49,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:49,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:49,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:49,318 INFO L87 Difference]: Start difference. First operand 10761 states and 16163 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 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:43:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:49,723 INFO L93 Difference]: Finished difference Result 21440 states and 32230 transitions. [2025-02-05 16:43:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:49,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 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:43:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:49,747 INFO L225 Difference]: With dead ends: 21440 [2025-02-05 16:43:49,748 INFO L226 Difference]: Without dead ends: 10763 [2025-02-05 16:43:49,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:43:49,761 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 1402 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:49,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1389 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2025-02-05 16:43:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2025-02-05 16:43:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10760 states have (on average 1.4871747211895912) internal successors, (16002), 10760 states have internal predecessors, (16002), 0 states have call successors, (0), 0 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:43:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 16002 transitions. [2025-02-05 16:43:49,957 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 16002 transitions. Word has length 144 [2025-02-05 16:43:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:49,958 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 16002 transitions. [2025-02-05 16:43:49,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 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:43:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 16002 transitions. [2025-02-05 16:43:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:43:49,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:49,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:49,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:43:49,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash 747075984, now seen corresponding path program 1 times [2025-02-05 16:43:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374124953] [2025-02-05 16:43:49,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:50,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:43:50,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:43:50,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:50,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:50,333 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:43:50,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:50,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374124953] [2025-02-05 16:43:50,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374124953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:50,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:50,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:50,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299399990] [2025-02-05 16:43:50,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:50,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:50,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:50,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:50,336 INFO L87 Difference]: Start difference. First operand 10761 states and 16002 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:50,831 INFO L93 Difference]: Finished difference Result 66006 states and 98330 transitions. [2025-02-05 16:43:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-02-05 16:43:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:50,965 INFO L225 Difference]: With dead ends: 66006 [2025-02-05 16:43:50,965 INFO L226 Difference]: Without dead ends: 57396 [2025-02-05 16:43:50,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:50,999 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 2034 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:50,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 2476 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57396 states. [2025-02-05 16:43:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57396 to 19970. [2025-02-05 16:43:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19970 states, 19969 states have (on average 1.4813460864339727) internal successors, (29581), 19969 states have internal predecessors, (29581), 0 states have call successors, (0), 0 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:43:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19970 states to 19970 states and 29581 transitions. [2025-02-05 16:43:51,709 INFO L78 Accepts]: Start accepts. Automaton has 19970 states and 29581 transitions. Word has length 145 [2025-02-05 16:43:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:51,711 INFO L471 AbstractCegarLoop]: Abstraction has 19970 states and 29581 transitions. [2025-02-05 16:43:51,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19970 states and 29581 transitions. [2025-02-05 16:43:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:43:51,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:51,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:51,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:43:51,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:51,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 500081304, now seen corresponding path program 1 times [2025-02-05 16:43:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:51,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716220790] [2025-02-05 16:43:51,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:51,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:51,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:43:51,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:43:51,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:51,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:52,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:52,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716220790] [2025-02-05 16:43:52,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716220790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:52,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:52,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842062938] [2025-02-05 16:43:52,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:52,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:52,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:52,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:52,039 INFO L87 Difference]: Start difference. First operand 19970 states and 29581 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:52,564 INFO L93 Difference]: Finished difference Result 74898 states and 111462 transitions. [2025-02-05 16:43:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:52,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-02-05 16:43:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:52,697 INFO L225 Difference]: With dead ends: 74898 [2025-02-05 16:43:52,697 INFO L226 Difference]: Without dead ends: 66288 [2025-02-05 16:43:52,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:52,728 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 2061 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:52,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 2590 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66288 states. [2025-02-05 16:43:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66288 to 33272. [2025-02-05 16:43:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33272 states, 33271 states have (on average 1.4759099516095098) internal successors, (49105), 33271 states have internal predecessors, (49105), 0 states have call successors, (0), 0 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:43:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 49105 transitions. [2025-02-05 16:43:53,516 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 49105 transitions. Word has length 145 [2025-02-05 16:43:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:53,516 INFO L471 AbstractCegarLoop]: Abstraction has 33272 states and 49105 transitions. [2025-02-05 16:43:53,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 49105 transitions. [2025-02-05 16:43:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:43:53,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:53,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:53,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:43:53,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:53,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 583480136, now seen corresponding path program 1 times [2025-02-05 16:43:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584304020] [2025-02-05 16:43:53,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:53,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:43:53,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:43:53,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:53,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:53,983 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:43:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584304020] [2025-02-05 16:43:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584304020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896150289] [2025-02-05 16:43:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:53,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:53,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:53,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:53,985 INFO L87 Difference]: Start difference. First operand 33272 states and 49105 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:54,477 INFO L93 Difference]: Finished difference Result 83626 states and 124350 transitions. [2025-02-05 16:43:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:54,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-02-05 16:43:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:54,593 INFO L225 Difference]: With dead ends: 83626 [2025-02-05 16:43:54,593 INFO L226 Difference]: Without dead ends: 75016 [2025-02-05 16:43:54,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:54,631 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2035 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:54,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 2673 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75016 states. [2025-02-05 16:43:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75016 to 42309. [2025-02-05 16:43:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42309 states, 42308 states have (on average 1.4761747187293184) internal successors, (62454), 42308 states have internal predecessors, (62454), 0 states have call successors, (0), 0 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:43:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42309 states to 42309 states and 62454 transitions. [2025-02-05 16:43:55,562 INFO L78 Accepts]: Start accepts. Automaton has 42309 states and 62454 transitions. Word has length 145 [2025-02-05 16:43:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:55,563 INFO L471 AbstractCegarLoop]: Abstraction has 42309 states and 62454 transitions. [2025-02-05 16:43:55,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 42309 states and 62454 transitions. [2025-02-05 16:43:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:43:55,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:55,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:55,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:43:55,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:55,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash 343515146, now seen corresponding path program 1 times [2025-02-05 16:43:55,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:55,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018740499] [2025-02-05 16:43:55,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:55,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:55,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:43:55,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:43:55,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:55,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:55,969 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:43:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018740499] [2025-02-05 16:43:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018740499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:55,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037972021] [2025-02-05 16:43:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:55,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:55,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:55,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:55,971 INFO L87 Difference]: Start difference. First operand 42309 states and 62454 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:56,480 INFO L93 Difference]: Finished difference Result 92636 states and 137664 transitions. [2025-02-05 16:43:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-02-05 16:43:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:56,623 INFO L225 Difference]: With dead ends: 92636 [2025-02-05 16:43:56,624 INFO L226 Difference]: Without dead ends: 84026 [2025-02-05 16:43:56,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:56,665 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2082 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:56,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 2774 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84026 states. [2025-02-05 16:43:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84026 to 51436. [2025-02-05 16:43:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51436 states, 51435 states have (on average 1.4766793039758919) internal successors, (75953), 51435 states have internal predecessors, (75953), 0 states have call successors, (0), 0 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:43:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51436 states to 51436 states and 75953 transitions. [2025-02-05 16:43:57,959 INFO L78 Accepts]: Start accepts. Automaton has 51436 states and 75953 transitions. Word has length 145 [2025-02-05 16:43:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:57,959 INFO L471 AbstractCegarLoop]: Abstraction has 51436 states and 75953 transitions. [2025-02-05 16:43:57,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 51436 states and 75953 transitions. [2025-02-05 16:43:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:43:58,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:58,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:58,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:43:58,002 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:58,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 724911400, now seen corresponding path program 1 times [2025-02-05 16:43:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:58,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507681184] [2025-02-05 16:43:58,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:58,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:43:58,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:43:58,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:58,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:58,257 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:43:58,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:58,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507681184] [2025-02-05 16:43:58,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507681184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:58,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:58,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258887600] [2025-02-05 16:43:58,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:58,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:58,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:58,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:58,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:58,260 INFO L87 Difference]: Start difference. First operand 51436 states and 75953 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:58,901 INFO L93 Difference]: Finished difference Result 101723 states and 151099 transitions. [2025-02-05 16:43:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:58,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-02-05 16:43:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:59,055 INFO L225 Difference]: With dead ends: 101723 [2025-02-05 16:43:59,055 INFO L226 Difference]: Without dead ends: 93113 [2025-02-05 16:43:59,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:59,100 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 2242 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2242 SdHoareTripleChecker+Valid, 2811 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:59,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2242 Valid, 2811 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:43:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93113 states. [2025-02-05 16:44:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93113 to 60572. [2025-02-05 16:44:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60572 states, 60571 states have (on average 1.477059979197966) internal successors, (89467), 60571 states have internal predecessors, (89467), 0 states have call successors, (0), 0 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:44:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60572 states to 60572 states and 89467 transitions. [2025-02-05 16:44:00,211 INFO L78 Accepts]: Start accepts. Automaton has 60572 states and 89467 transitions. Word has length 145 [2025-02-05 16:44:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 60572 states and 89467 transitions. [2025-02-05 16:44:00,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 60572 states and 89467 transitions. [2025-02-05 16:44:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:44:00,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:00,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:00,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:44:00,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:00,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:00,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1162810195, now seen corresponding path program 1 times [2025-02-05 16:44:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866198745] [2025-02-05 16:44:00,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:00,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:44:00,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:44:00,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:00,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:00,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866198745] [2025-02-05 16:44:00,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866198745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:00,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:00,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:00,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185912587] [2025-02-05 16:44:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:00,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:44:00,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:00,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:44:00,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:44:00,562 INFO L87 Difference]: Start difference. First operand 60572 states and 89467 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:01,362 INFO L93 Difference]: Finished difference Result 105336 states and 156590 transitions. [2025-02-05 16:44:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:44:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-02-05 16:44:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:01,538 INFO L225 Difference]: With dead ends: 105336 [2025-02-05 16:44:01,538 INFO L226 Difference]: Without dead ends: 99510 [2025-02-05 16:44:01,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:01,565 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2255 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:01,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 2632 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99510 states. [2025-02-05 16:44:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99510 to 66969. [2025-02-05 16:44:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66969 states, 66968 states have (on average 1.4791243579022817) internal successors, (99054), 66968 states have internal predecessors, (99054), 0 states have call successors, (0), 0 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:44:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66969 states to 66969 states and 99054 transitions. [2025-02-05 16:44:02,485 INFO L78 Accepts]: Start accepts. Automaton has 66969 states and 99054 transitions. Word has length 146 [2025-02-05 16:44:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:02,486 INFO L471 AbstractCegarLoop]: Abstraction has 66969 states and 99054 transitions. [2025-02-05 16:44:02,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 66969 states and 99054 transitions. [2025-02-05 16:44:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:44:02,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:02,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:02,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:44:02,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:02,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1421197844, now seen corresponding path program 1 times [2025-02-05 16:44:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813941380] [2025-02-05 16:44:02,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:02,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:44:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:44:02,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:02,613 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:44:02,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:02,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813941380] [2025-02-05 16:44:02,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813941380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:02,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:02,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:02,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599161835] [2025-02-05 16:44:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:02,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:02,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:02,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:02,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:02,615 INFO L87 Difference]: Start difference. First operand 66969 states and 99054 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:03,578 INFO L93 Difference]: Finished difference Result 196489 states and 290195 transitions. [2025-02-05 16:44:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-02-05 16:44:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:03,743 INFO L225 Difference]: With dead ends: 196489 [2025-02-05 16:44:03,744 INFO L226 Difference]: Without dead ends: 132994 [2025-02-05 16:44:03,793 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:44:03,794 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 198 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:03,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 387 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132994 states. [2025-02-05 16:44:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132994 to 132992. [2025-02-05 16:44:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132992 states, 132991 states have (on average 1.4690242196840388) internal successors, (195367), 132991 states have internal predecessors, (195367), 0 states have call successors, (0), 0 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:44:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132992 states to 132992 states and 195367 transitions. [2025-02-05 16:44:05,825 INFO L78 Accepts]: Start accepts. Automaton has 132992 states and 195367 transitions. Word has length 147 [2025-02-05 16:44:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:05,825 INFO L471 AbstractCegarLoop]: Abstraction has 132992 states and 195367 transitions. [2025-02-05 16:44:05,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 132992 states and 195367 transitions. [2025-02-05 16:44:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:44:05,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:05,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:05,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:44:05,900 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:05,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash 23678323, now seen corresponding path program 1 times [2025-02-05 16:44:05,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:05,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469358083] [2025-02-05 16:44:05,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:05,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:44:05,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:44:05,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:05,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:06,016 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:44:06,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:06,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469358083] [2025-02-05 16:44:06,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469358083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:06,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:06,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:06,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860930709] [2025-02-05 16:44:06,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:06,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:06,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:06,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:06,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:06,018 INFO L87 Difference]: Start difference. First operand 132992 states and 195367 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:06,913 INFO L93 Difference]: Finished difference Result 218916 states and 323529 transitions. [2025-02-05 16:44:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-02-05 16:44:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:07,046 INFO L225 Difference]: With dead ends: 218916 [2025-02-05 16:44:07,046 INFO L226 Difference]: Without dead ends: 92821 [2025-02-05 16:44:07,107 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:44:07,108 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:07,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 554 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92821 states. [2025-02-05 16:44:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92821 to 92819. [2025-02-05 16:44:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92819 states, 92818 states have (on average 1.4802085802322826) internal successors, (137390), 92818 states have internal predecessors, (137390), 0 states have call successors, (0), 0 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:44:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92819 states to 92819 states and 137390 transitions. [2025-02-05 16:44:08,466 INFO L78 Accepts]: Start accepts. Automaton has 92819 states and 137390 transitions. Word has length 147 [2025-02-05 16:44:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 92819 states and 137390 transitions. [2025-02-05 16:44:08,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 92819 states and 137390 transitions. [2025-02-05 16:44:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:44:08,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:08,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:08,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:44:08,504 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:08,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1178909624, now seen corresponding path program 1 times [2025-02-05 16:44:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:08,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193575802] [2025-02-05 16:44:08,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:08,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:44:08,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:44:08,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:08,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:08,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193575802] [2025-02-05 16:44:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193575802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:08,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424263155] [2025-02-05 16:44:08,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:08,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:08,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:08,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:08,632 INFO L87 Difference]: Start difference. First operand 92819 states and 137390 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:09,211 INFO L93 Difference]: Finished difference Result 135783 states and 200992 transitions. [2025-02-05 16:44:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:09,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 16:44:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:09,279 INFO L225 Difference]: With dead ends: 135783 [2025-02-05 16:44:09,279 INFO L226 Difference]: Without dead ends: 46879 [2025-02-05 16:44:09,337 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:44:09,338 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 121 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:09,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 532 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46879 states. [2025-02-05 16:44:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46879 to 46877. [2025-02-05 16:44:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46877 states, 46876 states have (on average 1.4697499786671218) internal successors, (68896), 46876 states have internal predecessors, (68896), 0 states have call successors, (0), 0 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:44:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46877 states to 46877 states and 68896 transitions. [2025-02-05 16:44:10,120 INFO L78 Accepts]: Start accepts. Automaton has 46877 states and 68896 transitions. Word has length 148 [2025-02-05 16:44:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 46877 states and 68896 transitions. [2025-02-05 16:44:10,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46877 states and 68896 transitions. [2025-02-05 16:44:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:44:10,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:10,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:44:10,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash -176986878, now seen corresponding path program 1 times [2025-02-05 16:44:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368620814] [2025-02-05 16:44:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:44:10,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:44:10,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:10,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:10,245 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:44:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368620814] [2025-02-05 16:44:10,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368620814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:10,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953734599] [2025-02-05 16:44:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:10,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:10,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:10,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:10,247 INFO L87 Difference]: Start difference. First operand 46877 states and 68896 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:10,404 INFO L93 Difference]: Finished difference Result 68361 states and 100458 transitions. [2025-02-05 16:44:10,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:10,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 16:44:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:10,438 INFO L225 Difference]: With dead ends: 68361 [2025-02-05 16:44:10,438 INFO L226 Difference]: Without dead ends: 23701 [2025-02-05 16:44:10,469 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:44:10,471 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 114 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:10,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23701 states. [2025-02-05 16:44:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23701 to 23699. [2025-02-05 16:44:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23699 states, 23698 states have (on average 1.458772892227192) internal successors, (34570), 23698 states have internal predecessors, (34570), 0 states have call successors, (0), 0 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:44:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23699 states to 23699 states and 34570 transitions. [2025-02-05 16:44:10,715 INFO L78 Accepts]: Start accepts. Automaton has 23699 states and 34570 transitions. Word has length 148 [2025-02-05 16:44:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:10,716 INFO L471 AbstractCegarLoop]: Abstraction has 23699 states and 34570 transitions. [2025-02-05 16:44:10,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 23699 states and 34570 transitions. [2025-02-05 16:44:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:44:10,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:10,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:10,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:44:10,728 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:10,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash -952356728, now seen corresponding path program 1 times [2025-02-05 16:44:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:10,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947182765] [2025-02-05 16:44:10,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:10,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:44:10,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:44:10,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:10,835 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:44:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947182765] [2025-02-05 16:44:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947182765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004049535] [2025-02-05 16:44:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:10,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:10,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:10,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:10,838 INFO L87 Difference]: Start difference. First operand 23699 states and 34570 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:11,100 INFO L93 Difference]: Finished difference Result 34443 states and 50232 transitions. [2025-02-05 16:44:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 16:44:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:11,116 INFO L225 Difference]: With dead ends: 34443 [2025-02-05 16:44:11,116 INFO L226 Difference]: Without dead ends: 12105 [2025-02-05 16:44:11,133 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:44:11,134 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 118 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:11,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 496 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12105 states. [2025-02-05 16:44:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12105 to 12103. [2025-02-05 16:44:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12103 states, 12102 states have (on average 1.4470335481738557) internal successors, (17512), 12102 states have internal predecessors, (17512), 0 states have call successors, (0), 0 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:44:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12103 states to 12103 states and 17512 transitions. [2025-02-05 16:44:11,330 INFO L78 Accepts]: Start accepts. Automaton has 12103 states and 17512 transitions. Word has length 148 [2025-02-05 16:44:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:11,330 INFO L471 AbstractCegarLoop]: Abstraction has 12103 states and 17512 transitions. [2025-02-05 16:44:11,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 12103 states and 17512 transitions. [2025-02-05 16:44:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:44:11,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:11,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:11,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:44:11,339 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:11,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1087259720, now seen corresponding path program 1 times [2025-02-05 16:44:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776591967] [2025-02-05 16:44:11,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:11,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:44:11,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:44:11,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:11,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:11,912 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:44:11,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776591967] [2025-02-05 16:44:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776591967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3556029] [2025-02-05 16:44:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:11,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:11,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:11,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:11,914 INFO L87 Difference]: Start difference. First operand 12103 states and 17512 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:12,867 INFO L93 Difference]: Finished difference Result 36391 states and 52518 transitions. [2025-02-05 16:44:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 16:44:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:12,894 INFO L225 Difference]: With dead ends: 36391 [2025-02-05 16:44:12,894 INFO L226 Difference]: Without dead ends: 24347 [2025-02-05 16:44:12,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:44:12,909 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1629 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:12,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 1033 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24347 states. [2025-02-05 16:44:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24347 to 23985. [2025-02-05 16:44:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23985 states, 23984 states have (on average 1.4416277518345564) internal successors, (34576), 23984 states have internal predecessors, (34576), 0 states have call successors, (0), 0 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:44:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23985 states to 23985 states and 34576 transitions. [2025-02-05 16:44:13,313 INFO L78 Accepts]: Start accepts. Automaton has 23985 states and 34576 transitions. Word has length 148 [2025-02-05 16:44:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:13,313 INFO L471 AbstractCegarLoop]: Abstraction has 23985 states and 34576 transitions. [2025-02-05 16:44:13,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23985 states and 34576 transitions. [2025-02-05 16:44:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:44:13,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:13,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:13,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:44:13,325 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:13,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1668833256, now seen corresponding path program 1 times [2025-02-05 16:44:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:13,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467556855] [2025-02-05 16:44:13,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:13,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:44:13,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:44:13,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:13,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:13,840 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:44:13,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:13,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467556855] [2025-02-05 16:44:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467556855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:13,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:13,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:44:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378255262] [2025-02-05 16:44:13,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:13,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:44:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:13,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:44:13,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:44:13,843 INFO L87 Difference]: Start difference. First operand 23985 states and 34576 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:14,737 INFO L93 Difference]: Finished difference Result 72416 states and 103999 transitions. [2025-02-05 16:44:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:44:14,738 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 16:44:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:14,790 INFO L225 Difference]: With dead ends: 72416 [2025-02-05 16:44:14,790 INFO L226 Difference]: Without dead ends: 48560 [2025-02-05 16:44:14,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:44:14,815 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1742 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:14,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1164 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:44:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48560 states. [2025-02-05 16:44:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48560 to 47397. [2025-02-05 16:44:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47397 states, 47396 states have (on average 1.4358595662081188) internal successors, (68054), 47396 states have internal predecessors, (68054), 0 states have call successors, (0), 0 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:44:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47397 states to 47397 states and 68054 transitions. [2025-02-05 16:44:15,401 INFO L78 Accepts]: Start accepts. Automaton has 47397 states and 68054 transitions. Word has length 148 [2025-02-05 16:44:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:15,401 INFO L471 AbstractCegarLoop]: Abstraction has 47397 states and 68054 transitions. [2025-02-05 16:44:15,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 47397 states and 68054 transitions. [2025-02-05 16:44:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:44:15,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:15,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:15,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:44:15,419 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:15,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1671152238, now seen corresponding path program 1 times [2025-02-05 16:44:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:15,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526689231] [2025-02-05 16:44:15,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:15,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:44:15,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:44:15,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:15,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:15,530 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:44:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526689231] [2025-02-05 16:44:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526689231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:15,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:15,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446630620] [2025-02-05 16:44:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:15,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:15,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:15,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:15,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:15,532 INFO L87 Difference]: Start difference. First operand 47397 states and 68054 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:15,688 INFO L93 Difference]: Finished difference Result 68881 states and 98896 transitions. [2025-02-05 16:44:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 16:44:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:15,723 INFO L225 Difference]: With dead ends: 68881 [2025-02-05 16:44:15,723 INFO L226 Difference]: Without dead ends: 24575 [2025-02-05 16:44:15,755 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:44:15,755 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 113 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:15,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 470 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24575 states. [2025-02-05 16:44:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24575 to 24573. [2025-02-05 16:44:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24573 states, 24572 states have (on average 1.421048347712844) internal successors, (34918), 24572 states have internal predecessors, (34918), 0 states have call successors, (0), 0 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:44:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24573 states to 24573 states and 34918 transitions. [2025-02-05 16:44:16,349 INFO L78 Accepts]: Start accepts. Automaton has 24573 states and 34918 transitions. Word has length 148 [2025-02-05 16:44:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:16,349 INFO L471 AbstractCegarLoop]: Abstraction has 24573 states and 34918 transitions. [2025-02-05 16:44:16,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 24573 states and 34918 transitions. [2025-02-05 16:44:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:44:16,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:16,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:16,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:44:16,363 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:16,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1228455032, now seen corresponding path program 1 times [2025-02-05 16:44:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:16,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366711625] [2025-02-05 16:44:16,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:16,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:44:16,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:44:16,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:16,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:16,821 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:44:16,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:16,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366711625] [2025-02-05 16:44:16,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366711625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:16,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:16,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:44:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829695679] [2025-02-05 16:44:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:44:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:16,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:44:16,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:44:16,822 INFO L87 Difference]: Start difference. First operand 24573 states and 34918 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:18,028 INFO L93 Difference]: Finished difference Result 74325 states and 104900 transitions. [2025-02-05 16:44:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:44:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 16:44:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:18,086 INFO L225 Difference]: With dead ends: 74325 [2025-02-05 16:44:18,086 INFO L226 Difference]: Without dead ends: 49857 [2025-02-05 16:44:18,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:44:18,111 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1393 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:18,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 1290 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49857 states. [2025-02-05 16:44:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49857 to 48107. [2025-02-05 16:44:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48107 states, 48106 states have (on average 1.4130877645200184) internal successors, (67978), 48106 states have internal predecessors, (67978), 0 states have call successors, (0), 0 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:44:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48107 states to 48107 states and 67978 transitions. [2025-02-05 16:44:18,765 INFO L78 Accepts]: Start accepts. Automaton has 48107 states and 67978 transitions. Word has length 148 [2025-02-05 16:44:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:18,765 INFO L471 AbstractCegarLoop]: Abstraction has 48107 states and 67978 transitions. [2025-02-05 16:44:18,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 13 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 48107 states and 67978 transitions. [2025-02-05 16:44:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:44:18,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:18,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:18,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:44:18,782 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:18,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1037976503, now seen corresponding path program 1 times [2025-02-05 16:44:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:18,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139551672] [2025-02-05 16:44:18,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:18,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:44:18,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:44:18,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:18,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:18,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139551672] [2025-02-05 16:44:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139551672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424826286] [2025-02-05 16:44:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:18,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:18,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:18,845 INFO L87 Difference]: Start difference. First operand 48107 states and 67978 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:19,055 INFO L93 Difference]: Finished difference Result 94653 states and 134077 transitions. [2025-02-05 16:44:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-02-05 16:44:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:19,104 INFO L225 Difference]: With dead ends: 94653 [2025-02-05 16:44:19,104 INFO L226 Difference]: Without dead ends: 47635 [2025-02-05 16:44:19,134 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:44:19,135 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 194 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:19,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 237 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47635 states. [2025-02-05 16:44:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47635 to 47635. [2025-02-05 16:44:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47635 states, 47634 states have (on average 1.4057605911743714) internal successors, (66962), 47634 states have internal predecessors, (66962), 0 states have call successors, (0), 0 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:44:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47635 states to 47635 states and 66962 transitions. [2025-02-05 16:44:19,716 INFO L78 Accepts]: Start accepts. Automaton has 47635 states and 66962 transitions. Word has length 149 [2025-02-05 16:44:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:19,716 INFO L471 AbstractCegarLoop]: Abstraction has 47635 states and 66962 transitions. [2025-02-05 16:44:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 47635 states and 66962 transitions. [2025-02-05 16:44:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:44:19,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:19,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:19,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:44:19,735 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -564727900, now seen corresponding path program 1 times [2025-02-05 16:44:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344779861] [2025-02-05 16:44:19,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:19,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:44:19,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:44:19,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:19,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:20,122 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:44:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344779861] [2025-02-05 16:44:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344779861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:20,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:20,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166546752] [2025-02-05 16:44:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:20,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:20,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:20,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:20,124 INFO L87 Difference]: Start difference. First operand 47635 states and 66962 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:21,033 INFO L93 Difference]: Finished difference Result 140907 states and 197648 transitions. [2025-02-05 16:44:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-02-05 16:44:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:21,132 INFO L225 Difference]: With dead ends: 140907 [2025-02-05 16:44:21,133 INFO L226 Difference]: Without dead ends: 93461 [2025-02-05 16:44:21,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:44:21,167 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1249 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:21,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 979 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93461 states. [2025-02-05 16:44:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93461 to 92019. [2025-02-05 16:44:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92019 states, 92018 states have (on average 1.401573605164207) internal successors, (128970), 92018 states have internal predecessors, (128970), 0 states have call successors, (0), 0 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:44:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92019 states to 92019 states and 128970 transitions. [2025-02-05 16:44:22,476 INFO L78 Accepts]: Start accepts. Automaton has 92019 states and 128970 transitions. Word has length 149 [2025-02-05 16:44:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:22,476 INFO L471 AbstractCegarLoop]: Abstraction has 92019 states and 128970 transitions. [2025-02-05 16:44:22,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 9 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 92019 states and 128970 transitions. [2025-02-05 16:44:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:44:22,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:22,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:22,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:44:22,508 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:22,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1842520201, now seen corresponding path program 1 times [2025-02-05 16:44:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:22,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598253153] [2025-02-05 16:44:22,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:44:22,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:44:22,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:22,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:22,872 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:44:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598253153] [2025-02-05 16:44:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598253153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626703591] [2025-02-05 16:44:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:22,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:22,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:22,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:22,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:22,874 INFO L87 Difference]: Start difference. First operand 92019 states and 128970 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:24,282 INFO L93 Difference]: Finished difference Result 279287 states and 390178 transitions. [2025-02-05 16:44:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-02-05 16:44:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:24,482 INFO L225 Difference]: With dead ends: 279287 [2025-02-05 16:44:24,482 INFO L226 Difference]: Without dead ends: 187349 [2025-02-05 16:44:24,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:44:24,543 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1752 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:24,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1026 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:44:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187349 states. [2025-02-05 16:44:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187349 to 182939. [2025-02-05 16:44:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182939 states, 182938 states have (on average 1.396232603395686) internal successors, (255424), 182938 states have internal predecessors, (255424), 0 states have call successors, (0), 0 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:44:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182939 states to 182939 states and 255424 transitions. [2025-02-05 16:44:26,826 INFO L78 Accepts]: Start accepts. Automaton has 182939 states and 255424 transitions. Word has length 150 [2025-02-05 16:44:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:26,826 INFO L471 AbstractCegarLoop]: Abstraction has 182939 states and 255424 transitions. [2025-02-05 16:44:26,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 182939 states and 255424 transitions. [2025-02-05 16:44:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:44:26,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:26,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:26,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:44:26,889 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:26,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1827516355, now seen corresponding path program 1 times [2025-02-05 16:44:26,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:26,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826802929] [2025-02-05 16:44:26,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:26,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:44:26,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:44:26,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:26,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:27,022 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:44:27,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:27,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826802929] [2025-02-05 16:44:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826802929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:27,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248488656] [2025-02-05 16:44:27,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:27,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:27,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:27,024 INFO L87 Difference]: Start difference. First operand 182939 states and 255424 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:28,081 INFO L93 Difference]: Finished difference Result 268383 states and 374946 transitions. [2025-02-05 16:44:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:28,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-02-05 16:44:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:28,182 INFO L225 Difference]: With dead ends: 268383 [2025-02-05 16:44:28,183 INFO L226 Difference]: Without dead ends: 94363 [2025-02-05 16:44:28,265 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:44:28,266 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 87 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:28,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 435 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94363 states. [2025-02-05 16:44:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94363 to 94361. [2025-02-05 16:44:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94361 states, 94360 states have (on average 1.3829376854599407) internal successors, (130494), 94360 states have internal predecessors, (130494), 0 states have call successors, (0), 0 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:44:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94361 states to 94361 states and 130494 transitions. [2025-02-05 16:44:29,425 INFO L78 Accepts]: Start accepts. Automaton has 94361 states and 130494 transitions. Word has length 150 [2025-02-05 16:44:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:29,426 INFO L471 AbstractCegarLoop]: Abstraction has 94361 states and 130494 transitions. [2025-02-05 16:44:29,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 94361 states and 130494 transitions. [2025-02-05 16:44:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:44:29,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:29,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:29,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:44:29,457 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:29,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1462391833, now seen corresponding path program 1 times [2025-02-05 16:44:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811625728] [2025-02-05 16:44:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:29,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:44:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:44:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:29,719 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:44:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:29,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811625728] [2025-02-05 16:44:29,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811625728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:29,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:29,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221558333] [2025-02-05 16:44:29,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:29,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:29,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:29,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:29,721 INFO L87 Difference]: Start difference. First operand 94361 states and 130494 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:30,837 INFO L93 Difference]: Finished difference Result 181731 states and 251706 transitions. [2025-02-05 16:44:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:30,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-02-05 16:44:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:30,931 INFO L225 Difference]: With dead ends: 181731 [2025-02-05 16:44:30,931 INFO L226 Difference]: Without dead ends: 94363 [2025-02-05 16:44:30,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:44:30,970 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 807 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:30,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1138 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94363 states. [2025-02-05 16:44:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94363 to 93381. [2025-02-05 16:44:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93381 states, 93380 states have (on average 1.383015635039623) internal successors, (129146), 93380 states have internal predecessors, (129146), 0 states have call successors, (0), 0 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:44:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93381 states to 93381 states and 129146 transitions. [2025-02-05 16:44:32,145 INFO L78 Accepts]: Start accepts. Automaton has 93381 states and 129146 transitions. Word has length 151 [2025-02-05 16:44:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:32,146 INFO L471 AbstractCegarLoop]: Abstraction has 93381 states and 129146 transitions. [2025-02-05 16:44:32,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 93381 states and 129146 transitions. [2025-02-05 16:44:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:44:32,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:32,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:32,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:44:32,182 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:32,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1544982235, now seen corresponding path program 1 times [2025-02-05 16:44:32,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:32,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194378643] [2025-02-05 16:44:32,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:32,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:44:32,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:44:32,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:32,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:32,532 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:44:32,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:32,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194378643] [2025-02-05 16:44:32,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194378643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:32,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:32,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461707911] [2025-02-05 16:44:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:32,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:32,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:32,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:32,535 INFO L87 Difference]: Start difference. First operand 93381 states and 129146 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:33,477 INFO L93 Difference]: Finished difference Result 227310 states and 314277 transitions. [2025-02-05 16:44:33,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:33,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-02-05 16:44:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:33,648 INFO L225 Difference]: With dead ends: 227310 [2025-02-05 16:44:33,648 INFO L226 Difference]: Without dead ends: 136399 [2025-02-05 16:44:33,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:44:33,726 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1241 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:33,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 937 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136399 states. [2025-02-05 16:44:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136399 to 92477. [2025-02-05 16:44:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92477 states, 92476 states have (on average 1.3828669060080454) internal successors, (127882), 92476 states have internal predecessors, (127882), 0 states have call successors, (0), 0 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:44:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92477 states to 92477 states and 127882 transitions. [2025-02-05 16:44:35,370 INFO L78 Accepts]: Start accepts. Automaton has 92477 states and 127882 transitions. Word has length 151 [2025-02-05 16:44:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:35,370 INFO L471 AbstractCegarLoop]: Abstraction has 92477 states and 127882 transitions. [2025-02-05 16:44:35,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 92477 states and 127882 transitions. [2025-02-05 16:44:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 16:44:35,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:35,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:44:35,398 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:35,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1245963849, now seen corresponding path program 1 times [2025-02-05 16:44:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:35,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114103522] [2025-02-05 16:44:35,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:35,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 16:44:35,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 16:44:35,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:35,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44: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:44:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114103522] [2025-02-05 16:44:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114103522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77219007] [2025-02-05 16:44:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:35,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:35,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:35,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:35,450 INFO L87 Difference]: Start difference. First operand 92477 states and 127882 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:35,853 INFO L93 Difference]: Finished difference Result 183558 states and 254265 transitions. [2025-02-05 16:44:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-02-05 16:44:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:35,952 INFO L225 Difference]: With dead ends: 183558 [2025-02-05 16:44:35,953 INFO L226 Difference]: Without dead ends: 91562 [2025-02-05 16:44:36,019 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:44:36,019 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 148 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:36,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 289 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91562 states. [2025-02-05 16:44:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91562 to 91562. [2025-02-05 16:44:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91562 states, 91561 states have (on average 1.3807516300608338) internal successors, (126423), 91561 states have internal predecessors, (126423), 0 states have call successors, (0), 0 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:44:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91562 states to 91562 states and 126423 transitions. [2025-02-05 16:44:37,145 INFO L78 Accepts]: Start accepts. Automaton has 91562 states and 126423 transitions. Word has length 152 [2025-02-05 16:44:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:37,145 INFO L471 AbstractCegarLoop]: Abstraction has 91562 states and 126423 transitions. [2025-02-05 16:44:37,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 91562 states and 126423 transitions. [2025-02-05 16:44:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 16:44:37,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:37,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:37,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:44:37,180 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:37,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1090580439, now seen corresponding path program 1 times [2025-02-05 16:44:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:37,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777891926] [2025-02-05 16:44:37,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:37,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 16:44:37,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 16:44:37,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:37,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:37,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777891926] [2025-02-05 16:44:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777891926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:37,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:37,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:37,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041457108] [2025-02-05 16:44:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:37,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:44:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:37,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:44:37,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:44:37,529 INFO L87 Difference]: Start difference. First operand 91562 states and 126423 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)