./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:45:55,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:45:55,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:45:55,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:45:55,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:45:55,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:45:55,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:45:55,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:45:55,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:45:55,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:45:55,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:45:55,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:45:55,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:45:55,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:45:55,578 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:45:55,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:45:55,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:45:55,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:45:55,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:45:55,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:45:55,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:45:55,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:45:55,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:45:55,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:45:55,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:45:55,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:45:55,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:45:55,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:45:55,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:45:55,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:45:55,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:45:55,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:45:55,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:45:55,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:45:55,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:45:55,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:45:55,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:45:55,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:45:55,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:45:55,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:45:55,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:45:55,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:45:55,590 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-clean/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-clean/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 -> a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 [2024-10-11 03:45:55,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:45:55,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:45:55,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:45:55,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:45:55,878 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:45:55,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:45:57,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:45:57,603 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:45:57,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:45:57,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4882c4ee3/016f30d2a8534d218a7e513b85c0f3e2/FLAG668d3c52a [2024-10-11 03:45:57,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4882c4ee3/016f30d2a8534d218a7e513b85c0f3e2 [2024-10-11 03:45:57,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:45:57,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:45:57,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:45:57,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:45:57,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:45:57,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:45:57" (1/1) ... [2024-10-11 03:45:57,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e48fa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:57, skipping insertion in model container [2024-10-11 03:45:57,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:45:57" (1/1) ... [2024-10-11 03:45:58,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:45:58,322 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7117,7130] [2024-10-11 03:45:58,349 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9784,9797] [2024-10-11 03:45:58,355 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10875,10888] [2024-10-11 03:45:58,364 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11481,11494] [2024-10-11 03:45:58,377 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12900,12913] [2024-10-11 03:45:58,382 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13506,13519] [2024-10-11 03:45:58,388 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14435,14448] [2024-10-11 03:45:58,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:45:58,473 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:45:58,537 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7117,7130] [2024-10-11 03:45:58,555 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9784,9797] [2024-10-11 03:45:58,561 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10875,10888] [2024-10-11 03:45:58,565 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11481,11494] [2024-10-11 03:45:58,571 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12900,12913] [2024-10-11 03:45:58,574 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13506,13519] [2024-10-11 03:45:58,579 WARN L248 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14435,14448] [2024-10-11 03:45:58,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:45:58,624 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:45:58,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58 WrapperNode [2024-10-11 03:45:58,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:45:58,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:45:58,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:45:58,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:45:58,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,718 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1047 [2024-10-11 03:45:58,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:45:58,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:45:58,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:45:58,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:45:58,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,770 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-10-11 03:45:58,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:45:58,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:45:58,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:45:58,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:45:58,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (1/1) ... [2024-10-11 03:45:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:45:58,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:58,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:45:58,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:45:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:45:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:45:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:45:58,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:45:59,074 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:45:59,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:45:59,958 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-11 03:45:59,958 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:46:00,032 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:46:00,032 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:46:00,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:46:00 BoogieIcfgContainer [2024-10-11 03:46:00,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:46:00,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:46:00,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:46:00,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:46:00,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:45:57" (1/3) ... [2024-10-11 03:46:00,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ff2d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:46:00, skipping insertion in model container [2024-10-11 03:46:00,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:58" (2/3) ... [2024-10-11 03:46:00,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ff2d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:46:00, skipping insertion in model container [2024-10-11 03:46:00,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:46:00" (3/3) ... [2024-10-11 03:46:00,042 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:46:00,056 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:46:00,057 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 03:46:00,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:46:00,134 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;@aef4bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:46:00,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 03:46:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 196 states have (on average 1.8316326530612246) internal successors, (359), 203 states have internal predecessors, (359), 0 states have call successors, (0), 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-10-11 03:46:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 03:46:00,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:00,150 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] [2024-10-11 03:46:00,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:00,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -114756949, now seen corresponding path program 1 times [2024-10-11 03:46:00,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:00,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013540386] [2024-10-11 03:46:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013540386] [2024-10-11 03:46:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013540386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:46:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373154145] [2024-10-11 03:46:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:00,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:00,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:00,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:00,863 INFO L87 Difference]: Start difference. First operand has 204 states, 196 states have (on average 1.8316326530612246) internal successors, (359), 203 states have internal predecessors, (359), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-11 03:46:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:01,144 INFO L93 Difference]: Finished difference Result 333 states and 563 transitions. [2024-10-11 03:46:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:46:01,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-11 03:46:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:01,159 INFO L225 Difference]: With dead ends: 333 [2024-10-11 03:46:01,160 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 03:46:01,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:46:01,167 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 849 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:01,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 238 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 03:46:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-11 03:46:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 175 states have (on average 1.28) internal successors, (224), 181 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-11 03:46:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2024-10-11 03:46:01,210 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 45 [2024-10-11 03:46:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:01,210 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2024-10-11 03:46:01,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-11 03:46:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2024-10-11 03:46:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 03:46:01,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:01,212 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] [2024-10-11 03:46:01,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:46:01,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:01,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1679415330, now seen corresponding path program 1 times [2024-10-11 03:46:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216454750] [2024-10-11 03:46:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216454750] [2024-10-11 03:46:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216454750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:01,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:01,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:46:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953609310] [2024-10-11 03:46:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:01,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:01,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:01,369 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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-10-11 03:46:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:01,516 INFO L93 Difference]: Finished difference Result 305 states and 386 transitions. [2024-10-11 03:46:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:46:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-11 03:46:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:01,520 INFO L225 Difference]: With dead ends: 305 [2024-10-11 03:46:01,520 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 03:46:01,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:46:01,522 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 579 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:01,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 126 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:46:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 03:46:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-11 03:46:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.294871794871795) internal successors, (202), 162 states have internal predecessors, (202), 0 states have call successors, (0), 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-10-11 03:46:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2024-10-11 03:46:01,541 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 46 [2024-10-11 03:46:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:01,541 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2024-10-11 03:46:01,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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-10-11 03:46:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2024-10-11 03:46:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:46:01,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:01,543 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] [2024-10-11 03:46:01,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:46:01,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:01,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash -577877594, now seen corresponding path program 1 times [2024-10-11 03:46:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:01,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726693344] [2024-10-11 03:46:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726693344] [2024-10-11 03:46:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726693344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:01,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:46:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176587844] [2024-10-11 03:46:01,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:01,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:01,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:01,811 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-11 03:46:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:01,933 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2024-10-11 03:46:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:46:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-11 03:46:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:01,935 INFO L225 Difference]: With dead ends: 286 [2024-10-11 03:46:01,935 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 03:46:01,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:46:01,940 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 537 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:01,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 125 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:46:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 03:46:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-11 03:46:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 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-10-11 03:46:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2024-10-11 03:46:01,958 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 47 [2024-10-11 03:46:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:01,958 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2024-10-11 03:46:01,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-11 03:46:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2024-10-11 03:46:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:46:01,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:01,960 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] [2024-10-11 03:46:01,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:46:01,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash -990553041, now seen corresponding path program 1 times [2024-10-11 03:46:01,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:01,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134190417] [2024-10-11 03:46:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:02,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:02,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134190417] [2024-10-11 03:46:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134190417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:02,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:02,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:46:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264963962] [2024-10-11 03:46:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:02,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:46:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:02,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:46:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:46:02,325 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-11 03:46:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:02,761 INFO L93 Difference]: Finished difference Result 242 states and 303 transitions. [2024-10-11 03:46:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:46:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-11 03:46:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:02,763 INFO L225 Difference]: With dead ends: 242 [2024-10-11 03:46:02,763 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 03:46:02,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:46:02,765 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 584 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:02,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 618 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:46:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 03:46:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 155. [2024-10-11 03:46:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 0 states have call successors, (0), 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-10-11 03:46:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 191 transitions. [2024-10-11 03:46:02,779 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 191 transitions. Word has length 48 [2024-10-11 03:46:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:02,779 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 191 transitions. [2024-10-11 03:46:02,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-11 03:46:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 191 transitions. [2024-10-11 03:46:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:46:02,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:02,785 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] [2024-10-11 03:46:02,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:46:02,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:02,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 921644061, now seen corresponding path program 1 times [2024-10-11 03:46:02,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:02,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401443829] [2024-10-11 03:46:02,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:03,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401443829] [2024-10-11 03:46:03,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401443829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:03,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:03,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:46:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608307969] [2024-10-11 03:46:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:03,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:46:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:03,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:46:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:46:03,101 INFO L87 Difference]: Start difference. First operand 155 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-11 03:46:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:03,506 INFO L93 Difference]: Finished difference Result 301 states and 387 transitions. [2024-10-11 03:46:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:46:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-11 03:46:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:03,508 INFO L225 Difference]: With dead ends: 301 [2024-10-11 03:46:03,508 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 03:46:03,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:46:03,510 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 580 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:03,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 629 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:46:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 03:46:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 155. [2024-10-11 03:46:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 0 states have call successors, (0), 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-10-11 03:46:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2024-10-11 03:46:03,516 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 48 [2024-10-11 03:46:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:03,516 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2024-10-11 03:46:03,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-11 03:46:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2024-10-11 03:46:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:46:03,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:03,518 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] [2024-10-11 03:46:03,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:46:03,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:03,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:03,519 INFO L85 PathProgramCache]: Analyzing trace with hash -528561187, now seen corresponding path program 1 times [2024-10-11 03:46:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576472068] [2024-10-11 03:46:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:03,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576472068] [2024-10-11 03:46:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576472068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:03,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:46:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680374663] [2024-10-11 03:46:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:46:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:46:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:46:03,774 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-11 03:46:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:04,075 INFO L93 Difference]: Finished difference Result 310 states and 390 transitions. [2024-10-11 03:46:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:46:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-11 03:46:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:04,077 INFO L225 Difference]: With dead ends: 310 [2024-10-11 03:46:04,077 INFO L226 Difference]: Without dead ends: 227 [2024-10-11 03:46:04,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:46:04,078 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 522 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:04,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 515 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-11 03:46:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 155. [2024-10-11 03:46:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 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-10-11 03:46:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2024-10-11 03:46:04,083 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 48 [2024-10-11 03:46:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:04,083 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2024-10-11 03:46:04,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-11 03:46:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2024-10-11 03:46:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:46:04,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:04,084 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] [2024-10-11 03:46:04,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:46:04,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:04,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1923049146, now seen corresponding path program 1 times [2024-10-11 03:46:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821157390] [2024-10-11 03:46:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:04,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821157390] [2024-10-11 03:46:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821157390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:04,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:04,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:46:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418803038] [2024-10-11 03:46:04,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:04,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:46:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:04,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:46:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:46:04,770 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:05,532 INFO L93 Difference]: Finished difference Result 365 states and 462 transitions. [2024-10-11 03:46:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:46:05,532 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-11 03:46:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:05,535 INFO L225 Difference]: With dead ends: 365 [2024-10-11 03:46:05,536 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 03:46:05,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:46:05,537 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1072 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:05,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1628 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:46:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 03:46:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 151. [2024-10-11 03:46:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 150 states have internal predecessors, (185), 0 states have call successors, (0), 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-10-11 03:46:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 185 transitions. [2024-10-11 03:46:05,545 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 185 transitions. Word has length 50 [2024-10-11 03:46:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:05,545 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 185 transitions. [2024-10-11 03:46:05,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2024-10-11 03:46:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:46:05,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:05,550 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] [2024-10-11 03:46:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:46:05,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash -297239348, now seen corresponding path program 1 times [2024-10-11 03:46:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896108972] [2024-10-11 03:46:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:06,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896108972] [2024-10-11 03:46:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896108972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:06,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:06,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 03:46:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779300981] [2024-10-11 03:46:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:06,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:46:06,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:06,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:46:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:46:06,498 INFO L87 Difference]: Start difference. First operand 151 states and 185 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:07,802 INFO L93 Difference]: Finished difference Result 368 states and 473 transitions. [2024-10-11 03:46:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:46:07,803 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-11 03:46:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:07,804 INFO L225 Difference]: With dead ends: 368 [2024-10-11 03:46:07,804 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 03:46:07,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:46:07,806 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1005 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:07,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 2231 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:46:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 03:46:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 157. [2024-10-11 03:46:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.2781456953642385) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 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-10-11 03:46:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2024-10-11 03:46:07,816 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 50 [2024-10-11 03:46:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:07,816 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2024-10-11 03:46:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2024-10-11 03:46:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:46:07,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:07,818 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] [2024-10-11 03:46:07,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:46:07,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:07,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2077756496, now seen corresponding path program 1 times [2024-10-11 03:46:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347497098] [2024-10-11 03:46:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:08,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347497098] [2024-10-11 03:46:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347497098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:08,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:08,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 03:46:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525331856] [2024-10-11 03:46:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:08,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:46:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:46:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:46:08,692 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:10,017 INFO L93 Difference]: Finished difference Result 317 states and 397 transitions. [2024-10-11 03:46:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:46:10,017 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-11 03:46:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:10,018 INFO L225 Difference]: With dead ends: 317 [2024-10-11 03:46:10,018 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 03:46:10,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:46:10,020 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1414 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:10,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 2248 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:46:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 03:46:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 157. [2024-10-11 03:46:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.271523178807947) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 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-10-11 03:46:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2024-10-11 03:46:10,024 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 50 [2024-10-11 03:46:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:10,025 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2024-10-11 03:46:10,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2024-10-11 03:46:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:46:10,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:10,025 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] [2024-10-11 03:46:10,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:46:10,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:10,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1544535321, now seen corresponding path program 1 times [2024-10-11 03:46:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:10,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907776024] [2024-10-11 03:46:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:10,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:10,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907776024] [2024-10-11 03:46:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907776024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:10,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:46:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440735607] [2024-10-11 03:46:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:46:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:46:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:46:10,399 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:10,769 INFO L93 Difference]: Finished difference Result 280 states and 363 transitions. [2024-10-11 03:46:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:46:10,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-11 03:46:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:10,771 INFO L225 Difference]: With dead ends: 280 [2024-10-11 03:46:10,771 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 03:46:10,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:46:10,772 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 318 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:10,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1516 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 03:46:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 146. [2024-10-11 03:46:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 145 states have internal predecessors, (180), 0 states have call successors, (0), 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-10-11 03:46:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-10-11 03:46:10,778 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 50 [2024-10-11 03:46:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-10-11 03:46:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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-10-11 03:46:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-10-11 03:46:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:46:10,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:10,779 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] [2024-10-11 03:46:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:46:10,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 200492003, now seen corresponding path program 1 times [2024-10-11 03:46:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549551072] [2024-10-11 03:46:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549551072] [2024-10-11 03:46:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549551072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:46:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858388757] [2024-10-11 03:46:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:46:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:46:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:46:10,995 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:11,330 INFO L93 Difference]: Finished difference Result 225 states and 280 transitions. [2024-10-11 03:46:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:46:11,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 03:46:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:11,332 INFO L225 Difference]: With dead ends: 225 [2024-10-11 03:46:11,333 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 03:46:11,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:46:11,334 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 519 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:11,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 601 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 03:46:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 146. [2024-10-11 03:46:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 145 states have internal predecessors, (179), 0 states have call successors, (0), 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-10-11 03:46:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2024-10-11 03:46:11,338 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 51 [2024-10-11 03:46:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:11,338 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2024-10-11 03:46:11,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2024-10-11 03:46:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:46:11,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:11,339 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] [2024-10-11 03:46:11,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:46:11,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:11,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -336264989, now seen corresponding path program 1 times [2024-10-11 03:46:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114863259] [2024-10-11 03:46:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:11,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:11,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114863259] [2024-10-11 03:46:11,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114863259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:11,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:11,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:46:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810306722] [2024-10-11 03:46:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:11,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:46:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:11,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:46:11,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:46:11,623 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:12,186 INFO L93 Difference]: Finished difference Result 323 states and 419 transitions. [2024-10-11 03:46:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:46:12,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 03:46:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:12,188 INFO L225 Difference]: With dead ends: 323 [2024-10-11 03:46:12,188 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 03:46:12,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:46:12,189 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 724 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:12,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 808 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:46:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 03:46:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 146. [2024-10-11 03:46:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 145 states have internal predecessors, (178), 0 states have call successors, (0), 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-10-11 03:46:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2024-10-11 03:46:12,194 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 51 [2024-10-11 03:46:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:12,195 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2024-10-11 03:46:12,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2024-10-11 03:46:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:46:12,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:12,196 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] [2024-10-11 03:46:12,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:46:12,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 91025507, now seen corresponding path program 1 times [2024-10-11 03:46:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891915717] [2024-10-11 03:46:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891915717] [2024-10-11 03:46:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891915717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:46:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020952266] [2024-10-11 03:46:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:46:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:46:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:46:12,497 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:13,171 INFO L93 Difference]: Finished difference Result 345 states and 452 transitions. [2024-10-11 03:46:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:46:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 03:46:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:13,173 INFO L225 Difference]: With dead ends: 345 [2024-10-11 03:46:13,173 INFO L226 Difference]: Without dead ends: 338 [2024-10-11 03:46:13,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:46:13,174 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1441 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:13,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 661 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:46:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-11 03:46:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 146. [2024-10-11 03:46:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 145 states have internal predecessors, (177), 0 states have call successors, (0), 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-10-11 03:46:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2024-10-11 03:46:13,181 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 51 [2024-10-11 03:46:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:13,181 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2024-10-11 03:46:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2024-10-11 03:46:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:46:13,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:13,182 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] [2024-10-11 03:46:13,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:46:13,182 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:13,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash -285368673, now seen corresponding path program 1 times [2024-10-11 03:46:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484423922] [2024-10-11 03:46:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484423922] [2024-10-11 03:46:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484423922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 03:46:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045808000] [2024-10-11 03:46:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:13,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:46:13,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:13,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:46:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:46:13,790 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:14,525 INFO L93 Difference]: Finished difference Result 339 states and 438 transitions. [2024-10-11 03:46:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:46:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 03:46:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:14,527 INFO L225 Difference]: With dead ends: 339 [2024-10-11 03:46:14,527 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 03:46:14,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:46:14,528 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1049 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:14,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1976 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:46:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 03:46:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 140. [2024-10-11 03:46:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 136 states have (on average 1.2426470588235294) internal successors, (169), 139 states have internal predecessors, (169), 0 states have call successors, (0), 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-10-11 03:46:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2024-10-11 03:46:14,533 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 51 [2024-10-11 03:46:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2024-10-11 03:46:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-11 03:46:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2024-10-11 03:46:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:46:14,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:14,534 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] [2024-10-11 03:46:14,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:46:14,534 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:14,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:14,535 INFO L85 PathProgramCache]: Analyzing trace with hash 459016432, now seen corresponding path program 1 times [2024-10-11 03:46:14,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:14,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417693398] [2024-10-11 03:46:14,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:14,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:14,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417693398] [2024-10-11 03:46:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417693398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:14,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:14,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:46:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096933239] [2024-10-11 03:46:14,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:14,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:46:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:14,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:46:14,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:46:14,711 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-11 03:46:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:15,082 INFO L93 Difference]: Finished difference Result 221 states and 272 transitions. [2024-10-11 03:46:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:46:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-11 03:46:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:15,083 INFO L225 Difference]: With dead ends: 221 [2024-10-11 03:46:15,083 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 03:46:15,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:46:15,084 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 498 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:15,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 644 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 03:46:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 136. [2024-10-11 03:46:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 135 states have internal predecessors, (164), 0 states have call successors, (0), 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-10-11 03:46:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 164 transitions. [2024-10-11 03:46:15,090 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 164 transitions. Word has length 52 [2024-10-11 03:46:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:15,091 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 164 transitions. [2024-10-11 03:46:15,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-11 03:46:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2024-10-11 03:46:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:46:15,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:15,092 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] [2024-10-11 03:46:15,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:46:15,092 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash 815340979, now seen corresponding path program 1 times [2024-10-11 03:46:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:15,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476014446] [2024-10-11 03:46:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:15,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:15,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476014446] [2024-10-11 03:46:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476014446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:15,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:46:15,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331574950] [2024-10-11 03:46:15,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:15,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:46:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:46:15,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:46:15,755 INFO L87 Difference]: Start difference. First operand 136 states and 164 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-11 03:46:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:16,846 INFO L93 Difference]: Finished difference Result 366 states and 460 transitions. [2024-10-11 03:46:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:46:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-11 03:46:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:16,849 INFO L225 Difference]: With dead ends: 366 [2024-10-11 03:46:16,849 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 03:46:16,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:46:16,850 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1062 mSDsluCounter, 2989 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:16,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 3301 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:46:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 03:46:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 145. [2024-10-11 03:46:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 144 states have internal predecessors, (175), 0 states have call successors, (0), 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-10-11 03:46:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 175 transitions. [2024-10-11 03:46:16,855 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 175 transitions. Word has length 53 [2024-10-11 03:46:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:16,855 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 175 transitions. [2024-10-11 03:46:16,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-11 03:46:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 175 transitions. [2024-10-11 03:46:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:46:16,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:16,858 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] [2024-10-11 03:46:16,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:46:16,859 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1737446413, now seen corresponding path program 1 times [2024-10-11 03:46:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637241276] [2024-10-11 03:46:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:17,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:17,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637241276] [2024-10-11 03:46:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637241276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:17,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:46:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27854828] [2024-10-11 03:46:17,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:17,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:46:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:17,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:46:17,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:46:17,416 INFO L87 Difference]: Start difference. First operand 145 states and 175 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-11 03:46:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:18,232 INFO L93 Difference]: Finished difference Result 370 states and 466 transitions. [2024-10-11 03:46:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:46:18,233 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-11 03:46:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:18,234 INFO L225 Difference]: With dead ends: 370 [2024-10-11 03:46:18,234 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 03:46:18,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:46:18,235 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 805 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:18,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2482 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:46:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 03:46:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 151. [2024-10-11 03:46:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.2448979591836735) internal successors, (183), 150 states have internal predecessors, (183), 0 states have call successors, (0), 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-10-11 03:46:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 183 transitions. [2024-10-11 03:46:18,240 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 183 transitions. Word has length 53 [2024-10-11 03:46:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 183 transitions. [2024-10-11 03:46:18,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-11 03:46:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 183 transitions. [2024-10-11 03:46:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:46:18,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:18,241 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] [2024-10-11 03:46:18,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:46:18,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1302743949, now seen corresponding path program 1 times [2024-10-11 03:46:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268367001] [2024-10-11 03:46:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:18,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:18,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268367001] [2024-10-11 03:46:18,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268367001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:18,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:18,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:46:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373992404] [2024-10-11 03:46:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:18,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:46:18,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:18,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:46:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:46:18,779 INFO L87 Difference]: Start difference. First operand 151 states and 183 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-11 03:46:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:19,632 INFO L93 Difference]: Finished difference Result 372 states and 467 transitions. [2024-10-11 03:46:19,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:46:19,633 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-11 03:46:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:19,634 INFO L225 Difference]: With dead ends: 372 [2024-10-11 03:46:19,634 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 03:46:19,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:46:19,635 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1212 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:19,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 2742 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:46:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 03:46:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 156. [2024-10-11 03:46:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 152 states have (on average 1.236842105263158) internal successors, (188), 155 states have internal predecessors, (188), 0 states have call successors, (0), 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-10-11 03:46:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 188 transitions. [2024-10-11 03:46:19,640 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 188 transitions. Word has length 53 [2024-10-11 03:46:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 188 transitions. [2024-10-11 03:46:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-11 03:46:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 188 transitions. [2024-10-11 03:46:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:46:19,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:19,641 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] [2024-10-11 03:46:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:46:19,641 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:19,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1478570090, now seen corresponding path program 1 times [2024-10-11 03:46:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304510780] [2024-10-11 03:46:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:20,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304510780] [2024-10-11 03:46:20,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304510780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:20,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:20,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:46:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432797008] [2024-10-11 03:46:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:20,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:46:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:46:20,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:46:20,032 INFO L87 Difference]: Start difference. First operand 156 states and 188 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-11 03:46:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:20,378 INFO L93 Difference]: Finished difference Result 287 states and 361 transitions. [2024-10-11 03:46:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:46:20,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-11 03:46:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:20,379 INFO L225 Difference]: With dead ends: 287 [2024-10-11 03:46:20,379 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 03:46:20,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:46:20,380 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 637 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:20,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1265 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 03:46:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 144. [2024-10-11 03:46:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 143 states have internal predecessors, (174), 0 states have call successors, (0), 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-10-11 03:46:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2024-10-11 03:46:20,384 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 54 [2024-10-11 03:46:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:20,384 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2024-10-11 03:46:20,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-11 03:46:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2024-10-11 03:46:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:46:20,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:20,385 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] [2024-10-11 03:46:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:46:20,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:20,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 497385650, now seen corresponding path program 1 times [2024-10-11 03:46:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108063403] [2024-10-11 03:46:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108063403] [2024-10-11 03:46:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108063403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:46:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479202751] [2024-10-11 03:46:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:46:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:46:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:46:20,737 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-11 03:46:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:21,205 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2024-10-11 03:46:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:46:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-11 03:46:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:21,206 INFO L225 Difference]: With dead ends: 200 [2024-10-11 03:46:21,206 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 03:46:21,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:46:21,208 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 619 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:21,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1198 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 03:46:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 123. [2024-10-11 03:46:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 122 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2024-10-11 03:46:21,214 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 54 [2024-10-11 03:46:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:21,215 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2024-10-11 03:46:21,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-11 03:46:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2024-10-11 03:46:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:46:21,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:21,215 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] [2024-10-11 03:46:21,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:46:21,215 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:21,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash -738737596, now seen corresponding path program 1 times [2024-10-11 03:46:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:21,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350605816] [2024-10-11 03:46:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350605816] [2024-10-11 03:46:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350605816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:46:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071473126] [2024-10-11 03:46:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:46:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:46:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:46:21,525 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-11 03:46:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:21,795 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2024-10-11 03:46:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:46:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-11 03:46:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:21,797 INFO L225 Difference]: With dead ends: 173 [2024-10-11 03:46:21,797 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 03:46:21,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:46:21,798 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 548 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:21,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 528 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:46:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 03:46:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 100. [2024-10-11 03:46:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2024-10-11 03:46:21,803 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 54 [2024-10-11 03:46:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:21,803 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2024-10-11 03:46:21,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 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-10-11 03:46:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2024-10-11 03:46:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:46:21,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:21,804 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] [2024-10-11 03:46:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:46:21,804 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -546984540, now seen corresponding path program 1 times [2024-10-11 03:46:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975992927] [2024-10-11 03:46:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:21,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975992927] [2024-10-11 03:46:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975992927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:46:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880103187] [2024-10-11 03:46:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:21,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:21,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:21,884 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-11 03:46:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:21,953 INFO L93 Difference]: Finished difference Result 358 states and 509 transitions. [2024-10-11 03:46:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:46:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-11 03:46:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:21,955 INFO L225 Difference]: With dead ends: 358 [2024-10-11 03:46:21,955 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 03:46:21,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:46:21,956 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 530 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:21,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 457 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 03:46:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 141. [2024-10-11 03:46:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3285714285714285) internal successors, (186), 140 states have internal predecessors, (186), 0 states have call successors, (0), 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-10-11 03:46:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2024-10-11 03:46:21,962 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 186 transitions. Word has length 71 [2024-10-11 03:46:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:21,963 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 186 transitions. [2024-10-11 03:46:21,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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-10-11 03:46:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2024-10-11 03:46:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:46:21,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:21,964 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] [2024-10-11 03:46:21,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:46:21,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:21,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2078520713, now seen corresponding path program 1 times [2024-10-11 03:46:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:21,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326133157] [2024-10-11 03:46:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:21,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326133157] [2024-10-11 03:46:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326133157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:22,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:46:22,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651749460] [2024-10-11 03:46:22,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:22,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:22,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:22,050 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:22,111 INFO L93 Difference]: Finished difference Result 436 states and 623 transitions. [2024-10-11 03:46:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:46:22,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:46:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:22,113 INFO L225 Difference]: With dead ends: 436 [2024-10-11 03:46:22,113 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 03:46:22,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:46:22,114 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 292 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:22,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 414 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 03:46:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 223. [2024-10-11 03:46:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.3918918918918919) internal successors, (309), 222 states have internal predecessors, (309), 0 states have call successors, (0), 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-10-11 03:46:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 309 transitions. [2024-10-11 03:46:22,122 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 309 transitions. Word has length 73 [2024-10-11 03:46:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:22,122 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 309 transitions. [2024-10-11 03:46:22,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 309 transitions. [2024-10-11 03:46:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:46:22,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:22,123 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] [2024-10-11 03:46:22,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:46:22,123 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2099864602, now seen corresponding path program 1 times [2024-10-11 03:46:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685525346] [2024-10-11 03:46:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:22,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:22,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685525346] [2024-10-11 03:46:22,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685525346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:22,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:22,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:46:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438693707] [2024-10-11 03:46:22,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:22,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:22,243 INFO L87 Difference]: Start difference. First operand 223 states and 309 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:22,291 INFO L93 Difference]: Finished difference Result 391 states and 558 transitions. [2024-10-11 03:46:22,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:46:22,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:46:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:22,292 INFO L225 Difference]: With dead ends: 391 [2024-10-11 03:46:22,292 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 03:46:22,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:46:22,294 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 157 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:22,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 235 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 03:46:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-11 03:46:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.382882882882883) internal successors, (307), 222 states have internal predecessors, (307), 0 states have call successors, (0), 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-10-11 03:46:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 307 transitions. [2024-10-11 03:46:22,299 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 307 transitions. Word has length 73 [2024-10-11 03:46:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:22,299 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 307 transitions. [2024-10-11 03:46:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 307 transitions. [2024-10-11 03:46:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:46:22,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:22,300 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] [2024-10-11 03:46:22,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:46:22,300 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:22,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1455362373, now seen corresponding path program 1 times [2024-10-11 03:46:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:22,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102437044] [2024-10-11 03:46:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:22,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102437044] [2024-10-11 03:46:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102437044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052169247] [2024-10-11 03:46:22,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:22,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:22,344 INFO L87 Difference]: Start difference. First operand 223 states and 307 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:22,369 INFO L93 Difference]: Finished difference Result 529 states and 755 transitions. [2024-10-11 03:46:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:22,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:46:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:22,371 INFO L225 Difference]: With dead ends: 529 [2024-10-11 03:46:22,371 INFO L226 Difference]: Without dead ends: 363 [2024-10-11 03:46:22,371 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-10-11 03:46:22,371 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:22,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 193 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-11 03:46:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 357. [2024-10-11 03:46:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.3876404494382022) internal successors, (494), 356 states have internal predecessors, (494), 0 states have call successors, (0), 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-10-11 03:46:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2024-10-11 03:46:22,383 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 73 [2024-10-11 03:46:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:22,383 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2024-10-11 03:46:22,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2024-10-11 03:46:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:46:22,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:22,384 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] [2024-10-11 03:46:22,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:46:22,385 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:22,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1485181309, now seen corresponding path program 1 times [2024-10-11 03:46:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598018168] [2024-10-11 03:46:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598018168] [2024-10-11 03:46:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598018168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:46:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538225574] [2024-10-11 03:46:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:22,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:22,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:22,475 INFO L87 Difference]: Start difference. First operand 357 states and 494 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:22,525 INFO L93 Difference]: Finished difference Result 887 states and 1256 transitions. [2024-10-11 03:46:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:46:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:46:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:22,528 INFO L225 Difference]: With dead ends: 887 [2024-10-11 03:46:22,528 INFO L226 Difference]: Without dead ends: 736 [2024-10-11 03:46:22,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:46:22,529 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 287 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:22,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 451 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-11 03:46:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 581. [2024-10-11 03:46:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4068965517241379) internal successors, (816), 580 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-10-11 03:46:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 816 transitions. [2024-10-11 03:46:22,543 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 816 transitions. Word has length 73 [2024-10-11 03:46:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 816 transitions. [2024-10-11 03:46:22,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-10-11 03:46:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 816 transitions. [2024-10-11 03:46:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:46:22,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:22,544 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] [2024-10-11 03:46:22,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:46:22,545 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:22,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash -730460828, now seen corresponding path program 1 times [2024-10-11 03:46:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003451539] [2024-10-11 03:46:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:22,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:22,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003451539] [2024-10-11 03:46:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003451539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968524952] [2024-10-11 03:46:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:22,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:22,611 INFO L87 Difference]: Start difference. First operand 581 states and 816 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-10-11 03:46:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:22,627 INFO L93 Difference]: Finished difference Result 1573 states and 2228 transitions. [2024-10-11 03:46:22,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:22,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-11 03:46:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:22,630 INFO L225 Difference]: With dead ends: 1573 [2024-10-11 03:46:22,630 INFO L226 Difference]: Without dead ends: 1049 [2024-10-11 03:46:22,631 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-10-11 03:46:22,632 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 54 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:22,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-10-11 03:46:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 991. [2024-10-11 03:46:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.402020202020202) internal successors, (1388), 990 states have internal predecessors, (1388), 0 states have call successors, (0), 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-10-11 03:46:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1388 transitions. [2024-10-11 03:46:22,649 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1388 transitions. Word has length 74 [2024-10-11 03:46:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:22,650 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1388 transitions. [2024-10-11 03:46:22,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-10-11 03:46:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1388 transitions. [2024-10-11 03:46:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:46:22,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:22,651 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] [2024-10-11 03:46:22,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:46:22,651 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:22,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1645152135, now seen corresponding path program 1 times [2024-10-11 03:46:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374194273] [2024-10-11 03:46:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374194273] [2024-10-11 03:46:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374194273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:22,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:22,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938713713] [2024-10-11 03:46:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:22,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:22,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:22,723 INFO L87 Difference]: Start difference. First operand 991 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-10-11 03:46:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:22,743 INFO L93 Difference]: Finished difference Result 2747 states and 3846 transitions. [2024-10-11 03:46:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:22,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-11 03:46:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:22,749 INFO L225 Difference]: With dead ends: 2747 [2024-10-11 03:46:22,749 INFO L226 Difference]: Without dead ends: 1813 [2024-10-11 03:46:22,750 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-10-11 03:46:22,751 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:22,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-10-11 03:46:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1699. [2024-10-11 03:46:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.3839811542991756) internal successors, (2350), 1698 states have internal predecessors, (2350), 0 states have call successors, (0), 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-10-11 03:46:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2350 transitions. [2024-10-11 03:46:22,777 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2350 transitions. Word has length 75 [2024-10-11 03:46:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:22,778 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2350 transitions. [2024-10-11 03:46:22,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-10-11 03:46:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2350 transitions. [2024-10-11 03:46:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:46:22,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:22,779 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] [2024-10-11 03:46:22,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:46:22,779 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:22,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash -92740011, now seen corresponding path program 1 times [2024-10-11 03:46:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512487224] [2024-10-11 03:46:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512487224] [2024-10-11 03:46:22,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512487224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:22,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:22,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:46:22,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949274593] [2024-10-11 03:46:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:22,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:46:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:46:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:46:22,993 INFO L87 Difference]: Start difference. First operand 1699 states and 2350 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-11 03:46:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:23,027 INFO L93 Difference]: Finished difference Result 1773 states and 2447 transitions. [2024-10-11 03:46:23,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:46:23,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-11 03:46:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:23,033 INFO L225 Difference]: With dead ends: 1773 [2024-10-11 03:46:23,033 INFO L226 Difference]: Without dead ends: 1771 [2024-10-11 03:46:23,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:46:23,035 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:23,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 592 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-10-11 03:46:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2024-10-11 03:46:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1770 states have (on average 1.3593220338983052) internal successors, (2406), 1770 states have internal predecessors, (2406), 0 states have call successors, (0), 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-10-11 03:46:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2406 transitions. [2024-10-11 03:46:23,066 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2406 transitions. Word has length 76 [2024-10-11 03:46:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:23,067 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2406 transitions. [2024-10-11 03:46:23,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-11 03:46:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2406 transitions. [2024-10-11 03:46:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:46:23,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:23,068 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] [2024-10-11 03:46:23,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:46:23,068 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:23,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:23,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1972991000, now seen corresponding path program 1 times [2024-10-11 03:46:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:23,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957091390] [2024-10-11 03:46:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957091390] [2024-10-11 03:46:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957091390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:23,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:23,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:46:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893528514] [2024-10-11 03:46:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:46:23,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:23,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:46:23,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:46:23,154 INFO L87 Difference]: Start difference. First operand 1771 states and 2406 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-11 03:46:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:23,242 INFO L93 Difference]: Finished difference Result 3255 states and 4450 transitions. [2024-10-11 03:46:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:46:23,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-11 03:46:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:23,254 INFO L225 Difference]: With dead ends: 3255 [2024-10-11 03:46:23,255 INFO L226 Difference]: Without dead ends: 2761 [2024-10-11 03:46:23,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:46:23,256 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 286 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:23,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 415 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:46:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2024-10-11 03:46:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2263. [2024-10-11 03:46:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 2262 states have (on average 1.3607427055702919) internal successors, (3078), 2262 states have internal predecessors, (3078), 0 states have call successors, (0), 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-10-11 03:46:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3078 transitions. [2024-10-11 03:46:23,291 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3078 transitions. Word has length 76 [2024-10-11 03:46:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:23,291 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 3078 transitions. [2024-10-11 03:46:23,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-11 03:46:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3078 transitions. [2024-10-11 03:46:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:46:23,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:23,292 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] [2024-10-11 03:46:23,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:46:23,293 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:23,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1730490915, now seen corresponding path program 1 times [2024-10-11 03:46:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518340271] [2024-10-11 03:46:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518340271] [2024-10-11 03:46:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518340271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:23,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938996007] [2024-10-11 03:46:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:23,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:23,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:23,361 INFO L87 Difference]: Start difference. First operand 2263 states and 3078 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-10-11 03:46:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:23,387 INFO L93 Difference]: Finished difference Result 5883 states and 7992 transitions. [2024-10-11 03:46:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:23,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-11 03:46:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:23,398 INFO L225 Difference]: With dead ends: 5883 [2024-10-11 03:46:23,398 INFO L226 Difference]: Without dead ends: 3677 [2024-10-11 03:46:23,401 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-10-11 03:46:23,402 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 58 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:23,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 259 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2024-10-11 03:46:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3387. [2024-10-11 03:46:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.3414057885410513) internal successors, (4542), 3386 states have internal predecessors, (4542), 0 states have call successors, (0), 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-10-11 03:46:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4542 transitions. [2024-10-11 03:46:23,460 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4542 transitions. Word has length 77 [2024-10-11 03:46:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:23,460 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4542 transitions. [2024-10-11 03:46:23,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-10-11 03:46:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4542 transitions. [2024-10-11 03:46:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:46:23,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:23,462 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:46:23,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:46:23,463 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:23,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 350821364, now seen corresponding path program 1 times [2024-10-11 03:46:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065786280] [2024-10-11 03:46:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065786280] [2024-10-11 03:46:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065786280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:23,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418240304] [2024-10-11 03:46:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:23,552 INFO L87 Difference]: Start difference. First operand 3387 states and 4542 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:23,579 INFO L93 Difference]: Finished difference Result 6719 states and 9024 transitions. [2024-10-11 03:46:23,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:46:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:23,589 INFO L225 Difference]: With dead ends: 6719 [2024-10-11 03:46:23,589 INFO L226 Difference]: Without dead ends: 3389 [2024-10-11 03:46:23,593 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-10-11 03:46:23,594 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 56 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:23,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 236 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2024-10-11 03:46:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3387. [2024-10-11 03:46:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.3201417601890135) internal successors, (4470), 3386 states have internal predecessors, (4470), 0 states have call successors, (0), 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-10-11 03:46:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4470 transitions. [2024-10-11 03:46:23,643 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4470 transitions. Word has length 98 [2024-10-11 03:46:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:23,643 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4470 transitions. [2024-10-11 03:46:23,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4470 transitions. [2024-10-11 03:46:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:46:23,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:23,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:46:23,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:46:23,645 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:23,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash -147664979, now seen corresponding path program 1 times [2024-10-11 03:46:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:23,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089403916] [2024-10-11 03:46:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:24,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089403916] [2024-10-11 03:46:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089403916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56300501] [2024-10-11 03:46:24,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:24,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:24,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:46:24,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:46:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:24,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:46:24,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:25,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56300501] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:26,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-11 03:46:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677380676] [2024-10-11 03:46:26,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 03:46:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 03:46:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:46:26,163 INFO L87 Difference]: Start difference. First operand 3387 states and 4470 transitions. Second operand has 27 states, 27 states have (on average 8.74074074074074) internal successors, (236), 26 states have internal predecessors, (236), 0 states have call successors, (0), 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-10-11 03:46:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:30,164 INFO L93 Difference]: Finished difference Result 27491 states and 36124 transitions. [2024-10-11 03:46:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-10-11 03:46:30,164 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.74074074074074) internal successors, (236), 26 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:46:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:30,213 INFO L225 Difference]: With dead ends: 27491 [2024-10-11 03:46:30,213 INFO L226 Difference]: Without dead ends: 24161 [2024-10-11 03:46:30,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4538 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2109, Invalid=12653, Unknown=0, NotChecked=0, Total=14762 [2024-10-11 03:46:30,229 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1967 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1967 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:30,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1967 Valid, 2218 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:46:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24161 states. [2024-10-11 03:46:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24161 to 17168. [2024-10-11 03:46:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17168 states, 17167 states have (on average 1.3102464029824663) internal successors, (22493), 17167 states have internal predecessors, (22493), 0 states have call successors, (0), 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-10-11 03:46:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17168 states to 17168 states and 22493 transitions. [2024-10-11 03:46:30,622 INFO L78 Accepts]: Start accepts. Automaton has 17168 states and 22493 transitions. Word has length 98 [2024-10-11 03:46:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:30,622 INFO L471 AbstractCegarLoop]: Abstraction has 17168 states and 22493 transitions. [2024-10-11 03:46:30,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.74074074074074) internal successors, (236), 26 states have internal predecessors, (236), 0 states have call successors, (0), 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-10-11 03:46:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 17168 states and 22493 transitions. [2024-10-11 03:46:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:46:30,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:30,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:46:30,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:46:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 03:46:30,827 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1459589513, now seen corresponding path program 1 times [2024-10-11 03:46:30,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414894799] [2024-10-11 03:46:30,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:30,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:46:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414894799] [2024-10-11 03:46:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414894799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:46:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149043618] [2024-10-11 03:46:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:46:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:31,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:46:31,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:46:31,009 INFO L87 Difference]: Start difference. First operand 17168 states and 22493 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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-10-11 03:46:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:31,359 INFO L93 Difference]: Finished difference Result 51959 states and 67924 transitions. [2024-10-11 03:46:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:46:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 03:46:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:31,420 INFO L225 Difference]: With dead ends: 51959 [2024-10-11 03:46:31,420 INFO L226 Difference]: Without dead ends: 34862 [2024-10-11 03:46:31,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:46:31,448 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 370 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:31,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 475 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:31,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34862 states. [2024-10-11 03:46:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34862 to 17168. [2024-10-11 03:46:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17168 states, 17167 states have (on average 1.3101299003902838) internal successors, (22491), 17167 states have internal predecessors, (22491), 0 states have call successors, (0), 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-10-11 03:46:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17168 states to 17168 states and 22491 transitions. [2024-10-11 03:46:31,879 INFO L78 Accepts]: Start accepts. Automaton has 17168 states and 22491 transitions. Word has length 99 [2024-10-11 03:46:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:31,879 INFO L471 AbstractCegarLoop]: Abstraction has 17168 states and 22491 transitions. [2024-10-11 03:46:31,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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-10-11 03:46:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 17168 states and 22491 transitions. [2024-10-11 03:46:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:46:31,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:31,882 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:46:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:46:31,883 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:31,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash -929718155, now seen corresponding path program 1 times [2024-10-11 03:46:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064442524] [2024-10-11 03:46:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064442524] [2024-10-11 03:46:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064442524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478101887] [2024-10-11 03:46:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:32,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:46:32,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:46:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:32,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 03:46:32,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:33,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478101887] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:35,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 41 [2024-10-11 03:46:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084653340] [2024-10-11 03:46:35,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:35,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 03:46:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:35,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 03:46:35,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:46:35,269 INFO L87 Difference]: Start difference. First operand 17168 states and 22491 transitions. Second operand has 41 states, 41 states have (on average 6.7560975609756095) internal successors, (277), 41 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)