./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.6.ufo.UNBOUNDED.pals.c.p+lhb-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 1cf988187e51661749a7431d3b54c72cef46dbc57db121ef5e55cfa0bf7b27cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:02:44,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:02:44,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:02:44,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:02:44,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:02:44,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:02:44,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:02:44,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:02:44,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:02:44,282 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:02:44,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:02:44,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:02:44,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:02:44,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:02:44,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:02:44,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:02:44,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:02:44,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:02:44,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:02:44,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:02:44,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:02:44,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:02:44,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:02:44,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:02:44,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:02:44,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:02:44,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:02:44,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:02:44,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:02:44,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:02:44,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:02:44,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:02:44,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:02:44,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:02:44,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:02:44,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:02:44,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:02:44,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:02:44,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:02:44,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:02:44,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:02:44,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:02:44,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 1cf988187e51661749a7431d3b54c72cef46dbc57db121ef5e55cfa0bf7b27cc [2024-11-10 00:02:44,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:02:44,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:02:44,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:02:44,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:02:44,582 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:02:44,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-10 00:02:46,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:02:46,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:02:46,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-10 00:02:46,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83a46de/8c57fe04b4b74969b153bb5fc5de47e0/FLAG49177945d [2024-11-10 00:02:46,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83a46de/8c57fe04b4b74969b153bb5fc5de47e0 [2024-11-10 00:02:46,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:02:46,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:02:46,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:02:46,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:02:46,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:02:46,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:02:46" (1/1) ... [2024-11-10 00:02:46,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@455087c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:46, skipping insertion in model container [2024-11-10 00:02:46,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:02:46" (1/1) ... [2024-11-10 00:02:46,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:02:47,216 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.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[13915,13928] [2024-11-10 00:02:47,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:02:47,303 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:02:47,383 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.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[13915,13928] [2024-11-10 00:02:47,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:02:47,470 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:02:47,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47 WrapperNode [2024-11-10 00:02:47,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:02:47,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:02:47,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:02:47,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:02:47,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,559 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1263 [2024-11-10 00:02:47,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:02:47,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:02:47,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:02:47,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:02:47,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,604 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]. [2024-11-10 00:02:47,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:02:47,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:02:47,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:02:47,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:02:47,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (1/1) ... [2024-11-10 00:02:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:02:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:02:47,698 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) [2024-11-10 00:02:47,703 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 [2024-11-10 00:02:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:02:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:02:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:02:47,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:02:47,874 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:02:47,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:02:48,998 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1292: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:48,999 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:02:48,999 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:02:48,999 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:02:48,999 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1558: havoc main_~node4____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:48,999 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1; [2024-11-10 00:02:49,000 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1; [2024-11-10 00:02:49,000 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1; [2024-11-10 00:02:49,000 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1; [2024-11-10 00:02:49,000 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1; [2024-11-10 00:02:49,000 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1; [2024-11-10 00:02:49,000 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1824: havoc main_~node5____CPAchecker_TMP_0~3#1; [2024-11-10 00:02:49,001 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:02:49,001 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:02:49,001 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:02:49,001 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: havoc main_~node6__m6~3#1;havoc main_~node5__m5~3#1; [2024-11-10 00:02:49,001 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: havoc main_~node6__m6~3#1;havoc main_~node5__m5~3#1; [2024-11-10 00:02:49,001 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: havoc main_~node6__m6~3#1;havoc main_~node5__m5~3#1; [2024-11-10 00:02:49,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L438: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-10 00:02:49,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L438: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-10 00:02:49,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L438: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-10 00:02:49,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-10 00:02:49,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-10 00:02:49,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-10 00:02:49,003 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959: havoc main_~node2____CPAchecker_TMP_0~3#1; [2024-11-10 00:02:49,003 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:02:49,003 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:02:49,003 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:02:49,003 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:02:49,003 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L936: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:49,003 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1; [2024-11-10 00:02:49,004 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1; [2024-11-10 00:02:49,004 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1; [2024-11-10 00:02:49,004 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-10 00:02:49,004 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-10 00:02:49,004 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-10 00:02:49,004 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~node5____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1698: havoc main_~node1____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:49,005 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:49,006 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:49,006 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:49,006 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1; [2024-11-10 00:02:49,006 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1; [2024-11-10 00:02:49,006 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1; [2024-11-10 00:02:49,006 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1; [2024-11-10 00:02:49,007 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:49,007 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:49,007 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:49,007 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:49,007 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L510: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:49,007 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: havoc main_~node6____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:49,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:49,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:49,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:49,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:49,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:49,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1337: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:49,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc main_~init__tmp~0#1; [2024-11-10 00:02:49,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:02:49,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:02:49,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:02:49,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:02:49,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:02:49,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1603: havoc main_~node3____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:49,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:49,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1869: havoc main_~node4____CPAchecker_TMP_0~3#1; [2024-11-10 00:02:49,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L846: havoc main_~node6____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:49,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:49,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1247: havoc main_~node4____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:49,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1513: havoc main_~node5____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:49,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2009: havoc main_~node1____CPAchecker_TMP_0~3#1; [2024-11-10 00:02:49,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc main_~node6____CPAchecker_TMP_0~3#1; [2024-11-10 00:02:49,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: havoc main_~node2____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:49,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914: havoc main_~node3____CPAchecker_TMP_0~3#1; [2024-11-10 00:02:49,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~node5____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:49,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1387: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:49,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1157: havoc main_~node6____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:49,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1026: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:49,129 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-11-10 00:02:49,130 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:02:49,163 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:02:49,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:02:49,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:02:49 BoogieIcfgContainer [2024-11-10 00:02:49,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:02:49,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:02:49,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:02:49,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:02:49,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:02:46" (1/3) ... [2024-11-10 00:02:49,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb811ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:02:49, skipping insertion in model container [2024-11-10 00:02:49,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:47" (2/3) ... [2024-11-10 00:02:49,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb811ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:02:49, skipping insertion in model container [2024-11-10 00:02:49,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:02:49" (3/3) ... [2024-11-10 00:02:49,173 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-10 00:02:49,194 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:02:49,195 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:02:49,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:02:49,302 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;@1ca3b2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:02:49,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:02:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 378 states, 376 states have (on average 1.5691489361702127) internal successors, (590), 377 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 00:02:49,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:49,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:49,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:49,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash -423420139, now seen corresponding path program 1 times [2024-11-10 00:02:49,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:49,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276303097] [2024-11-10 00:02:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276303097] [2024-11-10 00:02:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276303097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:02:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269604475] [2024-11-10 00:02:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:50,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:02:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:50,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:02:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:02:50,070 INFO L87 Difference]: Start difference. First operand has 378 states, 376 states have (on average 1.5691489361702127) internal successors, (590), 377 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:50,237 INFO L93 Difference]: Finished difference Result 713 states and 1097 transitions. [2024-11-10 00:02:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:02:50,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-10 00:02:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:50,254 INFO L225 Difference]: With dead ends: 713 [2024-11-10 00:02:50,254 INFO L226 Difference]: Without dead ends: 374 [2024-11-10 00:02:50,259 INFO L431 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 [2024-11-10 00:02:50,265 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 39 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:50,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1712 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:02:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-10 00:02:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-10 00:02:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.4530831099195711) internal successors, (542), 373 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 542 transitions. [2024-11-10 00:02:50,340 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 542 transitions. Word has length 119 [2024-11-10 00:02:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:50,341 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 542 transitions. [2024-11-10 00:02:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 542 transitions. [2024-11-10 00:02:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-10 00:02:50,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:50,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:50,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:02:50,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:50,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash -258213175, now seen corresponding path program 1 times [2024-11-10 00:02:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563864373] [2024-11-10 00:02:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:50,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563864373] [2024-11-10 00:02:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563864373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:50,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:50,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393904459] [2024-11-10 00:02:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:50,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:50,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:50,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:50,640 INFO L87 Difference]: Start difference. First operand 374 states and 542 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:50,697 INFO L93 Difference]: Finished difference Result 826 states and 1252 transitions. [2024-11-10 00:02:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2024-11-10 00:02:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:50,702 INFO L225 Difference]: With dead ends: 826 [2024-11-10 00:02:50,705 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 00:02:50,708 INFO L431 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 [2024-11-10 00:02:50,710 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 318 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:50,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 937 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 00:02:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 550. [2024-11-10 00:02:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4863387978142077) internal successors, (816), 549 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 816 transitions. [2024-11-10 00:02:50,752 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 816 transitions. Word has length 197 [2024-11-10 00:02:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:50,754 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 816 transitions. [2024-11-10 00:02:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 816 transitions. [2024-11-10 00:02:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 00:02:50,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:50,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:50,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:02:50,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:50,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1457400566, now seen corresponding path program 1 times [2024-11-10 00:02:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896348421] [2024-11-10 00:02:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:50,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896348421] [2024-11-10 00:02:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896348421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610361889] [2024-11-10 00:02:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:50,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:50,952 INFO L87 Difference]: Start difference. First operand 550 states and 816 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:50,996 INFO L93 Difference]: Finished difference Result 1316 states and 2016 transitions. [2024-11-10 00:02:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2024-11-10 00:02:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:51,001 INFO L225 Difference]: With dead ends: 1316 [2024-11-10 00:02:51,002 INFO L226 Difference]: Without dead ends: 872 [2024-11-10 00:02:51,003 INFO L431 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 [2024-11-10 00:02:51,008 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 304 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:51,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1018 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-10 00:02:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2024-11-10 00:02:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5097813578826238) internal successors, (1312), 869 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1312 transitions. [2024-11-10 00:02:51,046 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1312 transitions. Word has length 199 [2024-11-10 00:02:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:51,046 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1312 transitions. [2024-11-10 00:02:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1312 transitions. [2024-11-10 00:02:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 00:02:51,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:51,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:51,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:02:51,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:51,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:51,054 INFO L85 PathProgramCache]: Analyzing trace with hash 304626196, now seen corresponding path program 1 times [2024-11-10 00:02:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:51,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326480644] [2024-11-10 00:02:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326480644] [2024-11-10 00:02:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326480644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:51,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:51,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217928729] [2024-11-10 00:02:51,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:51,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:51,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:51,243 INFO L87 Difference]: Start difference. First operand 870 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:51,293 INFO L93 Difference]: Finished difference Result 2202 states and 3388 transitions. [2024-11-10 00:02:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:51,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2024-11-10 00:02:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:51,303 INFO L225 Difference]: With dead ends: 2202 [2024-11-10 00:02:51,304 INFO L226 Difference]: Without dead ends: 1444 [2024-11-10 00:02:51,306 INFO L431 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 [2024-11-10 00:02:51,307 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 292 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:51,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 897 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-11-10 00:02:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1442. [2024-11-10 00:02:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1441 states have (on average 1.5211658570437196) internal successors, (2192), 1441 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2192 transitions. [2024-11-10 00:02:51,342 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2192 transitions. Word has length 201 [2024-11-10 00:02:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:51,344 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2192 transitions. [2024-11-10 00:02:51,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2192 transitions. [2024-11-10 00:02:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 00:02:51,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:51,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:51,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:02:51,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:51,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash -433796298, now seen corresponding path program 1 times [2024-11-10 00:02:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:51,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111406903] [2024-11-10 00:02:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:51,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:51,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111406903] [2024-11-10 00:02:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111406903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:51,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553151270] [2024-11-10 00:02:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:51,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:51,539 INFO L87 Difference]: Start difference. First operand 1442 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:51,619 INFO L93 Difference]: Finished difference Result 3772 states and 5796 transitions. [2024-11-10 00:02:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:51,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-11-10 00:02:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:51,630 INFO L225 Difference]: With dead ends: 3772 [2024-11-10 00:02:51,630 INFO L226 Difference]: Without dead ends: 2448 [2024-11-10 00:02:51,633 INFO L431 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 [2024-11-10 00:02:51,635 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 279 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:51,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 877 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2024-11-10 00:02:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2446. [2024-11-10 00:02:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2445 states have (on average 1.521472392638037) internal successors, (3720), 2445 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 3720 transitions. [2024-11-10 00:02:51,691 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 3720 transitions. Word has length 203 [2024-11-10 00:02:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:51,692 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 3720 transitions. [2024-11-10 00:02:51,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 3720 transitions. [2024-11-10 00:02:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 00:02:51,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:51,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:51,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:02:51,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:51,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1495588290, now seen corresponding path program 1 times [2024-11-10 00:02:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016310333] [2024-11-10 00:02:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016310333] [2024-11-10 00:02:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016310333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004206921] [2024-11-10 00:02:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:51,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:51,861 INFO L87 Difference]: Start difference. First operand 2446 states and 3720 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:51,923 INFO L93 Difference]: Finished difference Result 6494 states and 9916 transitions. [2024-11-10 00:02:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2024-11-10 00:02:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:51,939 INFO L225 Difference]: With dead ends: 6494 [2024-11-10 00:02:51,940 INFO L226 Difference]: Without dead ends: 4172 [2024-11-10 00:02:51,945 INFO L431 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 [2024-11-10 00:02:51,946 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 266 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:51,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 857 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2024-11-10 00:02:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4170. [2024-11-10 00:02:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4169 states have (on average 1.5121132165987048) internal successors, (6304), 4169 states have internal predecessors, (6304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6304 transitions. [2024-11-10 00:02:52,082 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6304 transitions. Word has length 205 [2024-11-10 00:02:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:52,083 INFO L471 AbstractCegarLoop]: Abstraction has 4170 states and 6304 transitions. [2024-11-10 00:02:52,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6304 transitions. [2024-11-10 00:02:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 00:02:52,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:52,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:52,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:02:52,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:52,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:52,098 INFO L85 PathProgramCache]: Analyzing trace with hash -386562921, now seen corresponding path program 1 times [2024-11-10 00:02:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580470065] [2024-11-10 00:02:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:52,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:52,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580470065] [2024-11-10 00:02:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580470065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:52,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073727022] [2024-11-10 00:02:52,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:52,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:52,479 INFO L87 Difference]: Start difference. First operand 4170 states and 6304 transitions. Second operand has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:53,685 INFO L93 Difference]: Finished difference Result 43315 states and 65431 transitions. [2024-11-10 00:02:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:02:53,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2024-11-10 00:02:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:53,807 INFO L225 Difference]: With dead ends: 43315 [2024-11-10 00:02:53,807 INFO L226 Difference]: Without dead ends: 39276 [2024-11-10 00:02:53,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:02:53,826 INFO L432 NwaCegarLoop]: 1538 mSDtfsCounter, 3656 mSDsluCounter, 8792 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3656 SdHoareTripleChecker+Valid, 10330 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:53,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3656 Valid, 10330 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:02:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39276 states. [2024-11-10 00:02:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39276 to 8245. [2024-11-10 00:02:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8245 states, 8244 states have (on average 1.4935710819990295) internal successors, (12313), 8244 states have internal predecessors, (12313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8245 states to 8245 states and 12313 transitions. [2024-11-10 00:02:54,415 INFO L78 Accepts]: Start accepts. Automaton has 8245 states and 12313 transitions. Word has length 207 [2024-11-10 00:02:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:54,416 INFO L471 AbstractCegarLoop]: Abstraction has 8245 states and 12313 transitions. [2024-11-10 00:02:54,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 8245 states and 12313 transitions. [2024-11-10 00:02:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 00:02:54,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:54,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:54,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:02:54,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:54,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash -412872772, now seen corresponding path program 1 times [2024-11-10 00:02:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:54,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039674231] [2024-11-10 00:02:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:54,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039674231] [2024-11-10 00:02:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039674231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:54,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:54,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:54,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450617613] [2024-11-10 00:02:54,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:54,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:54,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:54,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:54,627 INFO L87 Difference]: Start difference. First operand 8245 states and 12313 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:54,725 INFO L93 Difference]: Finished difference Result 23048 states and 34366 transitions. [2024-11-10 00:02:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 210 [2024-11-10 00:02:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:54,758 INFO L225 Difference]: With dead ends: 23048 [2024-11-10 00:02:54,759 INFO L226 Difference]: Without dead ends: 14891 [2024-11-10 00:02:54,773 INFO L431 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 [2024-11-10 00:02:54,774 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 312 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:54,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1155 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14891 states. [2024-11-10 00:02:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14891 to 14889. [2024-11-10 00:02:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14889 states, 14888 states have (on average 1.4786405158516926) internal successors, (22014), 14888 states have internal predecessors, (22014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14889 states to 14889 states and 22014 transitions. [2024-11-10 00:02:55,169 INFO L78 Accepts]: Start accepts. Automaton has 14889 states and 22014 transitions. Word has length 210 [2024-11-10 00:02:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 14889 states and 22014 transitions. [2024-11-10 00:02:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14889 states and 22014 transitions. [2024-11-10 00:02:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:02:55,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:55,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:55,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:02:55,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:55,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2028275708, now seen corresponding path program 1 times [2024-11-10 00:02:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:55,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753401441] [2024-11-10 00:02:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753401441] [2024-11-10 00:02:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753401441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995509585] [2024-11-10 00:02:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:55,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:55,783 INFO L87 Difference]: Start difference. First operand 14889 states and 22014 transitions. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:56,317 INFO L93 Difference]: Finished difference Result 29654 states and 43888 transitions. [2024-11-10 00:02:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:56,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 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 212 [2024-11-10 00:02:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:56,346 INFO L225 Difference]: With dead ends: 29654 [2024-11-10 00:02:56,346 INFO L226 Difference]: Without dead ends: 14891 [2024-11-10 00:02:56,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:56,367 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 1760 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:56,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 2207 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14891 states. [2024-11-10 00:02:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14891 to 14889. [2024-11-10 00:02:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14889 states, 14888 states have (on average 1.4656770553465879) internal successors, (21821), 14888 states have internal predecessors, (21821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14889 states to 14889 states and 21821 transitions. [2024-11-10 00:02:56,670 INFO L78 Accepts]: Start accepts. Automaton has 14889 states and 21821 transitions. Word has length 212 [2024-11-10 00:02:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:56,670 INFO L471 AbstractCegarLoop]: Abstraction has 14889 states and 21821 transitions. [2024-11-10 00:02:56,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 14889 states and 21821 transitions. [2024-11-10 00:02:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 00:02:56,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:56,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:56,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:02:56,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:56,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1705458649, now seen corresponding path program 1 times [2024-11-10 00:02:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:56,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518491680] [2024-11-10 00:02:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:56,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518491680] [2024-11-10 00:02:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518491680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271146641] [2024-11-10 00:02:56,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:56,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:56,964 INFO L87 Difference]: Start difference. First operand 14889 states and 21821 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:57,134 INFO L93 Difference]: Finished difference Result 35188 states and 51658 transitions. [2024-11-10 00:02:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2024-11-10 00:02:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:57,175 INFO L225 Difference]: With dead ends: 35188 [2024-11-10 00:02:57,175 INFO L226 Difference]: Without dead ends: 20421 [2024-11-10 00:02:57,200 INFO L431 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 [2024-11-10 00:02:57,201 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 332 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:57,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 790 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:02:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20421 states. [2024-11-10 00:02:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20421 to 20355. [2024-11-10 00:02:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20355 states, 20354 states have (on average 1.4488552618649897) internal successors, (29490), 20354 states have internal predecessors, (29490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20355 states to 20355 states and 29490 transitions. [2024-11-10 00:02:57,713 INFO L78 Accepts]: Start accepts. Automaton has 20355 states and 29490 transitions. Word has length 214 [2024-11-10 00:02:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:57,713 INFO L471 AbstractCegarLoop]: Abstraction has 20355 states and 29490 transitions. [2024-11-10 00:02:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 20355 states and 29490 transitions. [2024-11-10 00:02:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:02:57,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:57,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:57,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:02:57,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:57,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2038752930, now seen corresponding path program 1 times [2024-11-10 00:02:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:57,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455523251] [2024-11-10 00:02:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:02:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455523251] [2024-11-10 00:02:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455523251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129548012] [2024-11-10 00:02:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:57,860 INFO L87 Difference]: Start difference. First operand 20355 states and 29490 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:58,349 INFO L93 Difference]: Finished difference Result 59134 states and 85604 transitions. [2024-11-10 00:02:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:58,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-10 00:02:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:58,425 INFO L225 Difference]: With dead ends: 59134 [2024-11-10 00:02:58,425 INFO L226 Difference]: Without dead ends: 40368 [2024-11-10 00:02:58,461 INFO L431 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 [2024-11-10 00:02:58,462 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 345 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:58,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 618 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40368 states. [2024-11-10 00:02:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40368 to 40366. [2024-11-10 00:02:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40366 states, 40365 states have (on average 1.4399355877616746) internal successors, (58123), 40365 states have internal predecessors, (58123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40366 states to 40366 states and 58123 transitions. [2024-11-10 00:02:59,459 INFO L78 Accepts]: Start accepts. Automaton has 40366 states and 58123 transitions. Word has length 215 [2024-11-10 00:02:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:59,459 INFO L471 AbstractCegarLoop]: Abstraction has 40366 states and 58123 transitions. [2024-11-10 00:02:59,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:02:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40366 states and 58123 transitions. [2024-11-10 00:02:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:02:59,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:59,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:02:59,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:02:59,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2123600833, now seen corresponding path program 1 times [2024-11-10 00:02:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332495721] [2024-11-10 00:02:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:00,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332495721] [2024-11-10 00:03:00,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332495721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:00,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:00,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:03:00,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289599907] [2024-11-10 00:03:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:00,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:03:00,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:00,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:03:00,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:03:00,128 INFO L87 Difference]: Start difference. First operand 40366 states and 58123 transitions. Second operand has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:01,564 INFO L93 Difference]: Finished difference Result 221241 states and 316485 transitions. [2024-11-10 00:03:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:03:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-10 00:03:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:02,052 INFO L225 Difference]: With dead ends: 221241 [2024-11-10 00:03:02,052 INFO L226 Difference]: Without dead ends: 198007 [2024-11-10 00:03:02,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:03:02,258 INFO L432 NwaCegarLoop]: 1192 mSDtfsCounter, 3087 mSDsluCounter, 3094 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3087 SdHoareTripleChecker+Valid, 4286 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:02,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3087 Valid, 4286 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:03:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198007 states. [2024-11-10 00:03:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198007 to 76267. [2024-11-10 00:03:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76267 states, 76266 states have (on average 1.4309653056407836) internal successors, (109134), 76266 states have internal predecessors, (109134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76267 states to 76267 states and 109134 transitions. [2024-11-10 00:03:05,038 INFO L78 Accepts]: Start accepts. Automaton has 76267 states and 109134 transitions. Word has length 215 [2024-11-10 00:03:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:05,038 INFO L471 AbstractCegarLoop]: Abstraction has 76267 states and 109134 transitions. [2024-11-10 00:03:05,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 76267 states and 109134 transitions. [2024-11-10 00:03:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:03:05,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:05,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:05,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:03:05,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:05,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -680221344, now seen corresponding path program 1 times [2024-11-10 00:03:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397105404] [2024-11-10 00:03:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397105404] [2024-11-10 00:03:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397105404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:05,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:05,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:03:05,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268290537] [2024-11-10 00:03:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:05,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:03:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:05,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:03:05,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:03:05,527 INFO L87 Difference]: Start difference. First operand 76267 states and 109134 transitions. Second operand has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:06,741 INFO L93 Difference]: Finished difference Result 252885 states and 361365 transitions. [2024-11-10 00:03:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:03:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-10 00:03:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:07,066 INFO L225 Difference]: With dead ends: 252885 [2024-11-10 00:03:07,066 INFO L226 Difference]: Without dead ends: 229651 [2024-11-10 00:03:07,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:03:07,143 INFO L432 NwaCegarLoop]: 965 mSDtfsCounter, 3500 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3500 SdHoareTripleChecker+Valid, 3653 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:07,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3500 Valid, 3653 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:03:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229651 states. [2024-11-10 00:03:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229651 to 122135. [2024-11-10 00:03:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122135 states, 122134 states have (on average 1.422142892233121) internal successors, (173692), 122134 states have internal predecessors, (173692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122135 states to 122135 states and 173692 transitions. [2024-11-10 00:03:10,472 INFO L78 Accepts]: Start accepts. Automaton has 122135 states and 173692 transitions. Word has length 215 [2024-11-10 00:03:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:10,473 INFO L471 AbstractCegarLoop]: Abstraction has 122135 states and 173692 transitions. [2024-11-10 00:03:10,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 122135 states and 173692 transitions. [2024-11-10 00:03:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:03:10,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:10,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:10,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:03:10,580 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1547929887, now seen corresponding path program 1 times [2024-11-10 00:03:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519223597] [2024-11-10 00:03:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:10,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:10,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519223597] [2024-11-10 00:03:10,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519223597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:10,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:10,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:03:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704484058] [2024-11-10 00:03:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:10,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:03:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:03:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:03:10,875 INFO L87 Difference]: Start difference. First operand 122135 states and 173692 transitions. Second operand has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:12,408 INFO L93 Difference]: Finished difference Result 283341 states and 404461 transitions. [2024-11-10 00:03:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:03:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-10 00:03:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:12,791 INFO L225 Difference]: With dead ends: 283341 [2024-11-10 00:03:12,791 INFO L226 Difference]: Without dead ends: 260107 [2024-11-10 00:03:12,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:03:12,882 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 3433 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3433 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:12,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3433 Valid, 4005 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:03:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260107 states. [2024-11-10 00:03:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260107 to 152845. [2024-11-10 00:03:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152845 states, 152844 states have (on average 1.4208473999633613) internal successors, (217168), 152844 states have internal predecessors, (217168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152845 states to 152845 states and 217168 transitions. [2024-11-10 00:03:17,298 INFO L78 Accepts]: Start accepts. Automaton has 152845 states and 217168 transitions. Word has length 215 [2024-11-10 00:03:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:17,299 INFO L471 AbstractCegarLoop]: Abstraction has 152845 states and 217168 transitions. [2024-11-10 00:03:17,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 152845 states and 217168 transitions. [2024-11-10 00:03:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:03:17,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:17,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:17,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:03:17,443 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:17,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash -667117696, now seen corresponding path program 1 times [2024-11-10 00:03:17,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:17,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631103495] [2024-11-10 00:03:17,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631103495] [2024-11-10 00:03:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631103495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:03:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492417195] [2024-11-10 00:03:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:17,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:03:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:03:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:03:17,724 INFO L87 Difference]: Start difference. First operand 152845 states and 217168 transitions. Second operand has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:19,312 INFO L93 Difference]: Finished difference Result 311997 states and 444877 transitions. [2024-11-10 00:03:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:03:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-10 00:03:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:19,687 INFO L225 Difference]: With dead ends: 311997 [2024-11-10 00:03:19,687 INFO L226 Difference]: Without dead ends: 288763 [2024-11-10 00:03:19,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:03:19,743 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 3572 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3572 SdHoareTripleChecker+Valid, 3996 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:19,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3572 Valid, 3996 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:03:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288763 states. [2024-11-10 00:03:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288763 to 182853. [2024-11-10 00:03:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182853 states, 182852 states have (on average 1.4195633627195765) internal successors, (259570), 182852 states have internal predecessors, (259570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182853 states to 182853 states and 259570 transitions. [2024-11-10 00:03:23,643 INFO L78 Accepts]: Start accepts. Automaton has 182853 states and 259570 transitions. Word has length 215 [2024-11-10 00:03:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:23,643 INFO L471 AbstractCegarLoop]: Abstraction has 182853 states and 259570 transitions. [2024-11-10 00:03:23,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 182853 states and 259570 transitions. [2024-11-10 00:03:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:03:24,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:24,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:24,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:03:24,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:24,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1593148927, now seen corresponding path program 1 times [2024-11-10 00:03:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526356569] [2024-11-10 00:03:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526356569] [2024-11-10 00:03:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526356569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:25,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:25,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:03:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424042065] [2024-11-10 00:03:25,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:25,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:03:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:25,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:03:25,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:03:25,208 INFO L87 Difference]: Start difference. First operand 182853 states and 259570 transitions. Second operand has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:26,359 INFO L93 Difference]: Finished difference Result 337629 states and 480845 transitions. [2024-11-10 00:03:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:03:26,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-11-10 00:03:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:27,689 INFO L225 Difference]: With dead ends: 337629 [2024-11-10 00:03:27,689 INFO L226 Difference]: Without dead ends: 314395 [2024-11-10 00:03:27,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:03:27,781 INFO L432 NwaCegarLoop]: 1362 mSDtfsCounter, 2790 mSDsluCounter, 4734 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2790 SdHoareTripleChecker+Valid, 6096 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:27,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2790 Valid, 6096 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:03:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314395 states. [2024-11-10 00:03:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314395 to 212015. [2024-11-10 00:03:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212015 states, 212014 states have (on average 1.4181044647994945) internal successors, (300658), 212014 states have internal predecessors, (300658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212015 states to 212015 states and 300658 transitions. [2024-11-10 00:03:32,047 INFO L78 Accepts]: Start accepts. Automaton has 212015 states and 300658 transitions. Word has length 215 [2024-11-10 00:03:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:32,047 INFO L471 AbstractCegarLoop]: Abstraction has 212015 states and 300658 transitions. [2024-11-10 00:03:32,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 212015 states and 300658 transitions. [2024-11-10 00:03:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 00:03:32,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:32,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:32,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:03:32,248 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:32,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash -328848703, now seen corresponding path program 1 times [2024-11-10 00:03:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610559089] [2024-11-10 00:03:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610559089] [2024-11-10 00:03:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610559089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:33,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:33,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:03:33,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218395485] [2024-11-10 00:03:33,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:33,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:03:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:33,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:03:33,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:03:33,599 INFO L87 Difference]: Start difference. First operand 212015 states and 300658 transitions. Second operand has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:34,833 INFO L93 Difference]: Finished difference Result 352959 states and 502941 transitions. [2024-11-10 00:03:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:03:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2024-11-10 00:03:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:35,306 INFO L225 Difference]: With dead ends: 352959 [2024-11-10 00:03:35,307 INFO L226 Difference]: Without dead ends: 337117 [2024-11-10 00:03:36,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:03:36,260 INFO L432 NwaCegarLoop]: 1530 mSDtfsCounter, 2801 mSDsluCounter, 3771 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2801 SdHoareTripleChecker+Valid, 5301 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:36,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2801 Valid, 5301 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:03:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337117 states. [2024-11-10 00:03:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337117 to 234737. [2024-11-10 00:03:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234737 states, 234736 states have (on average 1.4198163042737373) internal successors, (333282), 234736 states have internal predecessors, (333282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234737 states to 234737 states and 333282 transitions. [2024-11-10 00:03:40,999 INFO L78 Accepts]: Start accepts. Automaton has 234737 states and 333282 transitions. Word has length 216 [2024-11-10 00:03:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:40,999 INFO L471 AbstractCegarLoop]: Abstraction has 234737 states and 333282 transitions. [2024-11-10 00:03:40,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:03:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 234737 states and 333282 transitions. [2024-11-10 00:03:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 00:03:41,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:41,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:03:41,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:03:41,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:41,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 358363260, now seen corresponding path program 1 times [2024-11-10 00:03:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158878810] [2024-11-10 00:03:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:03:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158878810] [2024-11-10 00:03:41,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158878810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:41,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:41,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445623593] [2024-11-10 00:03:41,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:41,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:41,344 INFO L87 Difference]: Start difference. First operand 234737 states and 333282 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)