./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.1.ufo.BOUNDED-6.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.1.ufo.BOUNDED-6.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 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:44:50,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:44:50,597 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:44:50,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:44:50,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:44:50,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:44:50,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:44:50,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:44:50,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:44:50,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:44:50,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:44:50,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:44:50,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:44:50,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:44:50,640 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:44:50,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:44:50,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:44:50,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:44:50,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:44:50,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:44:50,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:44:50,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:44:50,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:44:50,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:44:50,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:44:50,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:44:50,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:44:50,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:44:50,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:44:50,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:44:50,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:44:50,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:44:50,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:44:50,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:44:50,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:44:50,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:44:50,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:44:50,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:44:50,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:44:50,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:44:50,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:44:50,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:44:50,654 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 -> 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 [2024-10-11 03:44:50,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:44:51,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:44:51,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:44:51,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:44:51,013 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:44:51,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:44:52,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:44:52,689 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:44:52,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:44:52,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de78f677c/13cbf4f7549649d48dd261ce4ca4e2ae/FLAG3d08a3ed3 [2024-10-11 03:44:52,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de78f677c/13cbf4f7549649d48dd261ce4ca4e2ae [2024-10-11 03:44:52,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:44:52,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:44:52,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:44:52,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:44:52,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:44:52,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:44:52" (1/1) ... [2024-10-11 03:44:52,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdc2b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:52, skipping insertion in model container [2024-10-11 03:44:52,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:44:52" (1/1) ... [2024-10-11 03:44:52,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:44:53,062 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2024-10-11 03:44:53,086 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2024-10-11 03:44:53,101 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2024-10-11 03:44:53,112 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2024-10-11 03:44:53,121 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2024-10-11 03:44:53,133 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2024-10-11 03:44:53,144 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2024-10-11 03:44:53,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:44:53,202 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:44:53,292 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2024-10-11 03:44:53,314 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2024-10-11 03:44:53,319 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2024-10-11 03:44:53,327 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2024-10-11 03:44:53,336 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2024-10-11 03:44:53,339 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2024-10-11 03:44:53,343 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.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2024-10-11 03:44:53,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:44:53,396 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:44:53,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53 WrapperNode [2024-10-11 03:44:53,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:44:53,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:44:53,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:44:53,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:44:53,404 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:44:53" (1/1) ... [2024-10-11 03:44:53,431 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:44:53" (1/1) ... [2024-10-11 03:44:53,495 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1106 [2024-10-11 03:44:53,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:44:53,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:44:53,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:44:53,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:44:53,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,561 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:44:53,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:44:53,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:44:53,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:44:53,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:44:53,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (1/1) ... [2024-10-11 03:44:53,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:44:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:44:53,667 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:44:53,673 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:44:53,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:44:53,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:44:53,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:44:53,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:44:53,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:44:53,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:44:54,877 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2024-10-11 03:44:54,877 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:44:54,928 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:44:54,928 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:44:54,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:44:54 BoogieIcfgContainer [2024-10-11 03:44:54,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:44:54,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:44:54,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:44:54,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:44:54,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:44:52" (1/3) ... [2024-10-11 03:44:54,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f97d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:44:54, skipping insertion in model container [2024-10-11 03:44:54,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:53" (2/3) ... [2024-10-11 03:44:54,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f97d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:44:54, skipping insertion in model container [2024-10-11 03:44:54,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:44:54" (3/3) ... [2024-10-11 03:44:54,942 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-11 03:44:54,961 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:44:54,962 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 03:44:55,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:44:55,043 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;@5da85c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:44:55,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 03:44:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 0 states have call successors, (0), 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:44:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 03:44:55,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:55,060 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:44:55,061 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:44:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1273195572, now seen corresponding path program 1 times [2024-10-11 03:44:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935555831] [2024-10-11 03:44:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:55,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:44:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935555831] [2024-10-11 03:44:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935555831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:55,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719957114] [2024-10-11 03:44:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:55,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:55,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:55,821 INFO L87 Difference]: Start difference. First operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 0 states have call successors, (0), 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.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:44:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:56,103 INFO L93 Difference]: Finished difference Result 334 states and 565 transitions. [2024-10-11 03:44:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:56,106 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:44:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:56,119 INFO L225 Difference]: With dead ends: 334 [2024-10-11 03:44:56,119 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 03:44:56,123 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:44:56,128 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 854 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:56,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:44:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 03:44:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-11 03:44:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 176 states have (on average 1.2727272727272727) internal successors, (224), 182 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:44:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2024-10-11 03:44:56,179 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 46 [2024-10-11 03:44:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:56,180 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2024-10-11 03:44:56,180 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:44:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2024-10-11 03:44:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:44:56,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:56,185 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:44:56,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:44:56,186 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:44:56,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1862883361, now seen corresponding path program 1 times [2024-10-11 03:44:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399221701] [2024-10-11 03:44:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:56,362 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:44:56,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399221701] [2024-10-11 03:44:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399221701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073658842] [2024-10-11 03:44:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:56,366 INFO L87 Difference]: Start difference. First operand 183 states and 224 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:44:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:56,558 INFO L93 Difference]: Finished difference Result 306 states and 385 transitions. [2024-10-11 03:44:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:56,559 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:44:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:56,561 INFO L225 Difference]: With dead ends: 306 [2024-10-11 03:44:56,561 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 03:44:56,562 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:44:56,565 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 576 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:56,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 131 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:44:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 03:44:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-11 03:44:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 160 states have (on average 1.28125) internal successors, (205), 166 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-10-11 03:44:56,581 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 47 [2024-10-11 03:44:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:56,581 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-10-11 03:44:56,582 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:44:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-10-11 03:44:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:44:56,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:56,583 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:44:56,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:44:56,584 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:44:56,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1456528685, now seen corresponding path program 1 times [2024-10-11 03:44:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463087164] [2024-10-11 03:44:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:56,753 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:44:56,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463087164] [2024-10-11 03:44:56,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463087164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:56,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:56,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:56,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573682644] [2024-10-11 03:44:56,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:56,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:56,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:56,759 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:44:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:56,940 INFO L93 Difference]: Finished difference Result 374 states and 476 transitions. [2024-10-11 03:44:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:56,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:44:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:56,945 INFO L225 Difference]: With dead ends: 374 [2024-10-11 03:44:56,946 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 03:44:56,947 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:44:56,948 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 768 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:56,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 187 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:44:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 03:44:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 216. [2024-10-11 03:44:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 0 states have call successors, (0), 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:44:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 280 transitions. [2024-10-11 03:44:56,972 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 280 transitions. Word has length 48 [2024-10-11 03:44:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:56,973 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 280 transitions. [2024-10-11 03:44:56,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:44:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 280 transitions. [2024-10-11 03:44:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:44:56,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:56,977 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] [2024-10-11 03:44:56,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:44:56,978 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:44:56,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:56,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1731915121, now seen corresponding path program 1 times [2024-10-11 03:44:56,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:56,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089354039] [2024-10-11 03:44:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:56,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:57,376 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:44:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089354039] [2024-10-11 03:44:57,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089354039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:57,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:44:57,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7632823] [2024-10-11 03:44:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:57,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:44:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:44:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:44:57,384 INFO L87 Difference]: Start difference. First operand 216 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:44:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:57,815 INFO L93 Difference]: Finished difference Result 359 states and 471 transitions. [2024-10-11 03:44:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:44:57,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-11 03:44:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:57,818 INFO L225 Difference]: With dead ends: 359 [2024-10-11 03:44:57,818 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 03:44:57,819 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:44:57,820 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 586 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:57,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 611 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:44:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 03:44:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 216. [2024-10-11 03:44:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 0 states have call successors, (0), 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:44:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2024-10-11 03:44:57,832 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 49 [2024-10-11 03:44:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2024-10-11 03:44:57,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:44:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2024-10-11 03:44:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:44:57,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:57,834 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] [2024-10-11 03:44:57,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:44:57,835 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:44:57,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash -650855073, now seen corresponding path program 1 times [2024-10-11 03:44:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061911329] [2024-10-11 03:44:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:58,159 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:44:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061911329] [2024-10-11 03:44:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061911329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:58,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:44:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488960879] [2024-10-11 03:44:58,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:58,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:44:58,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:58,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:44:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:44:58,167 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:44:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:58,570 INFO L93 Difference]: Finished difference Result 404 states and 537 transitions. [2024-10-11 03:44:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:44:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-11 03:44:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:58,575 INFO L225 Difference]: With dead ends: 404 [2024-10-11 03:44:58,575 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 03:44:58,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:44:58,577 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 800 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:58,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 481 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:44:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 03:44:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 216. [2024-10-11 03:44:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 215 states have internal predecessors, (278), 0 states have call successors, (0), 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:44:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2024-10-11 03:44:58,596 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 49 [2024-10-11 03:44:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:58,596 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2024-10-11 03:44:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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:44:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2024-10-11 03:44:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:44:58,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:58,597 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] [2024-10-11 03:44:58,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:44:58,598 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:44:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash 622927837, now seen corresponding path program 1 times [2024-10-11 03:44:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787186511] [2024-10-11 03:44:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:58,905 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:44:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787186511] [2024-10-11 03:44:58,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787186511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:58,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:58,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:44:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9025242] [2024-10-11 03:44:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:58,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:44:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:44:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:44:58,907 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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:44:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:59,238 INFO L93 Difference]: Finished difference Result 460 states and 609 transitions. [2024-10-11 03:44:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:44:59,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-11 03:44:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:59,246 INFO L225 Difference]: With dead ends: 460 [2024-10-11 03:44:59,246 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 03:44:59,247 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:44:59,249 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 524 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:59,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 509 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:44:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 03:44:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2024-10-11 03:44:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.325358851674641) internal successors, (277), 215 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) [2024-10-11 03:44:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 277 transitions. [2024-10-11 03:44:59,263 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 277 transitions. Word has length 49 [2024-10-11 03:44:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:59,263 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 277 transitions. [2024-10-11 03:44:59,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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:44:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 277 transitions. [2024-10-11 03:44:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:44:59,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:59,267 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:44:59,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:44:59,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:44:59,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash 359581070, now seen corresponding path program 1 times [2024-10-11 03:44:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:59,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769942819] [2024-10-11 03:44:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:59,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:59,910 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:44:59,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:59,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769942819] [2024-10-11 03:44:59,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769942819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:59,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:59,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:44:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88279561] [2024-10-11 03:44:59,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:59,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:44:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:44:59,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:44:59,913 INFO L87 Difference]: Start difference. First operand 216 states and 277 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:45:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:00,284 INFO L93 Difference]: Finished difference Result 406 states and 550 transitions. [2024-10-11 03:45:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:45:00,285 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:45:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:00,289 INFO L225 Difference]: With dead ends: 406 [2024-10-11 03:45:00,289 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 03:45:00,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:45:00,290 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 763 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:00,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 615 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 03:45:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 183. [2024-10-11 03:45:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.329608938547486) internal successors, (238), 182 states have internal predecessors, (238), 0 states have call successors, (0), 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:45:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 238 transitions. [2024-10-11 03:45:00,298 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 238 transitions. Word has length 51 [2024-10-11 03:45:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:00,299 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 238 transitions. [2024-10-11 03:45:00,299 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:45:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 238 transitions. [2024-10-11 03:45:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:45:00,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:00,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] [2024-10-11 03:45:00,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:45:00,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:00,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -83474213, now seen corresponding path program 1 times [2024-10-11 03:45:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800923888] [2024-10-11 03:45:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:00,921 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:45:00,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800923888] [2024-10-11 03:45:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800923888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:45:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784596144] [2024-10-11 03:45:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:45:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:45:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:45:00,924 INFO L87 Difference]: Start difference. First operand 183 states and 238 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 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:45:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:01,529 INFO L93 Difference]: Finished difference Result 503 states and 688 transitions. [2024-10-11 03:45:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:45:01,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 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:45:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:01,531 INFO L225 Difference]: With dead ends: 503 [2024-10-11 03:45:01,532 INFO L226 Difference]: Without dead ends: 499 [2024-10-11 03:45:01,532 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:45:01,533 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 903 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:01,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1041 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-11 03:45:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 179. [2024-10-11 03:45:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 176 states have (on average 1.3295454545454546) internal successors, (234), 178 states have internal predecessors, (234), 0 states have call successors, (0), 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:45:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2024-10-11 03:45:01,540 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 51 [2024-10-11 03:45:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:01,540 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2024-10-11 03:45:01,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 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:45:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2024-10-11 03:45:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:45:01,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:01,541 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:45:01,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:45:01,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:01,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1872189982, now seen corresponding path program 1 times [2024-10-11 03:45:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586395883] [2024-10-11 03:45:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:01,776 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:45:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:01,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586395883] [2024-10-11 03:45:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586395883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:01,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030161918] [2024-10-11 03:45:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:01,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:01,782 INFO L87 Difference]: Start difference. First operand 179 states and 234 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:45:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:02,082 INFO L93 Difference]: Finished difference Result 306 states and 407 transitions. [2024-10-11 03:45:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:45:02,083 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:45:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:02,084 INFO L225 Difference]: With dead ends: 306 [2024-10-11 03:45:02,085 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 03:45:02,085 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:45:02,086 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 438 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:02,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 467 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 03:45:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 179. [2024-10-11 03:45:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 176 states have (on average 1.3238636363636365) internal successors, (233), 178 states have internal predecessors, (233), 0 states have call successors, (0), 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:45:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2024-10-11 03:45:02,096 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 52 [2024-10-11 03:45:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:02,096 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2024-10-11 03:45:02,096 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:45:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2024-10-11 03:45:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:45:02,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:02,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:02,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:45:02,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:02,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -873153248, now seen corresponding path program 1 times [2024-10-11 03:45:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:02,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129006197] [2024-10-11 03:45:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:02,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:02,460 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:45:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129006197] [2024-10-11 03:45:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129006197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:02,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:02,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:45:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231416060] [2024-10-11 03:45:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:02,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:45:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:45:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:45:02,462 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 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:45:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:02,852 INFO L93 Difference]: Finished difference Result 330 states and 445 transitions. [2024-10-11 03:45:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:45:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 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:45:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:02,854 INFO L225 Difference]: With dead ends: 330 [2024-10-11 03:45:02,854 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 03:45:02,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:45:02,855 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 421 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:02,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 482 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 03:45:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2024-10-11 03:45:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 176 states have (on average 1.3125) internal successors, (231), 178 states have internal predecessors, (231), 0 states have call successors, (0), 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:45:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2024-10-11 03:45:02,860 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 52 [2024-10-11 03:45:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:02,861 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2024-10-11 03:45:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 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:45:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2024-10-11 03:45:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:45:02,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:02,862 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:45:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:45:02,862 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:45:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1832778738, now seen corresponding path program 1 times [2024-10-11 03:45:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:02,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372773044] [2024-10-11 03:45:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:03,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:45:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372773044] [2024-10-11 03:45:03,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372773044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:03,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:03,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:45:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257788581] [2024-10-11 03:45:03,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:03,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:45:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:03,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:45:03,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:03,753 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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:45:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:04,669 INFO L93 Difference]: Finished difference Result 307 states and 406 transitions. [2024-10-11 03:45:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:45:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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:45:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:04,671 INFO L225 Difference]: With dead ends: 307 [2024-10-11 03:45:04,671 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 03:45:04,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:45:04,672 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 376 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:04,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1881 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:45:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 03:45:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 182. [2024-10-11 03:45:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 179 states have (on average 1.3072625698324023) internal successors, (234), 181 states have internal predecessors, (234), 0 states have call successors, (0), 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:45:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 234 transitions. [2024-10-11 03:45:04,679 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 234 transitions. Word has length 54 [2024-10-11 03:45:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:04,680 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 234 transitions. [2024-10-11 03:45:04,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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:45:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 234 transitions. [2024-10-11 03:45:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:45:04,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:04,680 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:45:04,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:45:04,681 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:45:04,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1645932369, now seen corresponding path program 1 times [2024-10-11 03:45:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35371818] [2024-10-11 03:45:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:05,397 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:45:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35371818] [2024-10-11 03:45:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35371818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:45:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187368079] [2024-10-11 03:45:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:05,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:45:05,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:45:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:05,400 INFO L87 Difference]: Start difference. First operand 182 states and 234 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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:45:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:06,143 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2024-10-11 03:45:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:45:06,144 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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:45:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:06,145 INFO L225 Difference]: With dead ends: 300 [2024-10-11 03:45:06,145 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 03:45:06,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:45:06,147 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 382 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:06,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1268 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:45:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 03:45:06,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 188. [2024-10-11 03:45:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 0 states have call successors, (0), 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:45:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2024-10-11 03:45:06,153 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 54 [2024-10-11 03:45:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:06,153 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2024-10-11 03:45:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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:45:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2024-10-11 03:45:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:45:06,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:06,154 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] [2024-10-11 03:45:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:45:06,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:06,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1542916524, now seen corresponding path program 1 times [2024-10-11 03:45:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680754783] [2024-10-11 03:45:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:06,605 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:45:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680754783] [2024-10-11 03:45:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680754783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:06,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:45:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953045334] [2024-10-11 03:45:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:06,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:45:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:45:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:45:06,608 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:45:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:06,894 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2024-10-11 03:45:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:45:06,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-11 03:45:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:06,896 INFO L225 Difference]: With dead ends: 188 [2024-10-11 03:45:06,896 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 03:45:06,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:45:06,897 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 160 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:06,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 660 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 03:45:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-11 03:45:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 172 states have internal predecessors, (225), 0 states have call successors, (0), 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:45:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2024-10-11 03:45:06,902 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 225 transitions. Word has length 55 [2024-10-11 03:45:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:06,902 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 225 transitions. [2024-10-11 03:45:06,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:45:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2024-10-11 03:45:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 03:45:06,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:06,903 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] [2024-10-11 03:45:06,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:45:06,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:06,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1729762893, now seen corresponding path program 1 times [2024-10-11 03:45:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:06,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730880618] [2024-10-11 03:45:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:07,568 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:45:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730880618] [2024-10-11 03:45:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730880618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:07,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:45:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052101722] [2024-10-11 03:45:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:07,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:45:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:45:07,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:45:07,572 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:45:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:08,401 INFO L93 Difference]: Finished difference Result 473 states and 654 transitions. [2024-10-11 03:45:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:45:08,402 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-11 03:45:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:08,405 INFO L225 Difference]: With dead ends: 473 [2024-10-11 03:45:08,405 INFO L226 Difference]: Without dead ends: 467 [2024-10-11 03:45:08,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:45:08,407 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 629 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:08,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1395 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-11 03:45:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 161. [2024-10-11 03:45:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2024-10-11 03:45:08,415 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 55 [2024-10-11 03:45:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:08,415 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2024-10-11 03:45:08,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:45:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2024-10-11 03:45:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:45:08,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:08,417 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] [2024-10-11 03:45:08,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:45:08,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1767402819, now seen corresponding path program 1 times [2024-10-11 03:45:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247557063] [2024-10-11 03:45:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:08,525 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:45:08,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:08,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247557063] [2024-10-11 03:45:08,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247557063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:08,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:08,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:08,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527186229] [2024-10-11 03:45:08,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:08,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:08,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:08,528 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:45:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:08,605 INFO L93 Difference]: Finished difference Result 665 states and 966 transitions. [2024-10-11 03:45:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:45:08,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-10-11 03:45:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:08,607 INFO L225 Difference]: With dead ends: 665 [2024-10-11 03:45:08,608 INFO L226 Difference]: Without dead ends: 581 [2024-10-11 03:45:08,608 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:45:08,609 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 486 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:08,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 606 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-11 03:45:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 243. [2024-10-11 03:45:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.3677685950413223) internal successors, (331), 242 states have internal predecessors, (331), 0 states have call successors, (0), 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:45:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 331 transitions. [2024-10-11 03:45:08,616 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 331 transitions. Word has length 72 [2024-10-11 03:45:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:08,617 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 331 transitions. [2024-10-11 03:45:08,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:45:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 331 transitions. [2024-10-11 03:45:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:08,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:08,618 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:45:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:45:08,618 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1330307651, now seen corresponding path program 1 times [2024-10-11 03:45:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:08,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451244498] [2024-10-11 03:45:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:08,712 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:45:08,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:08,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451244498] [2024-10-11 03:45:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451244498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:08,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540609272] [2024-10-11 03:45:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:08,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:08,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:08,715 INFO L87 Difference]: Start difference. First operand 243 states and 331 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:08,773 INFO L93 Difference]: Finished difference Result 825 states and 1194 transitions. [2024-10-11 03:45:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:08,776 INFO L225 Difference]: With dead ends: 825 [2024-10-11 03:45:08,776 INFO L226 Difference]: Without dead ends: 659 [2024-10-11 03:45:08,777 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:45:08,778 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 283 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 436 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:45:08,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 436 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-11 03:45:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 407. [2024-10-11 03:45:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.416256157635468) internal successors, (575), 406 states have internal predecessors, (575), 0 states have call successors, (0), 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:45:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 575 transitions. [2024-10-11 03:45:08,788 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 575 transitions. Word has length 74 [2024-10-11 03:45:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 575 transitions. [2024-10-11 03:45:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 575 transitions. [2024-10-11 03:45:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:08,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:08,789 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:45:08,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:45:08,790 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:08,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash 794928439, now seen corresponding path program 1 times [2024-10-11 03:45:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882681154] [2024-10-11 03:45:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:08,914 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:45:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882681154] [2024-10-11 03:45:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882681154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668496672] [2024-10-11 03:45:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:08,917 INFO L87 Difference]: Start difference. First operand 407 states and 575 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:08,975 INFO L93 Difference]: Finished difference Result 989 states and 1438 transitions. [2024-10-11 03:45:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:08,978 INFO L225 Difference]: With dead ends: 989 [2024-10-11 03:45:08,979 INFO L226 Difference]: Without dead ends: 823 [2024-10-11 03:45:08,979 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:45:08,980 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 294 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:08,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 433 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-11 03:45:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 653. [2024-10-11 03:45:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.4417177914110428) internal successors, (940), 652 states have internal predecessors, (940), 0 states have call successors, (0), 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:45:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 940 transitions. [2024-10-11 03:45:08,996 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 940 transitions. Word has length 74 [2024-10-11 03:45:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:08,996 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 940 transitions. [2024-10-11 03:45:08,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 940 transitions. [2024-10-11 03:45:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:08,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:08,998 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:45:08,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:45:08,998 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:08,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:08,999 INFO L85 PathProgramCache]: Analyzing trace with hash 670344324, now seen corresponding path program 1 times [2024-10-11 03:45:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605431684] [2024-10-11 03:45:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:09,051 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:45:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:09,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605431684] [2024-10-11 03:45:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605431684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606494131] [2024-10-11 03:45:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:09,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:09,053 INFO L87 Difference]: Start difference. First operand 653 states and 940 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:45:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:09,082 INFO L93 Difference]: Finished difference Result 1231 states and 1797 transitions. [2024-10-11 03:45:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:09,083 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:45:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:09,085 INFO L225 Difference]: With dead ends: 1231 [2024-10-11 03:45:09,085 INFO L226 Difference]: Without dead ends: 655 [2024-10-11 03:45:09,086 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:45:09,087 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:09,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-11 03:45:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 653. [2024-10-11 03:45:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.4294478527607362) internal successors, (932), 652 states have internal predecessors, (932), 0 states have call successors, (0), 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:45:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 932 transitions. [2024-10-11 03:45:09,101 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 932 transitions. Word has length 74 [2024-10-11 03:45:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:09,101 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 932 transitions. [2024-10-11 03:45:09,102 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:45:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 932 transitions. [2024-10-11 03:45:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:09,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:09,103 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:45:09,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:45:09,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash -98948669, now seen corresponding path program 1 times [2024-10-11 03:45:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:09,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523157909] [2024-10-11 03:45:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:09,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:45:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523157909] [2024-10-11 03:45:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523157909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:09,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264247649] [2024-10-11 03:45:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:09,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:09,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:09,155 INFO L87 Difference]: Start difference. First operand 653 states and 932 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:45:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:09,184 INFO L93 Difference]: Finished difference Result 1715 states and 2478 transitions. [2024-10-11 03:45:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:09,184 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:45:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:09,188 INFO L225 Difference]: With dead ends: 1715 [2024-10-11 03:45:09,188 INFO L226 Difference]: Without dead ends: 1139 [2024-10-11 03:45:09,189 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:45:09,190 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 51 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:09,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 284 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-11 03:45:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1137. [2024-10-11 03:45:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.409330985915493) internal successors, (1601), 1136 states have internal predecessors, (1601), 0 states have call successors, (0), 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:45:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1601 transitions. [2024-10-11 03:45:09,215 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1601 transitions. Word has length 74 [2024-10-11 03:45:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:09,215 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1601 transitions. [2024-10-11 03:45:09,215 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:45:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1601 transitions. [2024-10-11 03:45:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:09,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:09,217 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:45:09,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:45:09,217 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:09,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2082611331, now seen corresponding path program 1 times [2024-10-11 03:45:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992213612] [2024-10-11 03:45:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:09,322 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:45:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992213612] [2024-10-11 03:45:09,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992213612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:09,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:09,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:09,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201770696] [2024-10-11 03:45:09,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:09,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:09,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:09,325 INFO L87 Difference]: Start difference. First operand 1137 states and 1601 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:09,394 INFO L93 Difference]: Finished difference Result 2051 states and 2913 transitions. [2024-10-11 03:45:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:09,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:09,400 INFO L225 Difference]: With dead ends: 2051 [2024-10-11 03:45:09,401 INFO L226 Difference]: Without dead ends: 1747 [2024-10-11 03:45:09,402 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:45:09,403 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 286 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:09,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 465 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-10-11 03:45:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1439. [2024-10-11 03:45:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1438 states have (on average 1.4137691237830319) internal successors, (2033), 1438 states have internal predecessors, (2033), 0 states have call successors, (0), 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:45:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2033 transitions. [2024-10-11 03:45:09,446 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2033 transitions. Word has length 74 [2024-10-11 03:45:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:09,447 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2033 transitions. [2024-10-11 03:45:09,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:45:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2033 transitions. [2024-10-11 03:45:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:45:09,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:09,448 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:45:09,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:45:09,449 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:09,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash -753330043, now seen corresponding path program 1 times [2024-10-11 03:45:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282670935] [2024-10-11 03:45:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:09,544 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:45:09,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:09,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282670935] [2024-10-11 03:45:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282670935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:09,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:09,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246656363] [2024-10-11 03:45:09,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:09,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:09,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:09,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:09,548 INFO L87 Difference]: Start difference. First operand 1439 states and 2033 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:45:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:09,579 INFO L93 Difference]: Finished difference Result 3677 states and 5209 transitions. [2024-10-11 03:45:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:09,580 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:45:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:09,588 INFO L225 Difference]: With dead ends: 3677 [2024-10-11 03:45:09,588 INFO L226 Difference]: Without dead ends: 2315 [2024-10-11 03:45:09,591 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:45:09,593 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 60 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 266 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:45:09,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 266 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2024-10-11 03:45:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2169. [2024-10-11 03:45:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.3952952029520296) internal successors, (3025), 2168 states have internal predecessors, (3025), 0 states have call successors, (0), 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:45:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3025 transitions. [2024-10-11 03:45:09,681 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3025 transitions. Word has length 75 [2024-10-11 03:45:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3025 transitions. [2024-10-11 03:45:09,682 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:45:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3025 transitions. [2024-10-11 03:45:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:45:09,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:09,683 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:45:09,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:45:09,684 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:45:09,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1764053275, now seen corresponding path program 1 times [2024-10-11 03:45:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238567401] [2024-10-11 03:45:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:09,774 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:45:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238567401] [2024-10-11 03:45:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238567401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:09,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892831439] [2024-10-11 03:45:09,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:09,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:09,776 INFO L87 Difference]: Start difference. First operand 2169 states and 3025 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:45:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:09,817 INFO L93 Difference]: Finished difference Result 6137 states and 8529 transitions. [2024-10-11 03:45:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:45:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:09,831 INFO L225 Difference]: With dead ends: 6137 [2024-10-11 03:45:09,832 INFO L226 Difference]: Without dead ends: 4045 [2024-10-11 03:45:09,836 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:45:09,836 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 265 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:45:09,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2024-10-11 03:45:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 3827. [2024-10-11 03:45:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3827 states, 3826 states have (on average 1.3755880815473078) internal successors, (5263), 3826 states have internal predecessors, (5263), 0 states have call successors, (0), 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:45:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 5263 transitions. [2024-10-11 03:45:09,920 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 5263 transitions. Word has length 76 [2024-10-11 03:45:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 3827 states and 5263 transitions. [2024-10-11 03:45:09,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:45:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 5263 transitions. [2024-10-11 03:45:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:45:09,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:09,921 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:45:09,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:45:09,922 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:45:09,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1616355032, now seen corresponding path program 1 times [2024-10-11 03:45:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:09,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19836827] [2024-10-11 03:45:09,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:09,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:10,014 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:45:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19836827] [2024-10-11 03:45:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19836827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669984151] [2024-10-11 03:45:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:10,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:10,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:10,016 INFO L87 Difference]: Start difference. First operand 3827 states and 5263 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:45:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:10,072 INFO L93 Difference]: Finished difference Result 10895 states and 14865 transitions. [2024-10-11 03:45:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:10,073 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:45:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:10,095 INFO L225 Difference]: With dead ends: 10895 [2024-10-11 03:45:10,095 INFO L226 Difference]: Without dead ends: 7145 [2024-10-11 03:45:10,102 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:45:10,103 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 43 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 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:45:10,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7145 states. [2024-10-11 03:45:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7145 to 6711. [2024-10-11 03:45:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6711 states, 6710 states have (on average 1.346795827123696) internal successors, (9037), 6710 states have internal predecessors, (9037), 0 states have call successors, (0), 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:45:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 9037 transitions. [2024-10-11 03:45:10,249 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 9037 transitions. Word has length 77 [2024-10-11 03:45:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:10,249 INFO L471 AbstractCegarLoop]: Abstraction has 6711 states and 9037 transitions. [2024-10-11 03:45:10,249 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:45:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 9037 transitions. [2024-10-11 03:45:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:45:10,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:10,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:10,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:45:10,250 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:45:10,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2121296140, now seen corresponding path program 1 times [2024-10-11 03:45:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:10,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408235014] [2024-10-11 03:45:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:10,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:10,458 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:45:10,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408235014] [2024-10-11 03:45:10,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408235014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:10,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:10,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:45:10,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768716000] [2024-10-11 03:45:10,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:10,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:45:10,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:10,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:45:10,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:45:10,460 INFO L87 Difference]: Start difference. First operand 6711 states and 9037 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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:45:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:10,522 INFO L93 Difference]: Finished difference Result 6905 states and 9294 transitions. [2024-10-11 03:45:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:45:10,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 03:45:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:10,546 INFO L225 Difference]: With dead ends: 6905 [2024-10-11 03:45:10,546 INFO L226 Difference]: Without dead ends: 6903 [2024-10-11 03:45:10,550 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:45:10,550 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:10,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2024-10-11 03:45:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6903. [2024-10-11 03:45:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6903 states, 6902 states have (on average 1.3255578093306288) internal successors, (9149), 6902 states have internal predecessors, (9149), 0 states have call successors, (0), 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:45:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 9149 transitions. [2024-10-11 03:45:10,695 INFO L78 Accepts]: Start accepts. Automaton has 6903 states and 9149 transitions. Word has length 78 [2024-10-11 03:45:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:10,696 INFO L471 AbstractCegarLoop]: Abstraction has 6903 states and 9149 transitions. [2024-10-11 03:45:10,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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:45:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6903 states and 9149 transitions. [2024-10-11 03:45:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:45:10,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:10,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:10,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:45:10,697 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:45:10,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash 305590840, now seen corresponding path program 1 times [2024-10-11 03:45:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623535590] [2024-10-11 03:45:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:10,746 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:45:10,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:10,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623535590] [2024-10-11 03:45:10,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623535590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:10,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215506265] [2024-10-11 03:45:10,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:10,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:10,748 INFO L87 Difference]: Start difference. First operand 6903 states and 9149 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:45:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:10,817 INFO L93 Difference]: Finished difference Result 13995 states and 18571 transitions. [2024-10-11 03:45:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:10,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 03:45:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:10,834 INFO L225 Difference]: With dead ends: 13995 [2024-10-11 03:45:10,834 INFO L226 Difference]: Without dead ends: 7169 [2024-10-11 03:45:10,844 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:45:10,845 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:10,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 216 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-10-11 03:45:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7167. [2024-10-11 03:45:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7167 states, 7166 states have (on average 1.3051911805749372) internal successors, (9353), 7166 states have internal predecessors, (9353), 0 states have call successors, (0), 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:45:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7167 states to 7167 states and 9353 transitions. [2024-10-11 03:45:11,051 INFO L78 Accepts]: Start accepts. Automaton has 7167 states and 9353 transitions. Word has length 78 [2024-10-11 03:45:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:11,051 INFO L471 AbstractCegarLoop]: Abstraction has 7167 states and 9353 transitions. [2024-10-11 03:45:11,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:45:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7167 states and 9353 transitions. [2024-10-11 03:45:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:45:11,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:11,054 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:11,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:45:11,055 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:45:11,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1123966569, now seen corresponding path program 1 times [2024-10-11 03:45:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:11,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769395129] [2024-10-11 03:45:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:11,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769395129] [2024-10-11 03:45:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769395129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371529190] [2024-10-11 03:45:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:11,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:11,487 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:45:11,488 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:45:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:11,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:45:11,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:12,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:45:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371529190] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:45:13,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:45:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-10-11 03:45:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986109997] [2024-10-11 03:45:13,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:45:13,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:45:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:13,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:45:13,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:45:13,686 INFO L87 Difference]: Start difference. First operand 7167 states and 9353 transitions. Second operand has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 28 states have internal predecessors, (268), 0 states have call successors, (0), 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:45:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:18,273 INFO L93 Difference]: Finished difference Result 67116 states and 87385 transitions. [2024-10-11 03:45:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-10-11 03:45:18,274 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 28 states have internal predecessors, (268), 0 states have call successors, (0), 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 100 [2024-10-11 03:45:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:18,398 INFO L225 Difference]: With dead ends: 67116 [2024-10-11 03:45:18,398 INFO L226 Difference]: Without dead ends: 60026 [2024-10-11 03:45:18,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6990 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3126, Invalid=18044, Unknown=0, NotChecked=0, Total=21170 [2024-10-11 03:45:18,437 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2052 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:18,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 2294 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:45:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60026 states. [2024-10-11 03:45:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60026 to 26762. [2024-10-11 03:45:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26762 states, 26761 states have (on average 1.2943836179514965) internal successors, (34639), 26761 states have internal predecessors, (34639), 0 states have call successors, (0), 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:45:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26762 states to 26762 states and 34639 transitions. [2024-10-11 03:45:19,327 INFO L78 Accepts]: Start accepts. Automaton has 26762 states and 34639 transitions. Word has length 100 [2024-10-11 03:45:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:19,328 INFO L471 AbstractCegarLoop]: Abstraction has 26762 states and 34639 transitions. [2024-10-11 03:45:19,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 28 states have internal predecessors, (268), 0 states have call successors, (0), 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:45:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 26762 states and 34639 transitions. [2024-10-11 03:45:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:45:19,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:19,332 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:19,463 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:45:19,537 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,SelfDestructingSolverStorable25 [2024-10-11 03:45:19,538 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:45:19,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 706190566, now seen corresponding path program 1 times [2024-10-11 03:45:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:19,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216316195] [2024-10-11 03:45:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:45:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216316195] [2024-10-11 03:45:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216316195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:45:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836484111] [2024-10-11 03:45:19,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:19,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:45:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:45:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:45:19,692 INFO L87 Difference]: Start difference. First operand 26762 states and 34639 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:20,067 INFO L93 Difference]: Finished difference Result 65356 states and 84284 transitions. [2024-10-11 03:45:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:45:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:45:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:20,170 INFO L225 Difference]: With dead ends: 65356 [2024-10-11 03:45:20,170 INFO L226 Difference]: Without dead ends: 38678 [2024-10-11 03:45:20,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:20,210 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:20,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 219 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38678 states. [2024-10-11 03:45:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38678 to 26610. [2024-10-11 03:45:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26610 states, 26609 states have (on average 1.2903528881205608) internal successors, (34335), 26609 states have internal predecessors, (34335), 0 states have call successors, (0), 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:45:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26610 states to 26610 states and 34335 transitions. [2024-10-11 03:45:21,045 INFO L78 Accepts]: Start accepts. Automaton has 26610 states and 34335 transitions. Word has length 101 [2024-10-11 03:45:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:21,046 INFO L471 AbstractCegarLoop]: Abstraction has 26610 states and 34335 transitions. [2024-10-11 03:45:21,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 26610 states and 34335 transitions. [2024-10-11 03:45:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:45:21,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:21,050 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:21,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:45:21,050 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:45:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1785101643, now seen corresponding path program 1 times [2024-10-11 03:45:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:21,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871642350] [2024-10-11 03:45:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:21,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871642350] [2024-10-11 03:45:21,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871642350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:21,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704813152] [2024-10-11 03:45:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:21,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:21,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:21,654 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:45:21,657 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:45:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:21,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 03:45:21,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:22,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:45:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704813152] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:45:23,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:45:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2024-10-11 03:45:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922588737] [2024-10-11 03:45:23,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:45:23,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:45:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:45:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:45:23,253 INFO L87 Difference]: Start difference. First operand 26610 states and 34335 transitions. Second operand has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 0 states have call successors, (0), 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:45:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:29,739 INFO L93 Difference]: Finished difference Result 154899 states and 199346 transitions. [2024-10-11 03:45:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-10-11 03:45:29,739 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 0 states have call successors, (0), 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 101 [2024-10-11 03:45:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:29,951 INFO L225 Difference]: With dead ends: 154899 [2024-10-11 03:45:29,951 INFO L226 Difference]: Without dead ends: 128373 [2024-10-11 03:45:30,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6227 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2791, Invalid=16669, Unknown=0, NotChecked=0, Total=19460 [2024-10-11 03:45:30,016 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 2228 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:30,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 1671 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:45:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128373 states. [2024-10-11 03:45:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128373 to 84672. [2024-10-11 03:45:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84672 states, 84671 states have (on average 1.287548275088283) internal successors, (109018), 84671 states have internal predecessors, (109018), 0 states have call successors, (0), 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:45:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84672 states to 84672 states and 109018 transitions. [2024-10-11 03:45:32,009 INFO L78 Accepts]: Start accepts. Automaton has 84672 states and 109018 transitions. Word has length 101 [2024-10-11 03:45:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:32,010 INFO L471 AbstractCegarLoop]: Abstraction has 84672 states and 109018 transitions. [2024-10-11 03:45:32,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 0 states have call successors, (0), 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:45:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 84672 states and 109018 transitions. [2024-10-11 03:45:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:45:32,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:32,025 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, 1, 1, 1, 1] [2024-10-11 03:45:32,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:45:32,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 03:45:32,226 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:45:32,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash 816185589, now seen corresponding path program 1 times [2024-10-11 03:45:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902608790] [2024-10-11 03:45:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902608790] [2024-10-11 03:45:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902608790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143907496] [2024-10-11 03:45:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:32,777 INFO L229 MonitoredProcess]: Starting monitored process 4 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:45:32,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:45:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:32,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 03:45:32,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:45:33,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:45:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143907496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:45:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-10-11 03:45:33,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902663798] [2024-10-11 03:45:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:33,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:33,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:33,536 INFO L87 Difference]: Start difference. First operand 84672 states and 109018 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:34,616 INFO L93 Difference]: Finished difference Result 203823 states and 262506 transitions. [2024-10-11 03:45:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:45:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-11 03:45:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:34,805 INFO L225 Difference]: With dead ends: 203823 [2024-10-11 03:45:34,805 INFO L226 Difference]: Without dead ends: 119258 [2024-10-11 03:45:34,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:45:34,853 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 380 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:34,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 450 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119258 states. [2024-10-11 03:45:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119258 to 84672. [2024-10-11 03:45:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84672 states, 84671 states have (on average 1.2875010334116759) internal successors, (109014), 84671 states have internal predecessors, (109014), 0 states have call successors, (0), 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:45:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84672 states to 84672 states and 109014 transitions. [2024-10-11 03:45:36,180 INFO L78 Accepts]: Start accepts. Automaton has 84672 states and 109014 transitions. Word has length 102 [2024-10-11 03:45:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:36,180 INFO L471 AbstractCegarLoop]: Abstraction has 84672 states and 109014 transitions. [2024-10-11 03:45:36,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 84672 states and 109014 transitions. [2024-10-11 03:45:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:45:36,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:36,191 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, 1, 1, 1, 1, 1] [2024-10-11 03:45:36,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:45:36,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:36,392 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:45:36,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -498912012, now seen corresponding path program 1 times [2024-10-11 03:45:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493167398] [2024-10-11 03:45:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493167398] [2024-10-11 03:45:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493167398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50819573] [2024-10-11 03:45:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:37,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:37,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:37,207 INFO L229 MonitoredProcess]: Starting monitored process 5 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:45:37,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:45:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:37,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 03:45:37,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:38,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:45:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:40,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50819573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:45:40,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:45:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 40 [2024-10-11 03:45:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326535588] [2024-10-11 03:45:40,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:45:40,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 03:45:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 03:45:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:45:40,475 INFO L87 Difference]: Start difference. First operand 84672 states and 109014 transitions. Second operand has 40 states, 40 states have (on average 7.0) internal successors, (280), 40 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)