./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:46:45,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:46:45,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:46:45,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:46:45,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:46:45,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:46:45,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:46:45,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:46:45,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:46:45,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:46:45,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:46:45,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:46:45,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:46:45,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:46:45,825 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:46:45,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:46:45,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:46:45,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:46:45,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:46:45,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:46:45,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:46:45,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:46:45,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:46:45,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:46:45,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:46:45,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:46:45,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:46:45,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:46:45,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:46:45,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:46:45,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:46:45,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:46:45,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:46:45,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:46:45,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:46:45,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:46:45,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:46:45,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:46:45,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:46:45,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:46:45,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:46:45,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:46:45,839 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd [2024-10-24 01:46:46,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:46:46,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:46:46,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:46:46,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:46:46,145 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:46:46,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-24 01:46:47,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:46:47,774 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:46:47,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-24 01:46:47,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfc7d8db/1431830be24a4eb8a921e61711bbac1d/FLAGd2de2d7e2 [2024-10-24 01:46:47,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfc7d8db/1431830be24a4eb8a921e61711bbac1d [2024-10-24 01:46:47,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:46:47,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:46:47,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:46:47,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:46:47,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:46:47,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:47" (1/1) ... [2024-10-24 01:46:47,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a612eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:47, skipping insertion in model container [2024-10-24 01:46:47,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:47" (1/1) ... [2024-10-24 01:46:47,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:46:48,137 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2024-10-24 01:46:48,157 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2024-10-24 01:46:48,182 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2024-10-24 01:46:48,196 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2024-10-24 01:46:48,218 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2024-10-24 01:46:48,231 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2024-10-24 01:46:48,243 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2024-10-24 01:46:48,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:46:48,296 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:46:48,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2024-10-24 01:46:48,396 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2024-10-24 01:46:48,427 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2024-10-24 01:46:48,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2024-10-24 01:46:48,463 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2024-10-24 01:46:48,472 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2024-10-24 01:46:48,478 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2024-10-24 01:46:48,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:46:48,518 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:46:48,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48 WrapperNode [2024-10-24 01:46:48,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:46:48,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:46:48,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:46:48,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:46:48,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,590 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1430 [2024-10-24 01:46:48,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:46:48,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:46:48,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:46:48,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:46:48,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,653 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-24 01:46:48,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:46:48,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:46:48,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:46:48,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:46:48,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (1/1) ... [2024-10-24 01:46:48,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:46:48,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:46:48,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:46:48,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:46:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:46:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:46:48,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:46:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:46:49,077 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:46:49,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:46:50,070 INFO L? ?]: Removed 266 outVars from TransFormulas that were not future-live. [2024-10-24 01:46:50,070 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:46:50,123 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:46:50,124 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:46:50,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:50 BoogieIcfgContainer [2024-10-24 01:46:50,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:46:50,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:46:50,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:46:50,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:46:50,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:46:47" (1/3) ... [2024-10-24 01:46:50,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fbad14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:50, skipping insertion in model container [2024-10-24 01:46:50,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:48" (2/3) ... [2024-10-24 01:46:50,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fbad14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:50, skipping insertion in model container [2024-10-24 01:46:50,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:50" (3/3) ... [2024-10-24 01:46:50,136 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-24 01:46:50,149 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:46:50,149 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 01:46:50,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:46:50,228 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;@666aa403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:46:50,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 01:46:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 277 states, 269 states have (on average 1.7992565055762082) internal successors, (484), 276 states have internal predecessors, (484), 0 states have call successors, (0), 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-24 01:46:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 01:46:50,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:50,249 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-24 01:46:50,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1191779176, now seen corresponding path program 1 times [2024-10-24 01:46:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:50,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593938208] [2024-10-24 01:46:50,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:50,812 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-24 01:46:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593938208] [2024-10-24 01:46:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593938208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:50,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:50,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690890085] [2024-10-24 01:46:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:50,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:50,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:50,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:50,851 INFO L87 Difference]: Start difference. First operand has 277 states, 269 states have (on average 1.7992565055762082) internal successors, (484), 276 states have internal predecessors, (484), 0 states have call successors, (0), 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.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-24 01:46:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:51,194 INFO L93 Difference]: Finished difference Result 387 states and 655 transitions. [2024-10-24 01:46:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:51,198 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-24 01:46:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:51,212 INFO L225 Difference]: With dead ends: 387 [2024-10-24 01:46:51,212 INFO L226 Difference]: Without dead ends: 243 [2024-10-24 01:46:51,216 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-24 01:46:51,222 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1149 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:51,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 286 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:46:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-24 01:46:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-10-24 01:46:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 236 states have (on average 1.2669491525423728) internal successors, (299), 242 states have internal predecessors, (299), 0 states have call successors, (0), 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-24 01:46:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 299 transitions. [2024-10-24 01:46:51,283 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 299 transitions. Word has length 47 [2024-10-24 01:46:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:51,284 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 299 transitions. [2024-10-24 01:46:51,284 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-24 01:46:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 299 transitions. [2024-10-24 01:46:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 01:46:51,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:51,286 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-24 01:46:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:46:51,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 520818139, now seen corresponding path program 1 times [2024-10-24 01:46:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299794201] [2024-10-24 01:46:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:51,453 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-24 01:46:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:51,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299794201] [2024-10-24 01:46:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299794201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137587963] [2024-10-24 01:46:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:51,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:51,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:51,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:51,457 INFO L87 Difference]: Start difference. First operand 243 states and 299 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-24 01:46:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:51,623 INFO L93 Difference]: Finished difference Result 311 states and 386 transitions. [2024-10-24 01:46:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:51,624 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-24 01:46:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:51,625 INFO L225 Difference]: With dead ends: 311 [2024-10-24 01:46:51,627 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 01:46:51,628 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-24 01:46:51,629 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 638 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:51,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 142 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 01:46:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-24 01:46:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 184 states have internal predecessors, (226), 0 states have call successors, (0), 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-24 01:46:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2024-10-24 01:46:51,644 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 47 [2024-10-24 01:46:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2024-10-24 01:46:51,644 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-24 01:46:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2024-10-24 01:46:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 01:46:51,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:51,646 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-24 01:46:51,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:46:51,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 45954227, now seen corresponding path program 1 times [2024-10-24 01:46:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524072909] [2024-10-24 01:46:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:51,784 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-24 01:46:51,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524072909] [2024-10-24 01:46:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524072909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:51,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:51,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:51,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429841902] [2024-10-24 01:46:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:51,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:51,787 INFO L87 Difference]: Start difference. First operand 185 states and 226 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-24 01:46:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:51,921 INFO L93 Difference]: Finished difference Result 265 states and 331 transitions. [2024-10-24 01:46:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:51,923 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-24 01:46:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:51,924 INFO L225 Difference]: With dead ends: 265 [2024-10-24 01:46:51,924 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 01:46:51,925 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-24 01:46:51,925 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 566 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:51,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 01:46:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-24 01:46:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 161 states have internal predecessors, (198), 0 states have call successors, (0), 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-24 01:46:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 198 transitions. [2024-10-24 01:46:51,943 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 198 transitions. Word has length 47 [2024-10-24 01:46:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:51,943 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 198 transitions. [2024-10-24 01:46:51,943 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-24 01:46:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2024-10-24 01:46:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:46:51,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:51,945 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-24 01:46:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:46:51,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1209610819, now seen corresponding path program 1 times [2024-10-24 01:46:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260719508] [2024-10-24 01:46:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:52,301 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-24 01:46:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260719508] [2024-10-24 01:46:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260719508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:52,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:46:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093895712] [2024-10-24 01:46:52,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:52,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:46:52,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:46:52,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:46:52,307 INFO L87 Difference]: Start difference. First operand 162 states and 198 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-24 01:46:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:52,661 INFO L93 Difference]: Finished difference Result 325 states and 404 transitions. [2024-10-24 01:46:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:46:52,662 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-24 01:46:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:52,663 INFO L225 Difference]: With dead ends: 325 [2024-10-24 01:46:52,663 INFO L226 Difference]: Without dead ends: 238 [2024-10-24 01:46:52,664 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-24 01:46:52,665 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 545 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:52,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 530 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:46:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-24 01:46:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 162. [2024-10-24 01:46:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.270967741935484) internal successors, (197), 161 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2024-10-24 01:46:52,672 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 49 [2024-10-24 01:46:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:52,672 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2024-10-24 01:46:52,672 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-24 01:46:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2024-10-24 01:46:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:46:52,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:52,674 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-24 01:46:52,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:46:52,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:52,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash 754421757, now seen corresponding path program 1 times [2024-10-24 01:46:52,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:52,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770401082] [2024-10-24 01:46:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:52,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:52,964 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-24 01:46:52,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:52,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770401082] [2024-10-24 01:46:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770401082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:52,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:46:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853263173] [2024-10-24 01:46:52,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:46:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:46:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:52,968 INFO L87 Difference]: Start difference. First operand 162 states and 197 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-24 01:46:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:53,370 INFO L93 Difference]: Finished difference Result 254 states and 312 transitions. [2024-10-24 01:46:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:46:53,371 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-24 01:46:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:53,372 INFO L225 Difference]: With dead ends: 254 [2024-10-24 01:46:53,372 INFO L226 Difference]: Without dead ends: 248 [2024-10-24 01:46:53,373 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-24 01:46:53,373 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 820 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:53,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 502 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-24 01:46:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 162. [2024-10-24 01:46:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.264516129032258) internal successors, (196), 161 states have internal predecessors, (196), 0 states have call successors, (0), 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-24 01:46:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2024-10-24 01:46:53,383 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 49 [2024-10-24 01:46:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:53,384 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2024-10-24 01:46:53,384 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-24 01:46:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2024-10-24 01:46:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:46:53,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:53,389 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-24 01:46:53,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:46:53,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:53,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash -175435075, now seen corresponding path program 1 times [2024-10-24 01:46:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740339601] [2024-10-24 01:46:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:53,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:53,670 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-24 01:46:53,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:53,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740339601] [2024-10-24 01:46:53,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740339601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:53,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:53,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:46:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729679770] [2024-10-24 01:46:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:46:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:53,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:46:53,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:53,673 INFO L87 Difference]: Start difference. First operand 162 states and 196 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-24 01:46:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:54,071 INFO L93 Difference]: Finished difference Result 314 states and 396 transitions. [2024-10-24 01:46:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:46:54,072 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-24 01:46:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:54,073 INFO L225 Difference]: With dead ends: 314 [2024-10-24 01:46:54,073 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 01:46:54,074 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-24 01:46:54,074 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 593 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:54,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 807 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:46:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 01:46:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 162. [2024-10-24 01:46:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.2580645161290323) internal successors, (195), 161 states have internal predecessors, (195), 0 states have call successors, (0), 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-24 01:46:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2024-10-24 01:46:54,079 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 49 [2024-10-24 01:46:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:54,080 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2024-10-24 01:46:54,080 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-24 01:46:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2024-10-24 01:46:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:46:54,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:54,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:54,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:46:54,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:54,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1893856322, now seen corresponding path program 1 times [2024-10-24 01:46:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:54,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749747873] [2024-10-24 01:46:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:54,682 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-24 01:46:54,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749747873] [2024-10-24 01:46:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749747873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:46:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352069498] [2024-10-24 01:46:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:54,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:46:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:46:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:46:54,685 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:55,278 INFO L93 Difference]: Finished difference Result 293 states and 372 transitions. [2024-10-24 01:46:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:46:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-24 01:46:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:55,280 INFO L225 Difference]: With dead ends: 293 [2024-10-24 01:46:55,280 INFO L226 Difference]: Without dead ends: 238 [2024-10-24 01:46:55,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:46:55,281 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 977 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:55,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1288 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-24 01:46:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 150. [2024-10-24 01:46:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 149 states have internal predecessors, (181), 0 states have call successors, (0), 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-24 01:46:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2024-10-24 01:46:55,286 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 50 [2024-10-24 01:46:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:55,286 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2024-10-24 01:46:55,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2024-10-24 01:46:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 01:46:55,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:55,287 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-24 01:46:55,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:46:55,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:55,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash 883237538, now seen corresponding path program 1 times [2024-10-24 01:46:55,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:55,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200508309] [2024-10-24 01:46:55,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200508309] [2024-10-24 01:46:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200508309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:46:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548964369] [2024-10-24 01:46:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:55,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:46:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:46:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:46:55,860 INFO L87 Difference]: Start difference. First operand 150 states and 181 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-24 01:46:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:56,535 INFO L93 Difference]: Finished difference Result 363 states and 455 transitions. [2024-10-24 01:46:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:46:56,536 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-24 01:46:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:56,537 INFO L225 Difference]: With dead ends: 363 [2024-10-24 01:46:56,538 INFO L226 Difference]: Without dead ends: 359 [2024-10-24 01:46:56,538 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-24 01:46:56,539 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1176 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:56,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1413 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:46:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-24 01:46:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 146. [2024-10-24 01:46:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 145 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2024-10-24 01:46:56,543 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 51 [2024-10-24 01:46:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:56,544 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2024-10-24 01:46:56,544 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-24 01:46:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2024-10-24 01:46:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 01:46:56,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:56,545 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-24 01:46:56,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:46:56,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:56,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1387229666, now seen corresponding path program 1 times [2024-10-24 01:46:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811391727] [2024-10-24 01:46:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:57,004 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-24 01:46:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811391727] [2024-10-24 01:46:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811391727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:57,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:57,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:46:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582995738] [2024-10-24 01:46:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:57,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:46:57,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:46:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:46:57,010 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:57,425 INFO L93 Difference]: Finished difference Result 393 states and 508 transitions. [2024-10-24 01:46:57,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:46:57,426 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-24 01:46:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:57,427 INFO L225 Difference]: With dead ends: 393 [2024-10-24 01:46:57,427 INFO L226 Difference]: Without dead ends: 326 [2024-10-24 01:46:57,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:46:57,428 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 872 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:57,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 950 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-24 01:46:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 122. [2024-10-24 01:46:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 119 states have (on average 1.2521008403361344) internal successors, (149), 121 states have internal predecessors, (149), 0 states have call successors, (0), 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-24 01:46:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-10-24 01:46:57,433 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 51 [2024-10-24 01:46:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:57,434 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-10-24 01:46:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-10-24 01:46:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:46:57,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:57,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:57,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:46:57,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:57,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1870868834, now seen corresponding path program 1 times [2024-10-24 01:46:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:57,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571859338] [2024-10-24 01:46:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:57,655 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-24 01:46:57,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:57,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571859338] [2024-10-24 01:46:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571859338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:46:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456516482] [2024-10-24 01:46:57,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:57,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:46:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:46:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:57,658 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:57,962 INFO L93 Difference]: Finished difference Result 196 states and 244 transitions. [2024-10-24 01:46:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:46:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-24 01:46:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:57,963 INFO L225 Difference]: With dead ends: 196 [2024-10-24 01:46:57,963 INFO L226 Difference]: Without dead ends: 188 [2024-10-24 01:46:57,964 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-24 01:46:57,964 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 620 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:57,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 373 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-24 01:46:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2024-10-24 01:46:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 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-24 01:46:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2024-10-24 01:46:57,969 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 53 [2024-10-24 01:46:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:57,969 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2024-10-24 01:46:57,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2024-10-24 01:46:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:46:57,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:57,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:57,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:46:57,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:57,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1523929374, now seen corresponding path program 1 times [2024-10-24 01:46:57,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:57,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571026457] [2024-10-24 01:46:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:58,169 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-24 01:46:58,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:58,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571026457] [2024-10-24 01:46:58,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571026457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:58,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:58,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:46:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631541375] [2024-10-24 01:46:58,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:46:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:58,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:46:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:58,172 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:58,487 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2024-10-24 01:46:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:46:58,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-24 01:46:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:58,488 INFO L225 Difference]: With dead ends: 271 [2024-10-24 01:46:58,488 INFO L226 Difference]: Without dead ends: 208 [2024-10-24 01:46:58,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:46:58,489 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 302 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:58,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 760 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-24 01:46:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 122. [2024-10-24 01:46:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 121 states have internal predecessors, (147), 0 states have call successors, (0), 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-24 01:46:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2024-10-24 01:46:58,493 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 53 [2024-10-24 01:46:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:58,493 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-10-24 01:46:58,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2024-10-24 01:46:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:46:58,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:58,494 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-24 01:46:58,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:46:58,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:46:58,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1353414343, now seen corresponding path program 1 times [2024-10-24 01:46:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102287141] [2024-10-24 01:46:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:58,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:59,250 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-24 01:46:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:59,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102287141] [2024-10-24 01:46:59,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102287141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:59,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:59,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 01:46:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71996541] [2024-10-24 01:46:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:59,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 01:46:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 01:46:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:46:59,253 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-24 01:47:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:00,428 INFO L93 Difference]: Finished difference Result 343 states and 435 transitions. [2024-10-24 01:47:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 01:47:00,429 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-24 01:47:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:00,431 INFO L225 Difference]: With dead ends: 343 [2024-10-24 01:47:00,431 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 01:47:00,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2024-10-24 01:47:00,432 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 636 mSDsluCounter, 2897 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:00,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 3170 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:47:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 01:47:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 135. [2024-10-24 01:47:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 134 states have internal predecessors, (163), 0 states have call successors, (0), 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-24 01:47:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2024-10-24 01:47:00,437 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 55 [2024-10-24 01:47:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:00,437 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2024-10-24 01:47:00,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-24 01:47:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2024-10-24 01:47:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:47:00,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:00,438 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-24 01:47:00,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:47:00,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:47:00,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash 635933575, now seen corresponding path program 1 times [2024-10-24 01:47:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:00,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680687838] [2024-10-24 01:47:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:01,222 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-24 01:47:01,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:01,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680687838] [2024-10-24 01:47:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680687838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:01,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:01,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 01:47:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042902043] [2024-10-24 01:47:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:01,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 01:47:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:01,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 01:47:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:47:01,225 INFO L87 Difference]: Start difference. First operand 135 states and 163 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-24 01:47:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:02,324 INFO L93 Difference]: Finished difference Result 346 states and 437 transitions. [2024-10-24 01:47:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 01:47:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-24 01:47:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:02,326 INFO L225 Difference]: With dead ends: 346 [2024-10-24 01:47:02,326 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 01:47:02,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 01:47:02,327 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 925 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:02,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 2688 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:47:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 01:47:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 139. [2024-10-24 01:47:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 138 states have internal predecessors, (168), 0 states have call successors, (0), 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-24 01:47:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2024-10-24 01:47:02,331 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 55 [2024-10-24 01:47:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:02,331 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2024-10-24 01:47:02,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 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-24 01:47:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2024-10-24 01:47:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:47:02,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:02,332 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] [2024-10-24 01:47:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:47:02,333 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:47:02,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1713847366, now seen corresponding path program 1 times [2024-10-24 01:47:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188991787] [2024-10-24 01:47:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:02,775 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-24 01:47:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188991787] [2024-10-24 01:47:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188991787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:02,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:02,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:47:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916689030] [2024-10-24 01:47:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:02,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:47:02,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:47:02,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:47:02,777 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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-24 01:47:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:03,166 INFO L93 Difference]: Finished difference Result 197 states and 249 transitions. [2024-10-24 01:47:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:47:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-24 01:47:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:03,167 INFO L225 Difference]: With dead ends: 197 [2024-10-24 01:47:03,167 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 01:47:03,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:47:03,168 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 508 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:03,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 898 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:47:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 01:47:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 126. [2024-10-24 01:47:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 125 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 01:47:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2024-10-24 01:47:03,171 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 56 [2024-10-24 01:47:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:03,172 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2024-10-24 01:47:03,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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-24 01:47:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2024-10-24 01:47:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:47:03,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:03,172 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] [2024-10-24 01:47:03,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:47:03,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:47:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1825517588, now seen corresponding path program 1 times [2024-10-24 01:47:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:03,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305949791] [2024-10-24 01:47:03,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:03,630 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-24 01:47:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:03,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305949791] [2024-10-24 01:47:03,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305949791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:47:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310649172] [2024-10-24 01:47:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:47:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:03,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:47:03,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:47:03,632 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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-24 01:47:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:04,062 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2024-10-24 01:47:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:47:04,062 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-10-24 01:47:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:04,063 INFO L225 Difference]: With dead ends: 184 [2024-10-24 01:47:04,063 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 01:47:04,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:47:04,064 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 477 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:04,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1213 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:47:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 01:47:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 103. [2024-10-24 01:47:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 0 states have call successors, (0), 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-24 01:47:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2024-10-24 01:47:04,067 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 56 [2024-10-24 01:47:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:04,067 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2024-10-24 01:47:04,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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-24 01:47:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2024-10-24 01:47:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:47:04,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:04,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:47:04,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:47:04,068 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-24 01:47:04,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 51586787, now seen corresponding path program 1 times [2024-10-24 01:47:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993589142] [2024-10-24 01:47:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:04,154 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-24 01:47:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993589142] [2024-10-24 01:47:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993589142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:47:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376117667] [2024-10-24 01:47:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:04,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:47:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:47:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:47:04,156 INFO L87 Difference]: Start difference. First operand 103 states and 127 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-24 01:47:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:04,226 INFO L93 Difference]: Finished difference Result 361 states and 505 transitions. [2024-10-24 01:47:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:47:04,227 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-24 01:47:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:04,228 INFO L225 Difference]: With dead ends: 361 [2024-10-24 01:47:04,228 INFO L226 Difference]: Without dead ends: 318 [2024-10-24 01:47:04,229 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-24 01:47:04,229 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 526 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:04,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 455 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-24 01:47:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 144. [2024-10-24 01:47:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 0 states have call successors, (0), 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-24 01:47:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2024-10-24 01:47:04,233 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 74 [2024-10-24 01:47:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:04,234 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2024-10-24 01:47:04,234 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-24 01:47:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2024-10-24 01:47:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:47:04,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:04,235 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-24 01:47:04,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:47:04,235 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-24 01:47:04,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1857068940, now seen corresponding path program 1 times [2024-10-24 01:47:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231512676] [2024-10-24 01:47:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:04,326 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-24 01:47:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231512676] [2024-10-24 01:47:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231512676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:47:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179457413] [2024-10-24 01:47:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:47:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:47:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:47:04,329 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:04,386 INFO L93 Difference]: Finished difference Result 439 states and 617 transitions. [2024-10-24 01:47:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:47:04,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-24 01:47:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:04,388 INFO L225 Difference]: With dead ends: 439 [2024-10-24 01:47:04,388 INFO L226 Difference]: Without dead ends: 355 [2024-10-24 01:47:04,388 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-24 01:47:04,390 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 291 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 415 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-24 01:47:04,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 415 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-24 01:47:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 226. [2024-10-24 01:47:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.3688888888888888) internal successors, (308), 225 states have internal predecessors, (308), 0 states have call successors, (0), 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-24 01:47:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 308 transitions. [2024-10-24 01:47:04,398 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 308 transitions. Word has length 76 [2024-10-24 01:47:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:04,398 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 308 transitions. [2024-10-24 01:47:04,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 308 transitions. [2024-10-24 01:47:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:47:04,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:04,399 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-24 01:47:04,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:47:04,400 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-24 01:47:04,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1771586931, now seen corresponding path program 1 times [2024-10-24 01:47:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983149608] [2024-10-24 01:47:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:04,445 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-24 01:47:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983149608] [2024-10-24 01:47:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983149608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:04,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:47:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636143276] [2024-10-24 01:47:04,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:04,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:47:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:04,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:47:04,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:47:04,447 INFO L87 Difference]: Start difference. First operand 226 states and 308 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-24 01:47:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:04,468 INFO L93 Difference]: Finished difference Result 532 states and 750 transitions. [2024-10-24 01:47:04,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:47:04,469 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-24 01:47:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:04,470 INFO L225 Difference]: With dead ends: 532 [2024-10-24 01:47:04,470 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 01:47:04,471 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-24 01:47:04,471 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 50 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 285 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-24 01:47:04,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 285 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 01:47:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2024-10-24 01:47:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.3691460055096418) internal successors, (497), 363 states have internal predecessors, (497), 0 states have call successors, (0), 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-24 01:47:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 497 transitions. [2024-10-24 01:47:04,478 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 497 transitions. Word has length 76 [2024-10-24 01:47:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:04,479 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 497 transitions. [2024-10-24 01:47:04,479 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-24 01:47:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 497 transitions. [2024-10-24 01:47:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:47:04,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:04,480 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-24 01:47:04,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:47:04,480 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-24 01:47:04,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1838080443, now seen corresponding path program 1 times [2024-10-24 01:47:04,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:04,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630926055] [2024-10-24 01:47:04,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:04,542 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-24 01:47:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:04,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630926055] [2024-10-24 01:47:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630926055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:04,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:04,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:47:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148367035] [2024-10-24 01:47:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:04,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:47:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:47:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:47:04,544 INFO L87 Difference]: Start difference. First operand 364 states and 497 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-24 01:47:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:04,568 INFO L93 Difference]: Finished difference Result 670 states and 931 transitions. [2024-10-24 01:47:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:47:04,568 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-24 01:47:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:04,570 INFO L225 Difference]: With dead ends: 670 [2024-10-24 01:47:04,570 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 01:47:04,570 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-24 01:47:04,571 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 205 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-24 01:47:04,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 205 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 01:47:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2024-10-24 01:47:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.3636363636363635) internal successors, (495), 363 states have internal predecessors, (495), 0 states have call successors, (0), 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-24 01:47:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 495 transitions. [2024-10-24 01:47:04,577 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 495 transitions. Word has length 76 [2024-10-24 01:47:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:04,577 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 495 transitions. [2024-10-24 01:47:04,577 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-24 01:47:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 495 transitions. [2024-10-24 01:47:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:47:04,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:04,578 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-24 01:47:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:47:04,578 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-24 01:47:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1823220340, now seen corresponding path program 1 times [2024-10-24 01:47:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462905299] [2024-10-24 01:47:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:04,663 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-24 01:47:04,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462905299] [2024-10-24 01:47:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462905299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:47:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683635387] [2024-10-24 01:47:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:04,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:47:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:04,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:47:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:47:04,666 INFO L87 Difference]: Start difference. First operand 364 states and 495 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:04,722 INFO L93 Difference]: Finished difference Result 901 states and 1254 transitions. [2024-10-24 01:47:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:47:04,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-24 01:47:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:04,725 INFO L225 Difference]: With dead ends: 901 [2024-10-24 01:47:04,725 INFO L226 Difference]: Without dead ends: 748 [2024-10-24 01:47:04,725 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-24 01:47:04,727 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 284 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:04,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 467 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-10-24 01:47:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 591. [2024-10-24 01:47:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.383050847457627) internal successors, (816), 590 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 816 transitions. [2024-10-24 01:47:04,741 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 816 transitions. Word has length 76 [2024-10-24 01:47:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:04,742 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 816 transitions. [2024-10-24 01:47:04,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 816 transitions. [2024-10-24 01:47:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:47:04,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:04,744 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-24 01:47:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:47:04,745 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-24 01:47:04,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash 405281676, now seen corresponding path program 1 times [2024-10-24 01:47:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207428675] [2024-10-24 01:47:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:04,833 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-24 01:47:04,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:04,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207428675] [2024-10-24 01:47:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207428675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:04,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:04,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:47:04,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142948922] [2024-10-24 01:47:04,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:04,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:47:04,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:47:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:47:04,837 INFO L87 Difference]: Start difference. First operand 591 states and 816 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:04,889 INFO L93 Difference]: Finished difference Result 1052 states and 1468 transitions. [2024-10-24 01:47:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:47:04,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-24 01:47:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:04,892 INFO L225 Difference]: With dead ends: 1052 [2024-10-24 01:47:04,892 INFO L226 Difference]: Without dead ends: 899 [2024-10-24 01:47:04,893 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-24 01:47:04,893 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 286 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:04,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 416 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-10-24 01:47:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 742. [2024-10-24 01:47:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.3900134952766532) internal successors, (1030), 741 states have internal predecessors, (1030), 0 states have call successors, (0), 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-24 01:47:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1030 transitions. [2024-10-24 01:47:04,910 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1030 transitions. Word has length 76 [2024-10-24 01:47:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:04,910 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1030 transitions. [2024-10-24 01:47:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1030 transitions. [2024-10-24 01:47:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:47:04,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:04,911 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-24 01:47:04,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:47:04,912 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-24 01:47:04,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -838790076, now seen corresponding path program 1 times [2024-10-24 01:47:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:04,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737243906] [2024-10-24 01:47:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:05,017 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-24 01:47:05,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:05,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737243906] [2024-10-24 01:47:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737243906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:05,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:05,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:47:05,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130818162] [2024-10-24 01:47:05,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:05,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:47:05,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:47:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:47:05,019 INFO L87 Difference]: Start difference. First operand 742 states and 1030 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-24 01:47:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:05,040 INFO L93 Difference]: Finished difference Result 1863 states and 2601 transitions. [2024-10-24 01:47:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:47:05,043 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-24 01:47:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:05,047 INFO L225 Difference]: With dead ends: 1863 [2024-10-24 01:47:05,047 INFO L226 Difference]: Without dead ends: 1181 [2024-10-24 01:47:05,048 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-24 01:47:05,048 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 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-24 01:47:05,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2024-10-24 01:47:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1107. [2024-10-24 01:47:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1106 states have (on average 1.379746835443038) internal successors, (1526), 1106 states have internal predecessors, (1526), 0 states have call successors, (0), 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-24 01:47:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1526 transitions. [2024-10-24 01:47:05,067 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1526 transitions. Word has length 77 [2024-10-24 01:47:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:05,068 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1526 transitions. [2024-10-24 01:47:05,068 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-24 01:47:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1526 transitions. [2024-10-24 01:47:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:47:05,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:05,069 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-24 01:47:05,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:47:05,069 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-24 01:47:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash -361763827, now seen corresponding path program 1 times [2024-10-24 01:47:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628050864] [2024-10-24 01:47:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:05,136 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-24 01:47:05,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:05,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628050864] [2024-10-24 01:47:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628050864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:05,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:05,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:47:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073345020] [2024-10-24 01:47:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:05,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:47:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:05,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:47:05,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:47:05,139 INFO L87 Difference]: Start difference. First operand 1107 states and 1526 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-24 01:47:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:05,165 INFO L93 Difference]: Finished difference Result 2197 states and 3046 transitions. [2024-10-24 01:47:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:47:05,165 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-24 01:47:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:05,169 INFO L225 Difference]: With dead ends: 2197 [2024-10-24 01:47:05,169 INFO L226 Difference]: Without dead ends: 1150 [2024-10-24 01:47:05,170 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-24 01:47:05,171 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 67 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 200 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-24 01:47:05,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 200 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-10-24 01:47:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1148. [2024-10-24 01:47:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.3635571054925895) internal successors, (1564), 1147 states have internal predecessors, (1564), 0 states have call successors, (0), 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-24 01:47:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1564 transitions. [2024-10-24 01:47:05,198 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1564 transitions. Word has length 78 [2024-10-24 01:47:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:05,198 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1564 transitions. [2024-10-24 01:47:05,198 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-24 01:47:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1564 transitions. [2024-10-24 01:47:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:47:05,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:05,199 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-24 01:47:05,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:47:05,200 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-24 01:47:05,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1235003982, now seen corresponding path program 1 times [2024-10-24 01:47:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106693035] [2024-10-24 01:47:05,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:05,297 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-24 01:47:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106693035] [2024-10-24 01:47:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106693035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:47:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930679685] [2024-10-24 01:47:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:47:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:47:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:47:05,300 INFO L87 Difference]: Start difference. First operand 1148 states and 1564 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-24 01:47:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:05,323 INFO L93 Difference]: Finished difference Result 3212 states and 4368 transitions. [2024-10-24 01:47:05,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:47:05,323 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-24 01:47:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:05,329 INFO L225 Difference]: With dead ends: 3212 [2024-10-24 01:47:05,329 INFO L226 Difference]: Without dead ends: 2124 [2024-10-24 01:47:05,331 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-24 01:47:05,332 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 52 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 261 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-24 01:47:05,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-10-24 01:47:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2010. [2024-10-24 01:47:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2009 states have (on average 1.3434544549527128) internal successors, (2699), 2009 states have internal predecessors, (2699), 0 states have call successors, (0), 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-24 01:47:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2699 transitions. [2024-10-24 01:47:05,368 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2699 transitions. Word has length 78 [2024-10-24 01:47:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:05,368 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 2699 transitions. [2024-10-24 01:47:05,368 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-24 01:47:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2699 transitions. [2024-10-24 01:47:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:47:05,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:05,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:47:05,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:47:05,369 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-24 01:47:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1857807879, now seen corresponding path program 1 times [2024-10-24 01:47:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498515038] [2024-10-24 01:47:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:05,452 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-24 01:47:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:05,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498515038] [2024-10-24 01:47:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498515038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:05,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:05,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:47:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530579881] [2024-10-24 01:47:05,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:05,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:47:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:47:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:47:05,454 INFO L87 Difference]: Start difference. First operand 2010 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-24 01:47:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:05,485 INFO L93 Difference]: Finished difference Result 5686 states and 7577 transitions. [2024-10-24 01:47:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:47:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-24 01:47:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:05,496 INFO L225 Difference]: With dead ends: 5686 [2024-10-24 01:47:05,496 INFO L226 Difference]: Without dead ends: 3736 [2024-10-24 01:47:05,499 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-24 01:47:05,499 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 42 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 261 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-24 01:47:05,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 261 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2024-10-24 01:47:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3510. [2024-10-24 01:47:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3509 states have (on average 1.3123396979196351) internal successors, (4605), 3509 states have internal predecessors, (4605), 0 states have call successors, (0), 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-24 01:47:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 4605 transitions. [2024-10-24 01:47:05,562 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 4605 transitions. Word has length 79 [2024-10-24 01:47:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:05,563 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 4605 transitions. [2024-10-24 01:47:05,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-24 01:47:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 4605 transitions. [2024-10-24 01:47:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:47:05,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:05,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:47:05,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:47:05,564 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-24 01:47:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 123926530, now seen corresponding path program 1 times [2024-10-24 01:47:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476183797] [2024-10-24 01:47:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:05,782 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-24 01:47:05,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476183797] [2024-10-24 01:47:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476183797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:47:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880080147] [2024-10-24 01:47:05,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:05,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:47:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:47:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:47:05,784 INFO L87 Difference]: Start difference. First operand 3510 states and 4605 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:05,825 INFO L93 Difference]: Finished difference Result 3608 states and 4734 transitions. [2024-10-24 01:47:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:47:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-24 01:47:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:05,836 INFO L225 Difference]: With dead ends: 3608 [2024-10-24 01:47:05,836 INFO L226 Difference]: Without dead ends: 3606 [2024-10-24 01:47:05,837 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-24 01:47:05,838 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 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-24 01:47:05,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2024-10-24 01:47:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3606. [2024-10-24 01:47:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3605 states have (on average 1.2929264909847433) internal successors, (4661), 3605 states have internal predecessors, (4661), 0 states have call successors, (0), 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-24 01:47:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 4661 transitions. [2024-10-24 01:47:05,911 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 4661 transitions. Word has length 80 [2024-10-24 01:47:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:05,911 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 4661 transitions. [2024-10-24 01:47:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 4661 transitions. [2024-10-24 01:47:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 01:47:05,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:05,913 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, 1] [2024-10-24 01:47:05,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:47:05,913 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-24 01:47:05,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1385171760, now seen corresponding path program 1 times [2024-10-24 01:47:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764955407] [2024-10-24 01:47:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:06,356 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-24 01:47:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764955407] [2024-10-24 01:47:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764955407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:47:06,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194094456] [2024-10-24 01:47:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:06,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:47:06,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:47:06,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:47:06,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:47:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:06,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 01:47:06,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:47:07,346 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-24 01:47:07,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:47:08,588 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-24 01:47:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194094456] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:47:08,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:47:08,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-10-24 01:47:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236870111] [2024-10-24 01:47:08,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:47:08,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-24 01:47:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-24 01:47:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-10-24 01:47:08,592 INFO L87 Difference]: Start difference. First operand 3606 states and 4661 transitions. Second operand has 29 states, 29 states have (on average 9.448275862068966) internal successors, (274), 28 states have internal predecessors, (274), 0 states have call successors, (0), 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-24 01:47:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:13,069 INFO L93 Difference]: Finished difference Result 33523 states and 43333 transitions. [2024-10-24 01:47:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-10-24 01:47:13,070 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.448275862068966) internal successors, (274), 28 states have internal predecessors, (274), 0 states have call successors, (0), 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-24 01:47:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:13,144 INFO L225 Difference]: With dead ends: 33523 [2024-10-24 01:47:13,145 INFO L226 Difference]: Without dead ends: 29977 [2024-10-24 01:47:13,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6995 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3126, Invalid=18044, Unknown=0, NotChecked=0, Total=21170 [2024-10-24 01:47:13,163 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2169 mSDsluCounter, 2138 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:13,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 2256 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:47:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29977 states. [2024-10-24 01:47:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29977 to 18931. [2024-10-24 01:47:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18931 states, 18930 states have (on average 1.286053882725832) internal successors, (24345), 18930 states have internal predecessors, (24345), 0 states have call successors, (0), 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-24 01:47:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18931 states to 18931 states and 24345 transitions. [2024-10-24 01:47:13,665 INFO L78 Accepts]: Start accepts. Automaton has 18931 states and 24345 transitions. Word has length 102 [2024-10-24 01:47:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:13,666 INFO L471 AbstractCegarLoop]: Abstraction has 18931 states and 24345 transitions. [2024-10-24 01:47:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.448275862068966) internal successors, (274), 28 states have internal predecessors, (274), 0 states have call successors, (0), 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-24 01:47:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 18931 states and 24345 transitions. [2024-10-24 01:47:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:47:13,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:13,670 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-24 01:47:13,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 01:47:13,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-24 01:47:13,871 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-24 01:47:13,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1001508215, now seen corresponding path program 1 times [2024-10-24 01:47:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253839811] [2024-10-24 01:47:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:47:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253839811] [2024-10-24 01:47:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253839811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:47:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672189313] [2024-10-24 01:47:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:14,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:47:14,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:47:14,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:47:14,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:47:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:14,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 01:47:14,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:47:15,369 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-24 01:47:15,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:47:15,878 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-24 01:47:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672189313] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:47:15,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:47:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2024-10-24 01:47:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487119614] [2024-10-24 01:47:15,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:47:15,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 01:47:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 01:47:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2024-10-24 01:47:15,880 INFO L87 Difference]: Start difference. First operand 18931 states and 24345 transitions. Second operand has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 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-24 01:47:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:21,246 INFO L93 Difference]: Finished difference Result 86942 states and 111665 transitions. [2024-10-24 01:47:21,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-10-24 01:47:21,247 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 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 103 [2024-10-24 01:47:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:21,361 INFO L225 Difference]: With dead ends: 86942 [2024-10-24 01:47:21,361 INFO L226 Difference]: Without dead ends: 68101 [2024-10-24 01:47:21,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5630 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2900, Invalid=15732, Unknown=0, NotChecked=0, Total=18632 [2024-10-24 01:47:21,400 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 3465 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3465 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:21,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3465 Valid, 1661 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:47:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68101 states. [2024-10-24 01:47:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68101 to 46347. [2024-10-24 01:47:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46347 states, 46346 states have (on average 1.2830449229706986) internal successors, (59464), 46346 states have internal predecessors, (59464), 0 states have call successors, (0), 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-24 01:47:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46347 states to 46347 states and 59464 transitions. [2024-10-24 01:47:22,355 INFO L78 Accepts]: Start accepts. Automaton has 46347 states and 59464 transitions. Word has length 103 [2024-10-24 01:47:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:22,356 INFO L471 AbstractCegarLoop]: Abstraction has 46347 states and 59464 transitions. [2024-10-24 01:47:22,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 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-24 01:47:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 46347 states and 59464 transitions. [2024-10-24 01:47:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 01:47:22,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:22,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:47:22,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 01:47:22,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 01:47:22,568 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-24 01:47:22,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash -4760264, now seen corresponding path program 1 times [2024-10-24 01:47:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619791457] [2024-10-24 01:47:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:47:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:22,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619791457] [2024-10-24 01:47:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619791457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:47:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:47:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115624767] [2024-10-24 01:47:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:47:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:47:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:47:22,723 INFO L87 Difference]: Start difference. First operand 46347 states and 59464 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-24 01:47:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:22,978 INFO L93 Difference]: Finished difference Result 90668 states and 116320 transitions. [2024-10-24 01:47:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:47:22,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-24 01:47:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:23,041 INFO L225 Difference]: With dead ends: 90668 [2024-10-24 01:47:23,042 INFO L226 Difference]: Without dead ends: 44449 [2024-10-24 01:47:23,083 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-24 01:47:23,084 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:23,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 245 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:47:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44449 states. [2024-10-24 01:47:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44449 to 40212. [2024-10-24 01:47:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40212 states, 40211 states have (on average 1.2742284449528736) internal successors, (51238), 40211 states have internal predecessors, (51238), 0 states have call successors, (0), 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-24 01:47:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40212 states to 40212 states and 51238 transitions. [2024-10-24 01:47:23,947 INFO L78 Accepts]: Start accepts. Automaton has 40212 states and 51238 transitions. Word has length 104 [2024-10-24 01:47:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:23,947 INFO L471 AbstractCegarLoop]: Abstraction has 40212 states and 51238 transitions. [2024-10-24 01:47:23,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-24 01:47:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 40212 states and 51238 transitions. [2024-10-24 01:47:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 01:47:23,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:23,954 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, 1] [2024-10-24 01:47:23,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 01:47:23,954 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-24 01:47:23,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2074954427, now seen corresponding path program 1 times [2024-10-24 01:47:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:23,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454039899] [2024-10-24 01:47:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:24,797 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-24 01:47:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:24,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454039899] [2024-10-24 01:47:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454039899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:47:24,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626419191] [2024-10-24 01:47:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:24,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:47:24,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:47:24,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:47:24,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 01:47:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:24,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 01:47:24,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:47:25,308 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-24 01:47:25,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:47:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626419191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:47:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:47:25,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2024-10-24 01:47:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566911329] [2024-10-24 01:47:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:47:25,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:47:25,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:47:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:47:25,313 INFO L87 Difference]: Start difference. First operand 40212 states and 51238 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:25,815 INFO L93 Difference]: Finished difference Result 96598 states and 123131 transitions. [2024-10-24 01:47:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:47:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-24 01:47:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:25,895 INFO L225 Difference]: With dead ends: 96598 [2024-10-24 01:47:25,895 INFO L226 Difference]: Without dead ends: 56486 [2024-10-24 01:47:25,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-10-24 01:47:25,921 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 254 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:25,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 622 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:47:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56486 states. [2024-10-24 01:47:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56486 to 40212. [2024-10-24 01:47:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40212 states, 40211 states have (on average 1.274128969684912) internal successors, (51234), 40211 states have internal predecessors, (51234), 0 states have call successors, (0), 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-24 01:47:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40212 states to 40212 states and 51234 transitions. [2024-10-24 01:47:26,580 INFO L78 Accepts]: Start accepts. Automaton has 40212 states and 51234 transitions. Word has length 104 [2024-10-24 01:47:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:26,581 INFO L471 AbstractCegarLoop]: Abstraction has 40212 states and 51234 transitions. [2024-10-24 01:47:26,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 40212 states and 51234 transitions. [2024-10-24 01:47:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 01:47:26,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:26,587 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, 1, 1] [2024-10-24 01:47:26,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 01:47:26,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:47:26,792 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-24 01:47:26,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1006298418, now seen corresponding path program 1 times [2024-10-24 01:47:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101611942] [2024-10-24 01:47:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:27,479 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-24 01:47:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101611942] [2024-10-24 01:47:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101611942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:47:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21977302] [2024-10-24 01:47:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:27,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:47:27,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:47:27,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:47:27,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 01:47:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:27,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-24 01:47:27,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:47:32,127 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-24 01:47:32,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:47:42,213 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-24 01:47:42,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21977302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:47:42,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:47:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 25] total 59 [2024-10-24 01:47:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126066936] [2024-10-24 01:47:42,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:47:42,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-24 01:47:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:42,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-24 01:47:42,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3125, Unknown=1, NotChecked=0, Total=3422 [2024-10-24 01:47:42,217 INFO L87 Difference]: Start difference. First operand 40212 states and 51234 transitions. Second operand has 59 states, 59 states have (on average 4.8474576271186445) internal successors, (286), 59 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)