./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37da121d1485cf4d7db5098d27ad9010a5336c778943ff6fd7c53fe4a9fdfbdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:37:01,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:37:01,423 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:37:01,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:37:01,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:37:01,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:37:01,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:37:01,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:37:01,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:37:01,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:37:01,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:37:01,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:37:01,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:37:01,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:37:01,449 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:37:01,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:37:01,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:37:01,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:37:01,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:37:01,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:37:01,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:37:01,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:37:01,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:37:01,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:37:01,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:37:01,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:37:01,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:37:01,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:37:01,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:37:01,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:37:01,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:37:01,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:37:01,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:37:01,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:37:01,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:37:01,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:37:01,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:37:01,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:37:01,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:37:01,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:37:01,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:37:01,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:37:01,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:37:01,453 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 -> 37da121d1485cf4d7db5098d27ad9010a5336c778943ff6fd7c53fe4a9fdfbdc [2025-02-05 16:37:01,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:37:01,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:37:01,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:37:01,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:37:01,811 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:37:01,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:37:03,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f142ec7/be06df51e131441c895af5921573cd86/FLAGa24f4ae34 [2025-02-05 16:37:04,302 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:37:04,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:37:04,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f142ec7/be06df51e131441c895af5921573cd86/FLAGa24f4ae34 [2025-02-05 16:37:04,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f142ec7/be06df51e131441c895af5921573cd86 [2025-02-05 16:37:04,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:37:04,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:37:04,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:37:04,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:37:04,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:37:04,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:04,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b0be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04, skipping insertion in model container [2025-02-05 16:37:04,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:04,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:37:04,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8458,8471] [2025-02-05 16:37:04,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:37:04,739 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:37:04,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8458,8471] [2025-02-05 16:37:04,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:37:04,892 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:37:04,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04 WrapperNode [2025-02-05 16:37:04,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:37:04,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:37:04,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:37:04,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:37:04,901 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:37:04" (1/1) ... [2025-02-05 16:37:04,917 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:37:04" (1/1) ... [2025-02-05 16:37:04,969 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 864 [2025-02-05 16:37:04,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:37:04,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:37:04,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:37:04,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:37:04,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:04,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:04,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,017 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:37:05,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:37:05,059 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:37:05,059 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:37:05,059 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:37:05,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (1/1) ... [2025-02-05 16:37:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:37:05,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:37:05,101 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:37:05,105 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:37:05,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:37:05,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:37:05,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:37:05,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:37:05,272 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:37:05,274 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:37:06,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L961: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:06,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:06,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1228: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:37:06,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:37:06,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:06,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:37:06,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:06,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:06,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: havoc main_~node2__m2~2#1; [2025-02-05 16:37:06,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:06,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:37:06,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1140: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-02-05 16:37:06,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4__m4~2#1; [2025-02-05 16:37:06,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L647: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:37:06,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:37:06,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:37:06,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L852: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:06,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:06,139 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1316: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:37:06,139 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:37:06,139 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1184: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:37:06,139 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L824: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:37:06,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:37:06,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: havoc main_~node3__m3~2#1; [2025-02-05 16:37:06,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:37:06,184 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-02-05 16:37:06,184 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:37:06,201 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:37:06,203 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:37:06,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:37:06 BoogieIcfgContainer [2025-02-05 16:37:06,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:37:06,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:37:06,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:37:06,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:37:06,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:37:04" (1/3) ... [2025-02-05 16:37:06,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65000ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:37:06, skipping insertion in model container [2025-02-05 16:37:06,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:37:04" (2/3) ... [2025-02-05 16:37:06,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65000ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:37:06, skipping insertion in model container [2025-02-05 16:37:06,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:37:06" (3/3) ... [2025-02-05 16:37:06,212 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:37:06,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:37:06,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 215 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:37:06,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:37:06,304 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;@45db9f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:37:06,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:37:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 213 states have (on average 1.7183098591549295) internal successors, (366), 214 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:37:06,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:06,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:06,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:06,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1688088482, now seen corresponding path program 1 times [2025-02-05 16:37:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:06,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110993045] [2025-02-05 16:37:06,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:06,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:37:06,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:37:06,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:06,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110993045] [2025-02-05 16:37:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110993045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:07,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:07,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546672079] [2025-02-05 16:37:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:07,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:07,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:07,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:07,075 INFO L87 Difference]: Start difference. First operand has 215 states, 213 states have (on average 1.7183098591549295) internal successors, (366), 214 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:07,423 INFO L93 Difference]: Finished difference Result 867 states and 1402 transitions. [2025-02-05 16:37:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:37:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:07,444 INFO L225 Difference]: With dead ends: 867 [2025-02-05 16:37:07,446 INFO L226 Difference]: Without dead ends: 747 [2025-02-05 16:37:07,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:07,455 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 2243 mSDsluCounter, 2659 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:07,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 3030 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:37:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-02-05 16:37:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 328. [2025-02-05 16:37:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.507645259938838) internal successors, (493), 327 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 493 transitions. [2025-02-05 16:37:07,534 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 493 transitions. Word has length 80 [2025-02-05 16:37:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:07,535 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 493 transitions. [2025-02-05 16:37:07,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 493 transitions. [2025-02-05 16:37:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:37:07,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:07,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:07,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:37:07,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:07,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:07,539 INFO L85 PathProgramCache]: Analyzing trace with hash 792096179, now seen corresponding path program 1 times [2025-02-05 16:37:07,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543717489] [2025-02-05 16:37:07,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:07,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:37:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:37:07,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:07,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:08,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543717489] [2025-02-05 16:37:08,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543717489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:08,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:08,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995945072] [2025-02-05 16:37:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:08,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:08,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:08,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:08,034 INFO L87 Difference]: Start difference. First operand 328 states and 493 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:08,313 INFO L93 Difference]: Finished difference Result 1424 states and 2210 transitions. [2025-02-05 16:37:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:37:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:08,321 INFO L225 Difference]: With dead ends: 1424 [2025-02-05 16:37:08,322 INFO L226 Difference]: Without dead ends: 1176 [2025-02-05 16:37:08,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:08,327 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 3010 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:08,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3010 Valid, 1027 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:37:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-02-05 16:37:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1168. [2025-02-05 16:37:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 1.5475578406169666) internal successors, (1806), 1167 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1806 transitions. [2025-02-05 16:37:08,395 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1806 transitions. Word has length 81 [2025-02-05 16:37:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:08,396 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1806 transitions. [2025-02-05 16:37:08,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1806 transitions. [2025-02-05 16:37:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:37:08,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:08,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:08,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:37:08,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:08,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1960386427, now seen corresponding path program 1 times [2025-02-05 16:37:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:08,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513075775] [2025-02-05 16:37:08,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:08,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:37:08,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:37:08,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:08,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513075775] [2025-02-05 16:37:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513075775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:08,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:08,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:37:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167631705] [2025-02-05 16:37:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:08,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:37:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:08,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:37:08,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:08,607 INFO L87 Difference]: Start difference. First operand 1168 states and 1806 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:08,928 INFO L93 Difference]: Finished difference Result 2993 states and 4697 transitions. [2025-02-05 16:37:08,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:08,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:37:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:08,939 INFO L225 Difference]: With dead ends: 2993 [2025-02-05 16:37:08,940 INFO L226 Difference]: Without dead ends: 1970 [2025-02-05 16:37:08,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:08,945 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1128 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:08,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 309 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:37:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-02-05 16:37:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1968. [2025-02-05 16:37:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.5592272496187087) internal successors, (3067), 1967 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 3067 transitions. [2025-02-05 16:37:09,030 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 3067 transitions. Word has length 82 [2025-02-05 16:37:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:09,032 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 3067 transitions. [2025-02-05 16:37:09,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 3067 transitions. [2025-02-05 16:37:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:37:09,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:09,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:09,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:37:09,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:09,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash 108358695, now seen corresponding path program 1 times [2025-02-05 16:37:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:09,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843539171] [2025-02-05 16:37:09,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:09,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:09,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:37:09,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:37:09,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:09,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843539171] [2025-02-05 16:37:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843539171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:37:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64438746] [2025-02-05 16:37:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:09,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:37:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:09,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:37:09,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:09,262 INFO L87 Difference]: Start difference. First operand 1968 states and 3067 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:09,565 INFO L93 Difference]: Finished difference Result 5435 states and 8540 transitions. [2025-02-05 16:37:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:37:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:09,581 INFO L225 Difference]: With dead ends: 5435 [2025-02-05 16:37:09,581 INFO L226 Difference]: Without dead ends: 3578 [2025-02-05 16:37:09,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:09,591 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1130 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:09,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 300 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:37:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-02-05 16:37:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-02-05 16:37:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3575 states have (on average 1.563076923076923) internal successors, (5588), 3575 states have internal predecessors, (5588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5588 transitions. [2025-02-05 16:37:09,718 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5588 transitions. Word has length 82 [2025-02-05 16:37:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:09,718 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5588 transitions. [2025-02-05 16:37:09,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5588 transitions. [2025-02-05 16:37:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:37:09,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:09,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:09,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:37:09,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:09,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1568439597, now seen corresponding path program 1 times [2025-02-05 16:37:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:09,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394565050] [2025-02-05 16:37:09,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:09,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:37:09,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:37:09,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394565050] [2025-02-05 16:37:09,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394565050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:09,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:09,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:37:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789938798] [2025-02-05 16:37:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:37:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:09,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:37:09,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:09,879 INFO L87 Difference]: Start difference. First operand 3576 states and 5588 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:10,178 INFO L93 Difference]: Finished difference Result 10327 states and 16213 transitions. [2025-02-05 16:37:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:10,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:37:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:10,207 INFO L225 Difference]: With dead ends: 10327 [2025-02-05 16:37:10,207 INFO L226 Difference]: Without dead ends: 6832 [2025-02-05 16:37:10,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:10,218 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1156 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:10,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 298 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:37:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2025-02-05 16:37:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6830. [2025-02-05 16:37:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6830 states, 6829 states have (on average 1.5618685019768634) internal successors, (10666), 6829 states have internal predecessors, (10666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 10666 transitions. [2025-02-05 16:37:10,380 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 10666 transitions. Word has length 82 [2025-02-05 16:37:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:10,381 INFO L471 AbstractCegarLoop]: Abstraction has 6830 states and 10666 transitions. [2025-02-05 16:37:10,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 10666 transitions. [2025-02-05 16:37:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:37:10,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:10,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:10,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:37:10,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -955358337, now seen corresponding path program 1 times [2025-02-05 16:37:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531935956] [2025-02-05 16:37:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:10,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:37:10,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:37:10,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:10,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:10,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531935956] [2025-02-05 16:37:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531935956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:10,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:10,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:37:10,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091306051] [2025-02-05 16:37:10,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:10,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:37:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:10,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:37:10,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:10,538 INFO L87 Difference]: Start difference. First operand 6830 states and 10666 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:10,878 INFO L93 Difference]: Finished difference Result 20144 states and 31540 transitions. [2025-02-05 16:37:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:10,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:37:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:10,933 INFO L225 Difference]: With dead ends: 20144 [2025-02-05 16:37:10,933 INFO L226 Difference]: Without dead ends: 13372 [2025-02-05 16:37:10,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:10,947 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1182 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:10,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 296 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:37:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13372 states. [2025-02-05 16:37:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13372 to 13370. [2025-02-05 16:37:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13370 states, 13369 states have (on average 1.5566609320068816) internal successors, (20811), 13369 states have internal predecessors, (20811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13370 states to 13370 states and 20811 transitions. [2025-02-05 16:37:11,298 INFO L78 Accepts]: Start accepts. Automaton has 13370 states and 20811 transitions. Word has length 82 [2025-02-05 16:37:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:11,298 INFO L471 AbstractCegarLoop]: Abstraction has 13370 states and 20811 transitions. [2025-02-05 16:37:11,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13370 states and 20811 transitions. [2025-02-05 16:37:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:37:11,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:11,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:11,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:37:11,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:11,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash -190771669, now seen corresponding path program 1 times [2025-02-05 16:37:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009743155] [2025-02-05 16:37:11,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:11,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:37:11,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:37:11,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:11,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009743155] [2025-02-05 16:37:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009743155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:11,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:11,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:37:11,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641763001] [2025-02-05 16:37:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:37:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:11,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:37:11,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:11,426 INFO L87 Difference]: Start difference. First operand 13370 states and 20811 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:11,778 INFO L93 Difference]: Finished difference Result 37565 states and 58554 transitions. [2025-02-05 16:37:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:11,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:37:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:11,851 INFO L225 Difference]: With dead ends: 37565 [2025-02-05 16:37:11,851 INFO L226 Difference]: Without dead ends: 24237 [2025-02-05 16:37:11,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:11,879 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1208 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:11,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 294 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:37:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24237 states. [2025-02-05 16:37:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24237 to 24235. [2025-02-05 16:37:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24235 states, 24234 states have (on average 1.547330197243542) internal successors, (37498), 24234 states have internal predecessors, (37498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24235 states to 24235 states and 37498 transitions. [2025-02-05 16:37:12,404 INFO L78 Accepts]: Start accepts. Automaton has 24235 states and 37498 transitions. Word has length 82 [2025-02-05 16:37:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:12,405 INFO L471 AbstractCegarLoop]: Abstraction has 24235 states and 37498 transitions. [2025-02-05 16:37:12,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24235 states and 37498 transitions. [2025-02-05 16:37:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:37:12,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:12,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:37:12,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2114170507, now seen corresponding path program 1 times [2025-02-05 16:37:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052176494] [2025-02-05 16:37:12,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:12,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:37:12,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:37:12,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:12,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052176494] [2025-02-05 16:37:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052176494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:12,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:37:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105376386] [2025-02-05 16:37:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:12,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:37:12,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:12,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:37:12,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:12,805 INFO L87 Difference]: Start difference. First operand 24235 states and 37498 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:12,888 INFO L93 Difference]: Finished difference Result 24813 states and 38363 transitions. [2025-02-05 16:37:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:12,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-05 16:37:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:12,937 INFO L225 Difference]: With dead ends: 24813 [2025-02-05 16:37:12,938 INFO L226 Difference]: Without dead ends: 24811 [2025-02-05 16:37:12,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:12,950 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:12,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1166 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24811 states. [2025-02-05 16:37:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24811 to 24811. [2025-02-05 16:37:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.5346231358323257) internal successors, (38074), 24810 states have internal predecessors, (38074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 38074 transitions. [2025-02-05 16:37:13,436 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 38074 transitions. Word has length 83 [2025-02-05 16:37:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:13,437 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 38074 transitions. [2025-02-05 16:37:13,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 38074 transitions. [2025-02-05 16:37:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:37:13,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:13,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:13,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:37:13,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1110002240, now seen corresponding path program 1 times [2025-02-05 16:37:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441754396] [2025-02-05 16:37:13,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:13,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:37:13,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:37:13,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:13,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:13,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441754396] [2025-02-05 16:37:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441754396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:37:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661383562] [2025-02-05 16:37:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:37:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:13,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:37:13,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:37:13,867 INFO L87 Difference]: Start difference. First operand 24811 states and 38074 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:14,589 INFO L93 Difference]: Finished difference Result 31376 states and 47817 transitions. [2025-02-05 16:37:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:37:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:37:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:14,660 INFO L225 Difference]: With dead ends: 31376 [2025-02-05 16:37:14,660 INFO L226 Difference]: Without dead ends: 28285 [2025-02-05 16:37:14,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:37:14,682 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 757 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:14,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 932 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:37:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28285 states. [2025-02-05 16:37:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28285 to 24811. [2025-02-05 16:37:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.534582829504232) internal successors, (38073), 24810 states have internal predecessors, (38073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 38073 transitions. [2025-02-05 16:37:15,187 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 38073 transitions. Word has length 84 [2025-02-05 16:37:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:15,187 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 38073 transitions. [2025-02-05 16:37:15,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 38073 transitions. [2025-02-05 16:37:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:37:15,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:15,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:15,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:37:15,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:15,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1037099328, now seen corresponding path program 1 times [2025-02-05 16:37:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:15,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138311912] [2025-02-05 16:37:15,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:15,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:37:15,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:37:15,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:15,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:15,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138311912] [2025-02-05 16:37:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138311912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:15,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:15,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:37:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398093426] [2025-02-05 16:37:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:37:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:37:15,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:37:15,643 INFO L87 Difference]: Start difference. First operand 24811 states and 38073 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:16,393 INFO L93 Difference]: Finished difference Result 41224 states and 62684 transitions. [2025-02-05 16:37:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:37:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:37:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:16,443 INFO L225 Difference]: With dead ends: 41224 [2025-02-05 16:37:16,444 INFO L226 Difference]: Without dead ends: 32390 [2025-02-05 16:37:16,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:37:16,463 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1444 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:16,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 962 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:37:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32390 states. [2025-02-05 16:37:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32390 to 25220. [2025-02-05 16:37:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25220 states, 25219 states have (on average 1.5336056148142274) internal successors, (38676), 25219 states have internal predecessors, (38676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25220 states to 25220 states and 38676 transitions. [2025-02-05 16:37:16,955 INFO L78 Accepts]: Start accepts. Automaton has 25220 states and 38676 transitions. Word has length 84 [2025-02-05 16:37:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:16,955 INFO L471 AbstractCegarLoop]: Abstraction has 25220 states and 38676 transitions. [2025-02-05 16:37:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25220 states and 38676 transitions. [2025-02-05 16:37:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:37:16,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:16,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:16,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:37:16,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:16,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:16,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1781969728, now seen corresponding path program 1 times [2025-02-05 16:37:16,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:16,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602693473] [2025-02-05 16:37:16,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:16,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:16,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:37:17,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:37:17,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:17,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602693473] [2025-02-05 16:37:17,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602693473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:17,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:17,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:37:17,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287887584] [2025-02-05 16:37:17,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:17,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:37:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:17,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:37:17,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:37:17,449 INFO L87 Difference]: Start difference. First operand 25220 states and 38676 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:18,387 INFO L93 Difference]: Finished difference Result 49679 states and 75646 transitions. [2025-02-05 16:37:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:37:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:37:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:18,459 INFO L225 Difference]: With dead ends: 49679 [2025-02-05 16:37:18,460 INFO L226 Difference]: Without dead ends: 35255 [2025-02-05 16:37:18,490 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:37:18,491 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1715 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:18,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 1030 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:37:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35255 states. [2025-02-05 16:37:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35255 to 25640. [2025-02-05 16:37:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25640 states, 25639 states have (on average 1.530636920316705) internal successors, (39244), 25639 states have internal predecessors, (39244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25640 states to 25640 states and 39244 transitions. [2025-02-05 16:37:19,063 INFO L78 Accepts]: Start accepts. Automaton has 25640 states and 39244 transitions. Word has length 84 [2025-02-05 16:37:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:19,063 INFO L471 AbstractCegarLoop]: Abstraction has 25640 states and 39244 transitions. [2025-02-05 16:37:19,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 25640 states and 39244 transitions. [2025-02-05 16:37:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:37:19,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:19,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:19,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:37:19,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:19,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 480245824, now seen corresponding path program 1 times [2025-02-05 16:37:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193701866] [2025-02-05 16:37:19,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:19,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:37:19,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:37:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:19,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:19,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193701866] [2025-02-05 16:37:19,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193701866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:19,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:19,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:37:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524507753] [2025-02-05 16:37:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:19,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:37:19,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:19,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:37:19,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:37:19,386 INFO L87 Difference]: Start difference. First operand 25640 states and 39244 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:20,187 INFO L93 Difference]: Finished difference Result 58220 states and 88531 transitions. [2025-02-05 16:37:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:37:20,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:37:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:20,244 INFO L225 Difference]: With dead ends: 58220 [2025-02-05 16:37:20,245 INFO L226 Difference]: Without dead ends: 38501 [2025-02-05 16:37:20,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:37:20,278 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1467 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:20,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1032 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:37:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38501 states. [2025-02-05 16:37:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38501 to 26057. [2025-02-05 16:37:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26057 states, 26056 states have (on average 1.5268268345102856) internal successors, (39783), 26056 states have internal predecessors, (39783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26057 states to 26057 states and 39783 transitions. [2025-02-05 16:37:20,933 INFO L78 Accepts]: Start accepts. Automaton has 26057 states and 39783 transitions. Word has length 84 [2025-02-05 16:37:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:20,933 INFO L471 AbstractCegarLoop]: Abstraction has 26057 states and 39783 transitions. [2025-02-05 16:37:20,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 26057 states and 39783 transitions. [2025-02-05 16:37:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 16:37:20,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:20,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:20,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:37:20,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1187716160, now seen corresponding path program 1 times [2025-02-05 16:37:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972565275] [2025-02-05 16:37:20,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:20,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 16:37:20,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 16:37:20,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:20,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:21,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972565275] [2025-02-05 16:37:21,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972565275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:21,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:21,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:37:21,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312453789] [2025-02-05 16:37:21,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:21,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:37:21,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:21,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:37:21,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:37:21,243 INFO L87 Difference]: Start difference. First operand 26057 states and 39783 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:22,136 INFO L93 Difference]: Finished difference Result 66039 states and 100245 transitions. [2025-02-05 16:37:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:37:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 16:37:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:22,198 INFO L225 Difference]: With dead ends: 66039 [2025-02-05 16:37:22,198 INFO L226 Difference]: Without dead ends: 41405 [2025-02-05 16:37:22,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:37:22,229 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1431 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:22,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 1135 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:37:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41405 states. [2025-02-05 16:37:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41405 to 26432. [2025-02-05 16:37:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26432 states, 26431 states have (on average 1.521584503045666) internal successors, (40217), 26431 states have internal predecessors, (40217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26432 states to 26432 states and 40217 transitions. [2025-02-05 16:37:22,876 INFO L78 Accepts]: Start accepts. Automaton has 26432 states and 40217 transitions. Word has length 84 [2025-02-05 16:37:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:22,876 INFO L471 AbstractCegarLoop]: Abstraction has 26432 states and 40217 transitions. [2025-02-05 16:37:22,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 26432 states and 40217 transitions. [2025-02-05 16:37:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:37:22,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:22,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:22,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:37:22,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:22,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash 558271611, now seen corresponding path program 1 times [2025-02-05 16:37:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892632882] [2025-02-05 16:37:22,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:22,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:37:22,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:37:22,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:22,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:23,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892632882] [2025-02-05 16:37:23,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892632882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:23,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:37:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286202286] [2025-02-05 16:37:23,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:23,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:37:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:23,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:37:23,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:37:23,057 INFO L87 Difference]: Start difference. First operand 26432 states and 40217 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:23,298 INFO L93 Difference]: Finished difference Result 71316 states and 108851 transitions. [2025-02-05 16:37:23,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:37:23,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:23,375 INFO L225 Difference]: With dead ends: 71316 [2025-02-05 16:37:23,375 INFO L226 Difference]: Without dead ends: 47314 [2025-02-05 16:37:23,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:37:23,414 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 203 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:23,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 732 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47314 states. [2025-02-05 16:37:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47314 to 47040. [2025-02-05 16:37:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47040 states, 47039 states have (on average 1.5122983056612598) internal successors, (71137), 47039 states have internal predecessors, (71137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47040 states to 47040 states and 71137 transitions. [2025-02-05 16:37:24,239 INFO L78 Accepts]: Start accepts. Automaton has 47040 states and 71137 transitions. Word has length 85 [2025-02-05 16:37:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:24,240 INFO L471 AbstractCegarLoop]: Abstraction has 47040 states and 71137 transitions. [2025-02-05 16:37:24,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 47040 states and 71137 transitions. [2025-02-05 16:37:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:37:24,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:24,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:24,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:37:24,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:24,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2026774941, now seen corresponding path program 1 times [2025-02-05 16:37:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861054818] [2025-02-05 16:37:24,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:24,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:37:24,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:37:24,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:24,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:24,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861054818] [2025-02-05 16:37:24,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861054818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:24,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:24,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:24,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260493677] [2025-02-05 16:37:24,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:24,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:24,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:24,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:24,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:24,319 INFO L87 Difference]: Start difference. First operand 47040 states and 71137 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:24,792 INFO L93 Difference]: Finished difference Result 105528 states and 160001 transitions. [2025-02-05 16:37:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:24,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:24,914 INFO L225 Difference]: With dead ends: 105528 [2025-02-05 16:37:24,914 INFO L226 Difference]: Without dead ends: 64234 [2025-02-05 16:37:24,957 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:37:24,958 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 213 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:24,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 564 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64234 states. [2025-02-05 16:37:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64234 to 64104. [2025-02-05 16:37:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64104 states, 64103 states have (on average 1.5025817824438794) internal successors, (96320), 64103 states have internal predecessors, (96320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64104 states to 64104 states and 96320 transitions. [2025-02-05 16:37:26,110 INFO L78 Accepts]: Start accepts. Automaton has 64104 states and 96320 transitions. Word has length 85 [2025-02-05 16:37:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:26,110 INFO L471 AbstractCegarLoop]: Abstraction has 64104 states and 96320 transitions. [2025-02-05 16:37:26,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 64104 states and 96320 transitions. [2025-02-05 16:37:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:37:26,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:26,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:26,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:37:26,116 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:26,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash -577979594, now seen corresponding path program 1 times [2025-02-05 16:37:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581116049] [2025-02-05 16:37:26,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:26,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:26,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:37:26,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:37:26,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:26,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581116049] [2025-02-05 16:37:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581116049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:26,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837833203] [2025-02-05 16:37:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:26,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:26,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:26,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:26,180 INFO L87 Difference]: Start difference. First operand 64104 states and 96320 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:26,436 INFO L93 Difference]: Finished difference Result 87263 states and 130964 transitions. [2025-02-05 16:37:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:26,594 INFO L225 Difference]: With dead ends: 87263 [2025-02-05 16:37:26,594 INFO L226 Difference]: Without dead ends: 70501 [2025-02-05 16:37:26,637 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:37:26,637 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 174 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:26,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 676 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70501 states. [2025-02-05 16:37:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70501 to 62907. [2025-02-05 16:37:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62907 states, 62906 states have (on average 1.4826884557911806) internal successors, (93270), 62906 states have internal predecessors, (93270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62907 states to 62907 states and 93270 transitions. [2025-02-05 16:37:27,683 INFO L78 Accepts]: Start accepts. Automaton has 62907 states and 93270 transitions. Word has length 85 [2025-02-05 16:37:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:27,683 INFO L471 AbstractCegarLoop]: Abstraction has 62907 states and 93270 transitions. [2025-02-05 16:37:27,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 62907 states and 93270 transitions. [2025-02-05 16:37:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:37:27,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:27,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:27,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:37:27,689 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:27,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1467748196, now seen corresponding path program 1 times [2025-02-05 16:37:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421223235] [2025-02-05 16:37:27,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:27,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:27,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:37:27,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:37:27,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:27,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:27,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421223235] [2025-02-05 16:37:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421223235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500230661] [2025-02-05 16:37:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:27,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:27,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:27,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:27,753 INFO L87 Difference]: Start difference. First operand 62907 states and 93270 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:28,076 INFO L93 Difference]: Finished difference Result 102250 states and 151819 transitions. [2025-02-05 16:37:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:28,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:28,435 INFO L225 Difference]: With dead ends: 102250 [2025-02-05 16:37:28,436 INFO L226 Difference]: Without dead ends: 71670 [2025-02-05 16:37:28,478 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:37:28,479 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 180 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:28,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 608 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71670 states. [2025-02-05 16:37:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71670 to 70972. [2025-02-05 16:37:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70972 states, 70971 states have (on average 1.4622592326443196) internal successors, (103778), 70971 states have internal predecessors, (103778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70972 states to 70972 states and 103778 transitions. [2025-02-05 16:37:29,673 INFO L78 Accepts]: Start accepts. Automaton has 70972 states and 103778 transitions. Word has length 85 [2025-02-05 16:37:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:29,674 INFO L471 AbstractCegarLoop]: Abstraction has 70972 states and 103778 transitions. [2025-02-05 16:37:29,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 70972 states and 103778 transitions. [2025-02-05 16:37:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:37:29,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:29,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:29,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:37:29,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:29,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -212475011, now seen corresponding path program 1 times [2025-02-05 16:37:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:29,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818570943] [2025-02-05 16:37:29,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:29,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:37:29,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:37:29,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:29,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:29,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818570943] [2025-02-05 16:37:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818570943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280595140] [2025-02-05 16:37:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:29,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:29,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:29,734 INFO L87 Difference]: Start difference. First operand 70972 states and 103778 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:30,138 INFO L93 Difference]: Finished difference Result 138386 states and 202347 transitions. [2025-02-05 16:37:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:30,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:30,317 INFO L225 Difference]: With dead ends: 138386 [2025-02-05 16:37:30,317 INFO L226 Difference]: Without dead ends: 85332 [2025-02-05 16:37:30,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:30,389 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 190 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:30,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 561 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85332 states. [2025-02-05 16:37:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85332 to 84562. [2025-02-05 16:37:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84562 states, 84561 states have (on average 1.4373647426118423) internal successors, (121545), 84561 states have internal predecessors, (121545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84562 states to 84562 states and 121545 transitions. [2025-02-05 16:37:31,728 INFO L78 Accepts]: Start accepts. Automaton has 84562 states and 121545 transitions. Word has length 85 [2025-02-05 16:37:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:31,728 INFO L471 AbstractCegarLoop]: Abstraction has 84562 states and 121545 transitions. [2025-02-05 16:37:31,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 84562 states and 121545 transitions. [2025-02-05 16:37:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 16:37:31,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:31,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] [2025-02-05 16:37:31,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:37:31,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:31,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:31,736 INFO L85 PathProgramCache]: Analyzing trace with hash 851481084, now seen corresponding path program 1 times [2025-02-05 16:37:31,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:31,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395363476] [2025-02-05 16:37:31,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:31,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 16:37:31,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 16:37:31,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:31,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:31,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:31,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395363476] [2025-02-05 16:37:31,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395363476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:31,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:31,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:37:31,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620346539] [2025-02-05 16:37:31,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:31,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:37:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:31,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:37:31,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:37:31,795 INFO L87 Difference]: Start difference. First operand 84562 states and 121545 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:32,272 INFO L93 Difference]: Finished difference Result 182796 states and 262011 transitions. [2025-02-05 16:37:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:37:32,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-05 16:37:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:32,857 INFO L225 Difference]: With dead ends: 182796 [2025-02-05 16:37:32,858 INFO L226 Difference]: Without dead ends: 104146 [2025-02-05 16:37:32,898 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:37:32,898 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 200 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:32,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 558 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:37:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104146 states. [2025-02-05 16:37:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104146 to 103428. [2025-02-05 16:37:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103428 states, 103427 states have (on average 1.4073694489833408) internal successors, (145560), 103427 states have internal predecessors, (145560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103428 states to 103428 states and 145560 transitions. [2025-02-05 16:37:34,365 INFO L78 Accepts]: Start accepts. Automaton has 103428 states and 145560 transitions. Word has length 85 [2025-02-05 16:37:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:34,365 INFO L471 AbstractCegarLoop]: Abstraction has 103428 states and 145560 transitions. [2025-02-05 16:37:34,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 103428 states and 145560 transitions. [2025-02-05 16:37:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:37:34,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:34,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:37:34,372 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:34,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1758230363, now seen corresponding path program 1 times [2025-02-05 16:37:34,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906545232] [2025-02-05 16:37:34,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:34,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:37:34,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:37:34,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:34,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906545232] [2025-02-05 16:37:34,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906545232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:34,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:34,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578818888] [2025-02-05 16:37:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:34,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:34,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:34,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:34,495 INFO L87 Difference]: Start difference. First operand 103428 states and 145560 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:35,457 INFO L93 Difference]: Finished difference Result 225836 states and 320212 transitions. [2025-02-05 16:37:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:37:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:35,828 INFO L225 Difference]: With dead ends: 225836 [2025-02-05 16:37:35,828 INFO L226 Difference]: Without dead ends: 214926 [2025-02-05 16:37:35,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:35,893 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 2007 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:35,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 1564 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214926 states. [2025-02-05 16:37:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214926 to 114174. [2025-02-05 16:37:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114174 states, 114173 states have (on average 1.4078109535529415) internal successors, (160734), 114173 states have internal predecessors, (160734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114174 states to 114174 states and 160734 transitions. [2025-02-05 16:37:38,511 INFO L78 Accepts]: Start accepts. Automaton has 114174 states and 160734 transitions. Word has length 86 [2025-02-05 16:37:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:38,511 INFO L471 AbstractCegarLoop]: Abstraction has 114174 states and 160734 transitions. [2025-02-05 16:37:38,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 114174 states and 160734 transitions. [2025-02-05 16:37:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:37:38,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:38,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:38,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:37:38,519 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:38,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:38,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1839342556, now seen corresponding path program 1 times [2025-02-05 16:37:38,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:38,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346697270] [2025-02-05 16:37:38,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:38,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:37:38,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:37:38,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:38,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:38,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346697270] [2025-02-05 16:37:38,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346697270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:38,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:38,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599489807] [2025-02-05 16:37:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:38,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:38,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:38,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:38,995 INFO L87 Difference]: Start difference. First operand 114174 states and 160734 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:39,685 INFO L93 Difference]: Finished difference Result 249830 states and 354250 transitions. [2025-02-05 16:37:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:37:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:40,048 INFO L225 Difference]: With dead ends: 249830 [2025-02-05 16:37:40,048 INFO L226 Difference]: Without dead ends: 225456 [2025-02-05 16:37:40,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:40,140 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 1793 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:40,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 1703 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225456 states. [2025-02-05 16:37:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225456 to 138256. [2025-02-05 16:37:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138256 states, 138255 states have (on average 1.4080214097139343) internal successors, (194666), 138255 states have internal predecessors, (194666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138256 states to 138256 states and 194666 transitions. [2025-02-05 16:37:42,964 INFO L78 Accepts]: Start accepts. Automaton has 138256 states and 194666 transitions. Word has length 86 [2025-02-05 16:37:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:42,964 INFO L471 AbstractCegarLoop]: Abstraction has 138256 states and 194666 transitions. [2025-02-05 16:37:42,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 138256 states and 194666 transitions. [2025-02-05 16:37:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:37:42,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:42,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:42,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:37:42,971 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:42,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash -78308927, now seen corresponding path program 1 times [2025-02-05 16:37:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770055744] [2025-02-05 16:37:42,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:42,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:37:42,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:37:42,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:42,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770055744] [2025-02-05 16:37:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770055744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718774856] [2025-02-05 16:37:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:43,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:43,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:43,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:43,123 INFO L87 Difference]: Start difference. First operand 138256 states and 194666 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:44,126 INFO L93 Difference]: Finished difference Result 286692 states and 406425 transitions. [2025-02-05 16:37:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:44,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:37:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:44,572 INFO L225 Difference]: With dead ends: 286692 [2025-02-05 16:37:44,573 INFO L226 Difference]: Without dead ends: 249286 [2025-02-05 16:37:44,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:44,683 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 1778 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:44,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 1741 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249286 states. [2025-02-05 16:37:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249286 to 166447. [2025-02-05 16:37:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166447 states, 166446 states have (on average 1.4096944354325127) internal successors, (234638), 166446 states have internal predecessors, (234638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166447 states to 166447 states and 234638 transitions. [2025-02-05 16:37:47,815 INFO L78 Accepts]: Start accepts. Automaton has 166447 states and 234638 transitions. Word has length 86 [2025-02-05 16:37:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:47,815 INFO L471 AbstractCegarLoop]: Abstraction has 166447 states and 234638 transitions. [2025-02-05 16:37:47,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 166447 states and 234638 transitions. [2025-02-05 16:37:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:37:47,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:47,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:47,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:37:47,821 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:47,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash -601420385, now seen corresponding path program 1 times [2025-02-05 16:37:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:47,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476406664] [2025-02-05 16:37:47,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:47,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:37:47,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:37:47,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:47,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476406664] [2025-02-05 16:37:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476406664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:47,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687792636] [2025-02-05 16:37:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:47,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:47,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:47,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:47,940 INFO L87 Difference]: Start difference. First operand 166447 states and 234638 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:49,617 INFO L93 Difference]: Finished difference Result 332077 states and 470446 transitions. [2025-02-05 16:37:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:49,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:37:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:50,125 INFO L225 Difference]: With dead ends: 332077 [2025-02-05 16:37:50,125 INFO L226 Difference]: Without dead ends: 286055 [2025-02-05 16:37:50,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:50,190 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1918 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:50,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 1826 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286055 states. [2025-02-05 16:37:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286055 to 191710. [2025-02-05 16:37:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191710 states, 191709 states have (on average 1.4109040264150352) internal successors, (270483), 191709 states have internal predecessors, (270483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191710 states to 191710 states and 270483 transitions. [2025-02-05 16:37:53,483 INFO L78 Accepts]: Start accepts. Automaton has 191710 states and 270483 transitions. Word has length 86 [2025-02-05 16:37:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:37:53,484 INFO L471 AbstractCegarLoop]: Abstraction has 191710 states and 270483 transitions. [2025-02-05 16:37:53,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 191710 states and 270483 transitions. [2025-02-05 16:37:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:37:53,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:37:53,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:37:53,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:37:53,490 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:37:53,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:37:53,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1100000257, now seen corresponding path program 1 times [2025-02-05 16:37:53,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:37:53,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637986014] [2025-02-05 16:37:53,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:37:53,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:37:53,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:37:53,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:37:53,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:37:53,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:37:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:37:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:37:54,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637986014] [2025-02-05 16:37:54,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637986014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:37:54,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:37:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:37:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074686820] [2025-02-05 16:37:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:37:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:37:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:37:54,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:37:54,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:37:54,139 INFO L87 Difference]: Start difference. First operand 191710 states and 270483 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:37:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:37:55,186 INFO L93 Difference]: Finished difference Result 367773 states and 520647 transitions. [2025-02-05 16:37:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:37:55,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 16:37:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:37:55,800 INFO L225 Difference]: With dead ends: 367773 [2025-02-05 16:37:55,800 INFO L226 Difference]: Without dead ends: 324310 [2025-02-05 16:37:55,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:37:55,935 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1925 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:37:55,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 1626 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:37:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324310 states.