./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f299e5c87ef8b927f907740b52cd3b6a05ddc6197a3b61da31c7c3837813d6c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:29:36,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:29:36,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:29:36,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:29:36,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:29:36,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:29:36,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:29:36,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:29:36,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:29:36,734 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:29:36,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:29:36,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:29:36,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:29:36,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:29:36,735 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:29:36,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:29:36,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:29:36,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:29:36,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:29:36,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:29:36,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:29:36,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:29:36,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:29:36,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:29:36,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:36,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:29:36,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:29:36,738 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/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 -> f299e5c87ef8b927f907740b52cd3b6a05ddc6197a3b61da31c7c3837813d6c6 [2025-03-16 19:29:36,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:29:36,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:29:36,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:29:36,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:29:36,980 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:29:36,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:29:38,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b52b5b6e/b50c5e333dac4ac19ddd78dbd1b97141/FLAGb99904403 [2025-03-16 19:29:38,416 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:29:38,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:29:38,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b52b5b6e/b50c5e333dac4ac19ddd78dbd1b97141/FLAGb99904403 [2025-03-16 19:29:38,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b52b5b6e/b50c5e333dac4ac19ddd78dbd1b97141 [2025-03-16 19:29:38,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:29:38,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:29:38,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:38,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:29:38,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:29:38,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38784a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38, skipping insertion in model container [2025-03-16 19:29:38,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:29:38,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2025-03-16 19:29:38,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:38,777 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:29:38,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2025-03-16 19:29:38,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:29:38,892 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:29:38,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38 WrapperNode [2025-03-16 19:29:38,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:29:38,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:38,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:29:38,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:29:38,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,941 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1006 [2025-03-16 19:29:38,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:29:38,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:29:38,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:29:38,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:29:38,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,969 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-03-16 19:29:38,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,979 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:38,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:29:38,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:29:38,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:29:38,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:29:39,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (1/1) ... [2025-03-16 19:29:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:29:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:29:39,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:29:39,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:29:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:29:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:29:39,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:29:39,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:29:39,149 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:29:39,151 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:29:39,823 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node3__m3~2#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1499: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1367: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc main_~node5__m5~2#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L913: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node6____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_~node2__m2~2#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:39,824 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4__m4~2#1; [2025-03-16 19:29:39,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:39,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:29:39,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L827: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:29:39,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:39,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:29:39,825 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1323: havoc main_~node6____CPAchecker_TMP_1~1#1; [2025-03-16 19:29:39,880 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-16 19:29:39,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:29:39,892 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:29:39,892 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:29:39,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:39 BoogieIcfgContainer [2025-03-16 19:29:39,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:29:39,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:29:39,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:29:39,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:29:39,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:29:38" (1/3) ... [2025-03-16 19:29:39,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c00512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:39, skipping insertion in model container [2025-03-16 19:29:39,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:29:38" (2/3) ... [2025-03-16 19:29:39,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c00512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:29:39, skipping insertion in model container [2025-03-16 19:29:39,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:29:39" (3/3) ... [2025-03-16 19:29:39,900 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:29:39,909 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:29:39,911 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 248 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:29:39,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:29:39,959 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;@1d2746f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:29:39,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:29:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 246 states have (on average 1.7276422764227641) internal successors, (425), 247 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:29:39,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:39,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:39,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:39,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash 137504, now seen corresponding path program 1 times [2025-03-16 19:29:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:39,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027079939] [2025-03-16 19:29:39,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:40,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:29:40,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:29:40,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:40,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027079939] [2025-03-16 19:29:40,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027079939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:40,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:40,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265033425] [2025-03-16 19:29:40,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:40,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:40,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:40,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:40,597 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 1.7276422764227641) internal successors, (425), 247 states have internal predecessors, (425), 0 states have call successors, (0), 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 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:40,887 INFO L93 Difference]: Finished difference Result 1118 states and 1814 transitions. [2025-03-16 19:29:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:40,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-16 19:29:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:40,905 INFO L225 Difference]: With dead ends: 1118 [2025-03-16 19:29:40,906 INFO L226 Difference]: Without dead ends: 982 [2025-03-16 19:29:40,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:29:40,912 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 3358 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3358 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:40,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3358 Valid, 4383 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-16 19:29:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 380. [2025-03-16 19:29:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.5065963060686016) internal successors, (571), 379 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 571 transitions. [2025-03-16 19:29:40,961 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 571 transitions. Word has length 94 [2025-03-16 19:29:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:40,961 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 571 transitions. [2025-03-16 19:29:40,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 571 transitions. [2025-03-16 19:29:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:29:40,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:40,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:29:40,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:40,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:40,968 INFO L85 PathProgramCache]: Analyzing trace with hash 5224379, now seen corresponding path program 1 times [2025-03-16 19:29:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428285111] [2025-03-16 19:29:40,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:40,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:40,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:29:41,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:29:41,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:41,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428285111] [2025-03-16 19:29:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428285111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759407976] [2025-03-16 19:29:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:41,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:29:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:41,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:29:41,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:41,375 INFO L87 Difference]: Start difference. First operand 380 states and 571 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:41,649 INFO L93 Difference]: Finished difference Result 1907 states and 2967 transitions. [2025-03-16 19:29:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 19:29:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:41,659 INFO L225 Difference]: With dead ends: 1907 [2025-03-16 19:29:41,660 INFO L226 Difference]: Without dead ends: 1621 [2025-03-16 19:29:41,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:29:41,662 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 3182 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3182 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:41,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3182 Valid, 1510 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2025-03-16 19:29:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1611. [2025-03-16 19:29:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.5527950310559007) internal successors, (2500), 1610 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2500 transitions. [2025-03-16 19:29:41,727 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2500 transitions. Word has length 95 [2025-03-16 19:29:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:41,727 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2500 transitions. [2025-03-16 19:29:41,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2500 transitions. [2025-03-16 19:29:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:41,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:41,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:41,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:29:41,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:41,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1284817624, now seen corresponding path program 1 times [2025-03-16 19:29:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:41,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192429145] [2025-03-16 19:29:41,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:41,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:41,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:41,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:41,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:41,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192429145] [2025-03-16 19:29:41,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192429145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:41,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:41,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699985083] [2025-03-16 19:29:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:41,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:41,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:41,912 INFO L87 Difference]: Start difference. First operand 1611 states and 2500 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:42,157 INFO L93 Difference]: Finished difference Result 4121 states and 6484 transitions. [2025-03-16 19:29:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:42,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:29:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:42,168 INFO L225 Difference]: With dead ends: 4121 [2025-03-16 19:29:42,168 INFO L226 Difference]: Without dead ends: 2703 [2025-03-16 19:29:42,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:42,172 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1294 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:42,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 360 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2025-03-16 19:29:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2701. [2025-03-16 19:29:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.5637037037037036) internal successors, (4222), 2700 states have internal predecessors, (4222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 4222 transitions. [2025-03-16 19:29:42,240 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 4222 transitions. Word has length 96 [2025-03-16 19:29:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:42,240 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 4222 transitions. [2025-03-16 19:29:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 4222 transitions. [2025-03-16 19:29:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:42,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:42,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:42,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:29:42,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:42,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:42,246 INFO L85 PathProgramCache]: Analyzing trace with hash 676538028, now seen corresponding path program 1 times [2025-03-16 19:29:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:42,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633325535] [2025-03-16 19:29:42,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:42,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:42,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:42,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:42,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:42,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633325535] [2025-03-16 19:29:42,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633325535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939330263] [2025-03-16 19:29:42,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:42,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:42,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:42,403 INFO L87 Difference]: Start difference. First operand 2701 states and 4222 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:42,624 INFO L93 Difference]: Finished difference Result 7442 states and 11723 transitions. [2025-03-16 19:29:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:29:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:42,640 INFO L225 Difference]: With dead ends: 7442 [2025-03-16 19:29:42,640 INFO L226 Difference]: Without dead ends: 4893 [2025-03-16 19:29:42,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:42,647 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1296 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:42,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 351 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2025-03-16 19:29:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4891. [2025-03-16 19:29:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4890 states have (on average 1.5676891615541921) internal successors, (7666), 4890 states have internal predecessors, (7666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 7666 transitions. [2025-03-16 19:29:42,733 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 7666 transitions. Word has length 96 [2025-03-16 19:29:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:42,734 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 7666 transitions. [2025-03-16 19:29:42,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 7666 transitions. [2025-03-16 19:29:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:42,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:42,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:42,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:29:42,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:42,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:42,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1943240832, now seen corresponding path program 1 times [2025-03-16 19:29:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:42,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270243802] [2025-03-16 19:29:42,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:42,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:42,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:42,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270243802] [2025-03-16 19:29:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270243802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746456131] [2025-03-16 19:29:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:42,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:42,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:42,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:42,866 INFO L87 Difference]: Start difference. First operand 4891 states and 7666 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:43,126 INFO L93 Difference]: Finished difference Result 14095 states and 22188 transitions. [2025-03-16 19:29:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:43,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:29:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:43,152 INFO L225 Difference]: With dead ends: 14095 [2025-03-16 19:29:43,154 INFO L226 Difference]: Without dead ends: 9319 [2025-03-16 19:29:43,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:43,160 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1326 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:43,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 347 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2025-03-16 19:29:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 9317. [2025-03-16 19:29:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9317 states, 9316 states have (on average 1.5670888793473594) internal successors, (14599), 9316 states have internal predecessors, (14599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 14599 transitions. [2025-03-16 19:29:43,315 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 14599 transitions. Word has length 96 [2025-03-16 19:29:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:43,317 INFO L471 AbstractCegarLoop]: Abstraction has 9317 states and 14599 transitions. [2025-03-16 19:29:43,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 14599 transitions. [2025-03-16 19:29:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:43,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:43,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:43,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:29:43,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:43,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash -248852396, now seen corresponding path program 1 times [2025-03-16 19:29:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130601039] [2025-03-16 19:29:43,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:43,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:43,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:43,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:43,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130601039] [2025-03-16 19:29:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130601039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:43,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130371440] [2025-03-16 19:29:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:43,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:43,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:43,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:43,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:43,423 INFO L87 Difference]: Start difference. First operand 9317 states and 14599 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:43,663 INFO L93 Difference]: Finished difference Result 27443 states and 43103 transitions. [2025-03-16 19:29:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:43,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:29:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:43,708 INFO L225 Difference]: With dead ends: 27443 [2025-03-16 19:29:43,708 INFO L226 Difference]: Without dead ends: 18211 [2025-03-16 19:29:43,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:43,781 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1348 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:43,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 347 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18211 states. [2025-03-16 19:29:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18211 to 18209. [2025-03-16 19:29:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18209 states, 18208 states have (on average 1.5629942882249561) internal successors, (28459), 18208 states have internal predecessors, (28459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18209 states to 18209 states and 28459 transitions. [2025-03-16 19:29:44,050 INFO L78 Accepts]: Start accepts. Automaton has 18209 states and 28459 transitions. Word has length 96 [2025-03-16 19:29:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:44,050 INFO L471 AbstractCegarLoop]: Abstraction has 18209 states and 28459 transitions. [2025-03-16 19:29:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 18209 states and 28459 transitions. [2025-03-16 19:29:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:29:44,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:44,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:29:44,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1341003304, now seen corresponding path program 1 times [2025-03-16 19:29:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742851204] [2025-03-16 19:29:44,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:44,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:29:44,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:29:44,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:44,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742851204] [2025-03-16 19:29:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742851204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461538622] [2025-03-16 19:29:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:44,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:44,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:44,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:44,176 INFO L87 Difference]: Start difference. First operand 18209 states and 28459 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:44,549 INFO L93 Difference]: Finished difference Result 54166 states and 84768 transitions. [2025-03-16 19:29:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:29:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:44,610 INFO L225 Difference]: With dead ends: 54166 [2025-03-16 19:29:44,611 INFO L226 Difference]: Without dead ends: 36019 [2025-03-16 19:29:44,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:44,639 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1374 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:44,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 345 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36019 states. [2025-03-16 19:29:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36019 to 36017. [2025-03-16 19:29:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36017 states, 36016 states have (on average 1.556419369169258) internal successors, (56056), 36016 states have internal predecessors, (56056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36017 states to 36017 states and 56056 transitions. [2025-03-16 19:29:45,171 INFO L78 Accepts]: Start accepts. Automaton has 36017 states and 56056 transitions. Word has length 96 [2025-03-16 19:29:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:45,171 INFO L471 AbstractCegarLoop]: Abstraction has 36017 states and 56056 transitions. [2025-03-16 19:29:45,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36017 states and 56056 transitions. [2025-03-16 19:29:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:45,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:45,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:45,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:29:45,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash -588610444, now seen corresponding path program 1 times [2025-03-16 19:29:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:45,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074770927] [2025-03-16 19:29:45,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:45,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:45,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:45,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:45,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:45,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074770927] [2025-03-16 19:29:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074770927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:45,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:29:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645400849] [2025-03-16 19:29:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:45,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:45,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:45,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:45,291 INFO L87 Difference]: Start difference. First operand 36017 states and 56056 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:45,883 INFO L93 Difference]: Finished difference Result 102357 states and 159436 transitions. [2025-03-16 19:29:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 19:29:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:45,988 INFO L225 Difference]: With dead ends: 102357 [2025-03-16 19:29:45,989 INFO L226 Difference]: Without dead ends: 66418 [2025-03-16 19:29:46,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:46,014 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1407 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:46,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 348 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66418 states. [2025-03-16 19:29:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66418 to 66416. [2025-03-16 19:29:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66416 states, 66415 states have (on average 1.5520891364902507) internal successors, (103082), 66415 states have internal predecessors, (103082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66416 states to 66416 states and 103082 transitions. [2025-03-16 19:29:46,936 INFO L78 Accepts]: Start accepts. Automaton has 66416 states and 103082 transitions. Word has length 97 [2025-03-16 19:29:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:46,937 INFO L471 AbstractCegarLoop]: Abstraction has 66416 states and 103082 transitions. [2025-03-16 19:29:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 66416 states and 103082 transitions. [2025-03-16 19:29:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:29:46,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:46,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:46,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:29:46,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash -306093735, now seen corresponding path program 1 times [2025-03-16 19:29:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365574852] [2025-03-16 19:29:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:46,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:29:47,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:29:47,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:47,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365574852] [2025-03-16 19:29:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365574852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:47,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:29:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662147523] [2025-03-16 19:29:47,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:47,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:29:47,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:47,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:29:47,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:29:47,354 INFO L87 Difference]: Start difference. First operand 66416 states and 103082 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:47,527 INFO L93 Difference]: Finished difference Result 67826 states and 105195 transitions. [2025-03-16 19:29:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:29:47,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 19:29:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:47,638 INFO L225 Difference]: With dead ends: 67826 [2025-03-16 19:29:47,639 INFO L226 Difference]: Without dead ends: 67824 [2025-03-16 19:29:47,663 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-03-16 19:29:47,667 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1350 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-03-16 19:29:47,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1350 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67824 states. [2025-03-16 19:29:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67824 to 67824. [2025-03-16 19:29:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67824 states, 67823 states have (on average 1.5406278106247144) internal successors, (104490), 67823 states have internal predecessors, (104490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67824 states to 67824 states and 104490 transitions. [2025-03-16 19:29:48,700 INFO L78 Accepts]: Start accepts. Automaton has 67824 states and 104490 transitions. Word has length 97 [2025-03-16 19:29:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:48,700 INFO L471 AbstractCegarLoop]: Abstraction has 67824 states and 104490 transitions. [2025-03-16 19:29:48,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 67824 states and 104490 transitions. [2025-03-16 19:29:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:29:48,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:48,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:29:48,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:48,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash -894196190, now seen corresponding path program 1 times [2025-03-16 19:29:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391621233] [2025-03-16 19:29:48,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:48,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:29:48,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:29:48,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:48,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391621233] [2025-03-16 19:29:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391621233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:49,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:49,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721536216] [2025-03-16 19:29:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:49,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:49,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:49,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:49,158 INFO L87 Difference]: Start difference. First operand 67824 states and 104490 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:49,925 INFO L93 Difference]: Finished difference Result 82831 states and 126831 transitions. [2025-03-16 19:29:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:29:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:29:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:50,045 INFO L225 Difference]: With dead ends: 82831 [2025-03-16 19:29:50,045 INFO L226 Difference]: Without dead ends: 75794 [2025-03-16 19:29:50,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:29:50,078 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1376 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:50,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1091 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75794 states. [2025-03-16 19:29:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75794 to 67824. [2025-03-16 19:29:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67824 states, 67823 states have (on average 1.540613066363918) internal successors, (104489), 67823 states have internal predecessors, (104489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67824 states to 67824 states and 104489 transitions. [2025-03-16 19:29:50,955 INFO L78 Accepts]: Start accepts. Automaton has 67824 states and 104489 transitions. Word has length 98 [2025-03-16 19:29:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:50,955 INFO L471 AbstractCegarLoop]: Abstraction has 67824 states and 104489 transitions. [2025-03-16 19:29:50,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 67824 states and 104489 transitions. [2025-03-16 19:29:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:29:50,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:50,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:50,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:29:50,964 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:50,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1539323230, now seen corresponding path program 1 times [2025-03-16 19:29:50,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:50,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868115423] [2025-03-16 19:29:50,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:50,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:50,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:29:50,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:29:51,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:51,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868115423] [2025-03-16 19:29:51,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868115423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:51,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:51,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498174277] [2025-03-16 19:29:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:51,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:51,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:51,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:51,422 INFO L87 Difference]: Start difference. First operand 67824 states and 104489 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:52,222 INFO L93 Difference]: Finished difference Result 105063 states and 160562 transitions. [2025-03-16 19:29:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:52,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:29:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:52,337 INFO L225 Difference]: With dead ends: 105063 [2025-03-16 19:29:52,337 INFO L226 Difference]: Without dead ends: 84901 [2025-03-16 19:29:52,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:52,378 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1662 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:52,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 1121 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:29:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84901 states. [2025-03-16 19:29:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84901 to 68675. [2025-03-16 19:29:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68675 states, 68674 states have (on average 1.5399423362553513) internal successors, (105754), 68674 states have internal predecessors, (105754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68675 states to 68675 states and 105754 transitions. [2025-03-16 19:29:53,462 INFO L78 Accepts]: Start accepts. Automaton has 68675 states and 105754 transitions. Word has length 98 [2025-03-16 19:29:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:53,463 INFO L471 AbstractCegarLoop]: Abstraction has 68675 states and 105754 transitions. [2025-03-16 19:29:53,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 68675 states and 105754 transitions. [2025-03-16 19:29:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:29:53,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:53,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:29:53,473 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash -635064542, now seen corresponding path program 1 times [2025-03-16 19:29:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394749180] [2025-03-16 19:29:53,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:53,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:29:53,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:29:53,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:53,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394749180] [2025-03-16 19:29:53,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394749180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:53,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:53,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016690460] [2025-03-16 19:29:53,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:53,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:53,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:53,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:53,726 INFO L87 Difference]: Start difference. First operand 68675 states and 105754 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:54,658 INFO L93 Difference]: Finished difference Result 124552 states and 190574 transitions. [2025-03-16 19:29:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:29:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:54,763 INFO L225 Difference]: With dead ends: 124552 [2025-03-16 19:29:54,763 INFO L226 Difference]: Without dead ends: 91536 [2025-03-16 19:29:54,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:54,807 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1444 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:54,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 1205 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91536 states. [2025-03-16 19:29:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91536 to 69577. [2025-03-16 19:29:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69577 states, 69576 states have (on average 1.5379441186616074) internal successors, (107004), 69576 states have internal predecessors, (107004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69577 states to 69577 states and 107004 transitions. [2025-03-16 19:29:55,931 INFO L78 Accepts]: Start accepts. Automaton has 69577 states and 107004 transitions. Word has length 98 [2025-03-16 19:29:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 69577 states and 107004 transitions. [2025-03-16 19:29:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 69577 states and 107004 transitions. [2025-03-16 19:29:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:29:55,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:55,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:55,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:29:55,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:55,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash 696603554, now seen corresponding path program 1 times [2025-03-16 19:29:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:55,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643284986] [2025-03-16 19:29:55,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:55,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:29:55,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:29:55,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:56,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643284986] [2025-03-16 19:29:56,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643284986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:56,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:56,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292829091] [2025-03-16 19:29:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:56,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:56,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:56,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:56,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:56,253 INFO L87 Difference]: Start difference. First operand 69577 states and 107004 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:57,263 INFO L93 Difference]: Finished difference Result 144321 states and 220613 transitions. [2025-03-16 19:29:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:57,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:29:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:57,401 INFO L225 Difference]: With dead ends: 144321 [2025-03-16 19:29:57,401 INFO L226 Difference]: Without dead ends: 99018 [2025-03-16 19:29:57,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:57,456 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1473 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:57,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1215 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:29:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99018 states. [2025-03-16 19:29:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99018 to 70490. [2025-03-16 19:29:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70490 states, 70489 states have (on average 1.5356296727148917) internal successors, (108245), 70489 states have internal predecessors, (108245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70490 states to 70490 states and 108245 transitions. [2025-03-16 19:29:58,506 INFO L78 Accepts]: Start accepts. Automaton has 70490 states and 108245 transitions. Word has length 98 [2025-03-16 19:29:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:58,506 INFO L471 AbstractCegarLoop]: Abstraction has 70490 states and 108245 transitions. [2025-03-16 19:29:58,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 70490 states and 108245 transitions. [2025-03-16 19:29:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:29:58,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:58,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:29:58,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:29:58,520 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:58,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1082214366, now seen corresponding path program 1 times [2025-03-16 19:29:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838766146] [2025-03-16 19:29:58,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:58,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:29:58,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:29:58,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:58,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:29:58,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838766146] [2025-03-16 19:29:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838766146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:58,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:58,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:29:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382295291] [2025-03-16 19:29:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:58,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:29:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:58,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:29:58,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:29:58,763 INFO L87 Difference]: Start difference. First operand 70490 states and 108245 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:29:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:59,724 INFO L93 Difference]: Finished difference Result 162900 states and 248701 transitions. [2025-03-16 19:29:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:29:59,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:29:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:59,863 INFO L225 Difference]: With dead ends: 162900 [2025-03-16 19:29:59,863 INFO L226 Difference]: Without dead ends: 106024 [2025-03-16 19:29:59,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:29:59,926 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1506 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:59,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1217 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:29:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106024 states. [2025-03-16 19:30:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106024 to 71372. [2025-03-16 19:30:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71372 states, 71371 states have (on average 1.5326533185747713) internal successors, (109387), 71371 states have internal predecessors, (109387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71372 states to 71372 states and 109387 transitions. [2025-03-16 19:30:01,589 INFO L78 Accepts]: Start accepts. Automaton has 71372 states and 109387 transitions. Word has length 98 [2025-03-16 19:30:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:01,589 INFO L471 AbstractCegarLoop]: Abstraction has 71372 states and 109387 transitions. [2025-03-16 19:30:01,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71372 states and 109387 transitions. [2025-03-16 19:30:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:01,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:01,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:01,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:30:01,602 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:01,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1683533542, now seen corresponding path program 1 times [2025-03-16 19:30:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748944049] [2025-03-16 19:30:01,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:01,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:01,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:01,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:01,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:01,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:01,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748944049] [2025-03-16 19:30:01,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748944049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:01,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:01,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:30:01,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752784167] [2025-03-16 19:30:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:01,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:30:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:01,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:30:01,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:30:01,780 INFO L87 Difference]: Start difference. First operand 71372 states and 109387 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:02,736 INFO L93 Difference]: Finished difference Result 179295 states and 274148 transitions. [2025-03-16 19:30:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:30:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:30:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:03,164 INFO L225 Difference]: With dead ends: 179295 [2025-03-16 19:30:03,164 INFO L226 Difference]: Without dead ends: 111361 [2025-03-16 19:30:03,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:30:03,203 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1278 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:03,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1627 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:30:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111361 states. [2025-03-16 19:30:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111361 to 72164. [2025-03-16 19:30:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72164 states, 72163 states have (on average 1.5285949863503459) internal successors, (110308), 72163 states have internal predecessors, (110308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72164 states to 72164 states and 110308 transitions. [2025-03-16 19:30:04,211 INFO L78 Accepts]: Start accepts. Automaton has 72164 states and 110308 transitions. Word has length 99 [2025-03-16 19:30:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:04,211 INFO L471 AbstractCegarLoop]: Abstraction has 72164 states and 110308 transitions. [2025-03-16 19:30:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 72164 states and 110308 transitions. [2025-03-16 19:30:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:04,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:04,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:04,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:30:04,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:04,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:04,223 INFO L85 PathProgramCache]: Analyzing trace with hash -800870400, now seen corresponding path program 1 times [2025-03-16 19:30:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:04,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5521611] [2025-03-16 19:30:04,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:04,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:04,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:04,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:04,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5521611] [2025-03-16 19:30:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5521611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:04,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396941505] [2025-03-16 19:30:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:04,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:04,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:04,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:04,264 INFO L87 Difference]: Start difference. First operand 72164 states and 110308 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:04,606 INFO L93 Difference]: Finished difference Result 162792 states and 249528 transitions. [2025-03-16 19:30:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:30:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:04,777 INFO L225 Difference]: With dead ends: 162792 [2025-03-16 19:30:04,778 INFO L226 Difference]: Without dead ends: 99522 [2025-03-16 19:30:05,109 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-03-16 19:30:05,110 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 248 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:05,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 670 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99522 states. [2025-03-16 19:30:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99522 to 69996. [2025-03-16 19:30:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69996 states, 69995 states have (on average 1.5153225230373597) internal successors, (106065), 69995 states have internal predecessors, (106065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69996 states to 69996 states and 106065 transitions. [2025-03-16 19:30:06,441 INFO L78 Accepts]: Start accepts. Automaton has 69996 states and 106065 transitions. Word has length 99 [2025-03-16 19:30:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 69996 states and 106065 transitions. [2025-03-16 19:30:06,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 69996 states and 106065 transitions. [2025-03-16 19:30:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:06,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:06,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:30:06,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:06,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1848711554, now seen corresponding path program 1 times [2025-03-16 19:30:06,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:06,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976170274] [2025-03-16 19:30:06,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:06,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:06,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:06,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:06,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:06,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976170274] [2025-03-16 19:30:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976170274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:30:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980947746] [2025-03-16 19:30:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:06,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:30:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:06,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:30:06,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:30:06,544 INFO L87 Difference]: Start difference. First operand 69996 states and 106065 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:06,904 INFO L93 Difference]: Finished difference Result 193968 states and 295251 transitions. [2025-03-16 19:30:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:30:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:30:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:07,096 INFO L225 Difference]: With dead ends: 193968 [2025-03-16 19:30:07,096 INFO L226 Difference]: Without dead ends: 129838 [2025-03-16 19:30:07,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:30:07,168 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 234 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:07,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 843 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129838 states. [2025-03-16 19:30:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129838 to 129132. [2025-03-16 19:30:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129132 states, 129131 states have (on average 1.511031433195747) internal successors, (195121), 129131 states have internal predecessors, (195121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129132 states to 129132 states and 195121 transitions. [2025-03-16 19:30:08,906 INFO L78 Accepts]: Start accepts. Automaton has 129132 states and 195121 transitions. Word has length 99 [2025-03-16 19:30:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:08,906 INFO L471 AbstractCegarLoop]: Abstraction has 129132 states and 195121 transitions. [2025-03-16 19:30:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 129132 states and 195121 transitions. [2025-03-16 19:30:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:08,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:08,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:08,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:30:08,916 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1157300698, now seen corresponding path program 1 times [2025-03-16 19:30:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193400574] [2025-03-16 19:30:08,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:08,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:08,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:08,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:08,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193400574] [2025-03-16 19:30:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193400574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:08,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297449617] [2025-03-16 19:30:08,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:08,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:08,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:08,960 INFO L87 Difference]: Start difference. First operand 129132 states and 195121 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:09,365 INFO L93 Difference]: Finished difference Result 166075 states and 250813 transitions. [2025-03-16 19:30:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:30:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:09,558 INFO L225 Difference]: With dead ends: 166075 [2025-03-16 19:30:09,558 INFO L226 Difference]: Without dead ends: 139709 [2025-03-16 19:30:09,622 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-03-16 19:30:09,623 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 202 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:09,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 786 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139709 states. [2025-03-16 19:30:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139709 to 127419. [2025-03-16 19:30:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127419 states, 127418 states have (on average 1.4935487921643724) internal successors, (190305), 127418 states have internal predecessors, (190305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127419 states to 127419 states and 190305 transitions. [2025-03-16 19:30:11,737 INFO L78 Accepts]: Start accepts. Automaton has 127419 states and 190305 transitions. Word has length 99 [2025-03-16 19:30:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:11,737 INFO L471 AbstractCegarLoop]: Abstraction has 127419 states and 190305 transitions. [2025-03-16 19:30:11,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 127419 states and 190305 transitions. [2025-03-16 19:30:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:11,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:11,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:11,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:30:11,747 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:11,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -273424832, now seen corresponding path program 1 times [2025-03-16 19:30:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:11,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233933773] [2025-03-16 19:30:11,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:11,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:11,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:11,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:11,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:11,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233933773] [2025-03-16 19:30:11,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233933773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:11,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:11,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343941335] [2025-03-16 19:30:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:11,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:11,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:11,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:11,789 INFO L87 Difference]: Start difference. First operand 127419 states and 190305 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:12,187 INFO L93 Difference]: Finished difference Result 190917 states and 285689 transitions. [2025-03-16 19:30:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:12,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:30:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:12,378 INFO L225 Difference]: With dead ends: 190917 [2025-03-16 19:30:12,378 INFO L226 Difference]: Without dead ends: 142087 [2025-03-16 19:30:12,877 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-03-16 19:30:12,877 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 208 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:12,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 711 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142087 states. [2025-03-16 19:30:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142087 to 140997. [2025-03-16 19:30:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140997 states, 140996 states have (on average 1.4763042923203495) internal successors, (208153), 140996 states have internal predecessors, (208153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140997 states to 140997 states and 208153 transitions. [2025-03-16 19:30:14,318 INFO L78 Accepts]: Start accepts. Automaton has 140997 states and 208153 transitions. Word has length 99 [2025-03-16 19:30:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:14,319 INFO L471 AbstractCegarLoop]: Abstraction has 140997 states and 208153 transitions. [2025-03-16 19:30:14,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 140997 states and 208153 transitions. [2025-03-16 19:30:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:14,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:14,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:30:14,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:14,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2095319007, now seen corresponding path program 1 times [2025-03-16 19:30:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533666510] [2025-03-16 19:30:14,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:14,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:14,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:14,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:14,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533666510] [2025-03-16 19:30:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533666510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356085989] [2025-03-16 19:30:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:14,369 INFO L87 Difference]: Start difference. First operand 140997 states and 208153 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:15,337 INFO L93 Difference]: Finished difference Result 251637 states and 372105 transitions. [2025-03-16 19:30:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:30:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:15,568 INFO L225 Difference]: With dead ends: 251637 [2025-03-16 19:30:15,568 INFO L226 Difference]: Without dead ends: 165723 [2025-03-16 19:30:15,644 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-03-16 19:30:15,644 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 218 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:15,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 654 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165723 states. [2025-03-16 19:30:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165723 to 164537. [2025-03-16 19:30:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164537 states, 164536 states have (on average 1.4570853794914183) internal successors, (239743), 164536 states have internal predecessors, (239743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164537 states to 164537 states and 239743 transitions. [2025-03-16 19:30:17,963 INFO L78 Accepts]: Start accepts. Automaton has 164537 states and 239743 transitions. Word has length 99 [2025-03-16 19:30:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:17,963 INFO L471 AbstractCegarLoop]: Abstraction has 164537 states and 239743 transitions. [2025-03-16 19:30:17,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 164537 states and 239743 transitions. [2025-03-16 19:30:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:17,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:30:17,971 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:30:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash -172929632, now seen corresponding path program 1 times [2025-03-16 19:30:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:17,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568489456] [2025-03-16 19:30:17,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:17,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:17,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568489456] [2025-03-16 19:30:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568489456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:18,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:18,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466874259] [2025-03-16 19:30:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:18,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:18,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:18,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:18,009 INFO L87 Difference]: Start difference. First operand 164537 states and 239743 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:19,129 INFO L93 Difference]: Finished difference Result 338583 states and 493317 transitions. [2025-03-16 19:30:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:30:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:19,370 INFO L225 Difference]: With dead ends: 338583 [2025-03-16 19:30:19,370 INFO L226 Difference]: Without dead ends: 207509 [2025-03-16 19:30:19,402 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-03-16 19:30:19,402 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 228 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:19,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 651 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207509 states.