./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.1.ufo.UNBOUNDED.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 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:26:12,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:26:12,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:26:12,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:26:12,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:26:12,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:26:12,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:26:12,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:26:12,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:26:12,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:26:12,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:26:12,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:26:12,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:26:12,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:26:12,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:26:12,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:26:12,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:26:12,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:26:12,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:26:12,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:26:12,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:26:12,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:26:12,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:26:12,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:26:12,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:26:12,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:26:12,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:26:12,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:26:12,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:26:12,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:26:12,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:26:12,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:26:12,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:26:12,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:26:12,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:26:12,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:26:12,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:26:12,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:26:12,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:26:12,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:26:12,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:26:12,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:26:12,686 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 -> 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 [2024-10-12 20:26:12,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:26:12,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:26:12,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:26:12,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:26:12,982 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:26:12,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-12 20:26:14,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:26:14,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:26:14,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-12 20:26:14,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9443f7f5e/4c5100e961514eaab1a1f84217959b0a/FLAGf57dce1ee [2024-10-12 20:26:15,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9443f7f5e/4c5100e961514eaab1a1f84217959b0a [2024-10-12 20:26:15,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:26:15,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:26:15,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:26:15,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:26:15,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:26:15,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031cc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15, skipping insertion in model container [2024-10-12 20:26:15,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:26:15,356 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2024-10-12 20:26:15,403 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2024-10-12 20:26:15,445 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2024-10-12 20:26:15,469 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2024-10-12 20:26:15,489 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2024-10-12 20:26:15,505 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2024-10-12 20:26:15,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2024-10-12 20:26:15,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:26:15,557 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:26:15,599 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2024-10-12 20:26:15,611 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2024-10-12 20:26:15,623 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2024-10-12 20:26:15,634 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2024-10-12 20:26:15,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2024-10-12 20:26:15,665 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2024-10-12 20:26:15,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2024-10-12 20:26:15,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:26:15,742 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:26:15,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15 WrapperNode [2024-10-12 20:26:15,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:26:15,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:26:15,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:26:15,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:26:15,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,818 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1340 [2024-10-12 20:26:15,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:26:15,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:26:15,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:26:15,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:26:15,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,869 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-12 20:26:15,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:26:15,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:26:15,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:26:15,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:26:15,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (1/1) ... [2024-10-12 20:26:15,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:26:15,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:15,975 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-12 20:26:15,981 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-12 20:26:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:26:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:26:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:26:16,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:26:16,151 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:26:16,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:26:17,117 INFO L? ?]: Removed 222 outVars from TransFormulas that were not future-live. [2024-10-12 20:26:17,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:26:17,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:26:17,166 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:26:17,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:26:17 BoogieIcfgContainer [2024-10-12 20:26:17,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:26:17,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:26:17,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:26:17,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:26:17,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:26:15" (1/3) ... [2024-10-12 20:26:17,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@852357d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:26:17, skipping insertion in model container [2024-10-12 20:26:17,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:26:15" (2/3) ... [2024-10-12 20:26:17,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@852357d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:26:17, skipping insertion in model container [2024-10-12 20:26:17,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:26:17" (3/3) ... [2024-10-12 20:26:17,179 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-12 20:26:17,197 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:26:17,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-12 20:26:17,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:26:17,282 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;@326573a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:26:17,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-12 20:26:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 256 states have (on average 1.8359375) internal successors, (470), 263 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 20:26:17,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:17,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:17,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:17,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1557733902, now seen corresponding path program 1 times [2024-10-12 20:26:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324757536] [2024-10-12 20:26:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:17,821 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-12 20:26:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:17,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324757536] [2024-10-12 20:26:17,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324757536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:26:17,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678390793] [2024-10-12 20:26:17,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:17,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:17,855 INFO L87 Difference]: Start difference. First operand has 264 states, 256 states have (on average 1.8359375) internal successors, (470), 263 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:18,195 INFO L93 Difference]: Finished difference Result 370 states and 637 transitions. [2024-10-12 20:26:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 20:26:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:18,208 INFO L225 Difference]: With dead ends: 370 [2024-10-12 20:26:18,209 INFO L226 Difference]: Without dead ends: 230 [2024-10-12 20:26:18,212 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-12 20:26:18,218 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1109 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:18,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 273 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:26:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-12 20:26:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2024-10-12 20:26:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 229 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 287 transitions. [2024-10-12 20:26:18,279 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 287 transitions. Word has length 46 [2024-10-12 20:26:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:18,280 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 287 transitions. [2024-10-12 20:26:18,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 287 transitions. [2024-10-12 20:26:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 20:26:18,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:18,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:18,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:26:18,285 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-12 20:26:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 902036529, now seen corresponding path program 1 times [2024-10-12 20:26:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507073132] [2024-10-12 20:26:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:18,475 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-12 20:26:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507073132] [2024-10-12 20:26:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507073132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:18,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:18,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:26:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975750207] [2024-10-12 20:26:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:18,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:18,480 INFO L87 Difference]: Start difference. First operand 230 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:18,650 INFO L93 Difference]: Finished difference Result 298 states and 375 transitions. [2024-10-12 20:26:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 20:26:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:18,653 INFO L225 Difference]: With dead ends: 298 [2024-10-12 20:26:18,655 INFO L226 Difference]: Without dead ends: 176 [2024-10-12 20:26:18,656 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-12 20:26:18,658 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 615 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:18,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 135 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-12 20:26:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-10-12 20:26:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 175 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 218 transitions. [2024-10-12 20:26:18,669 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 218 transitions. Word has length 46 [2024-10-12 20:26:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:18,670 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 218 transitions. [2024-10-12 20:26:18,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 218 transitions. [2024-10-12 20:26:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 20:26:18,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:18,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:18,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:26:18,672 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-12 20:26:18,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:18,673 INFO L85 PathProgramCache]: Analyzing trace with hash -996423807, now seen corresponding path program 1 times [2024-10-12 20:26:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37071610] [2024-10-12 20:26:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:18,832 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-12 20:26:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:18,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37071610] [2024-10-12 20:26:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37071610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:18,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:26:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312742392] [2024-10-12 20:26:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:18,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:18,838 INFO L87 Difference]: Start difference. First operand 176 states and 218 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:19,010 INFO L93 Difference]: Finished difference Result 338 states and 434 transitions. [2024-10-12 20:26:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 20:26:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:19,013 INFO L225 Difference]: With dead ends: 338 [2024-10-12 20:26:19,014 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 20:26:19,014 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-12 20:26:19,015 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 768 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:19,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 188 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 20:26:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2024-10-12 20:26:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 213 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 280 transitions. [2024-10-12 20:26:19,030 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 280 transitions. Word has length 46 [2024-10-12 20:26:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:19,030 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 280 transitions. [2024-10-12 20:26:19,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 280 transitions. [2024-10-12 20:26:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:26:19,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:19,036 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-12 20:26:19,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:26:19,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:19,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 640925669, now seen corresponding path program 1 times [2024-10-12 20:26:19,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:19,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672815908] [2024-10-12 20:26:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:19,335 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-12 20:26:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672815908] [2024-10-12 20:26:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672815908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435310987] [2024-10-12 20:26:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:19,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:19,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:19,337 INFO L87 Difference]: Start difference. First operand 214 states and 280 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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-12 20:26:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:19,681 INFO L93 Difference]: Finished difference Result 357 states and 473 transitions. [2024-10-12 20:26:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:26:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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-12 20:26:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:19,683 INFO L225 Difference]: With dead ends: 357 [2024-10-12 20:26:19,683 INFO L226 Difference]: Without dead ends: 352 [2024-10-12 20:26:19,684 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-12 20:26:19,684 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 402 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:19,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 551 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-12 20:26:19,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 214. [2024-10-12 20:26:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 213 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2024-10-12 20:26:19,708 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 47 [2024-10-12 20:26:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:19,709 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2024-10-12 20:26:19,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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-12 20:26:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2024-10-12 20:26:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:26:19,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:19,710 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-12 20:26:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:26:19,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1888903618, now seen corresponding path program 1 times [2024-10-12 20:26:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706179411] [2024-10-12 20:26:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:20,035 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-12 20:26:20,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:20,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706179411] [2024-10-12 20:26:20,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706179411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:20,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:20,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:20,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372631845] [2024-10-12 20:26:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:20,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:20,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:20,041 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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-12 20:26:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:20,427 INFO L93 Difference]: Finished difference Result 402 states and 540 transitions. [2024-10-12 20:26:20,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:26:20,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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-12 20:26:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:20,429 INFO L225 Difference]: With dead ends: 402 [2024-10-12 20:26:20,432 INFO L226 Difference]: Without dead ends: 301 [2024-10-12 20:26:20,433 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-12 20:26:20,434 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 568 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:20,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 623 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:26:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-12 20:26:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 214. [2024-10-12 20:26:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 213 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 278 transitions. [2024-10-12 20:26:20,448 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 278 transitions. Word has length 47 [2024-10-12 20:26:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:20,448 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 278 transitions. [2024-10-12 20:26:20,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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-12 20:26:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 278 transitions. [2024-10-12 20:26:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:26:20,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:20,450 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-12 20:26:20,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:26:20,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash -367947433, now seen corresponding path program 1 times [2024-10-12 20:26:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757236933] [2024-10-12 20:26:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:20,678 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-12 20:26:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757236933] [2024-10-12 20:26:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757236933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:26:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873143235] [2024-10-12 20:26:20,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:26:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:26:20,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:26:20,681 INFO L87 Difference]: Start difference. First operand 214 states and 278 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 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-12 20:26:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:20,983 INFO L93 Difference]: Finished difference Result 458 states and 613 transitions. [2024-10-12 20:26:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:26:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 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-12 20:26:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:20,986 INFO L225 Difference]: With dead ends: 458 [2024-10-12 20:26:20,986 INFO L226 Difference]: Without dead ends: 334 [2024-10-12 20:26:20,987 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-12 20:26:20,987 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 522 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:20,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 513 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-12 20:26:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 214. [2024-10-12 20:26:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3381642512077294) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2024-10-12 20:26:20,994 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 47 [2024-10-12 20:26:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2024-10-12 20:26:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 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-12 20:26:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2024-10-12 20:26:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:26:20,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:20,996 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-12 20:26:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:26:20,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash 233049586, now seen corresponding path program 1 times [2024-10-12 20:26:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935392444] [2024-10-12 20:26:20,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:22,075 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-12 20:26:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935392444] [2024-10-12 20:26:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935392444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:22,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:22,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-12 20:26:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18271674] [2024-10-12 20:26:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:22,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:26:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:26:22,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:26:22,078 INFO L87 Difference]: Start difference. First operand 214 states and 277 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 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-12 20:26:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:23,306 INFO L93 Difference]: Finished difference Result 446 states and 596 transitions. [2024-10-12 20:26:23,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:26:23,306 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 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-12 20:26:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:23,308 INFO L225 Difference]: With dead ends: 446 [2024-10-12 20:26:23,308 INFO L226 Difference]: Without dead ends: 442 [2024-10-12 20:26:23,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 20:26:23,310 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 888 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:23,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 2101 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:26:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-12 20:26:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 218. [2024-10-12 20:26:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 211 states have (on average 1.3412322274881516) internal successors, (283), 217 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2024-10-12 20:26:23,321 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 49 [2024-10-12 20:26:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:23,321 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2024-10-12 20:26:23,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 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-12 20:26:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2024-10-12 20:26:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:26:23,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:23,322 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-12 20:26:23,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:26:23,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:23,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:23,324 INFO L85 PathProgramCache]: Analyzing trace with hash 80464025, now seen corresponding path program 1 times [2024-10-12 20:26:23,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:23,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951231180] [2024-10-12 20:26:23,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:23,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:23,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-12 20:26:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951231180] [2024-10-12 20:26:23,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951231180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:23,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:26:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195432295] [2024-10-12 20:26:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:23,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:26:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:23,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:26:23,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:26:23,859 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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-12 20:26:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:24,536 INFO L93 Difference]: Finished difference Result 658 states and 902 transitions. [2024-10-12 20:26:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:26:24,537 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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-12 20:26:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:24,541 INFO L225 Difference]: With dead ends: 658 [2024-10-12 20:26:24,541 INFO L226 Difference]: Without dead ends: 570 [2024-10-12 20:26:24,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:26:24,543 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1355 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:24,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1134 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:26:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-12 20:26:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 214. [2024-10-12 20:26:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 213 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 278 transitions. [2024-10-12 20:26:24,558 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 278 transitions. Word has length 49 [2024-10-12 20:26:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:24,559 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 278 transitions. [2024-10-12 20:26:24,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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-12 20:26:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 278 transitions. [2024-10-12 20:26:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:26:24,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:24,561 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-12 20:26:24,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:26:24,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:24,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 94533632, now seen corresponding path program 1 times [2024-10-12 20:26:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836078119] [2024-10-12 20:26:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:24,986 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-12 20:26:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836078119] [2024-10-12 20:26:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836078119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:24,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:24,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:26:24,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172273242] [2024-10-12 20:26:24,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:26:24,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:26:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:26:24,991 INFO L87 Difference]: Start difference. First operand 214 states and 278 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-12 20:26:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:25,353 INFO L93 Difference]: Finished difference Result 404 states and 555 transitions. [2024-10-12 20:26:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:26:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-12 20:26:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:25,355 INFO L225 Difference]: With dead ends: 404 [2024-10-12 20:26:25,355 INFO L226 Difference]: Without dead ends: 291 [2024-10-12 20:26:25,355 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-12 20:26:25,356 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 484 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:25,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 592 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-12 20:26:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 185. [2024-10-12 20:26:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 184 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 244 transitions. [2024-10-12 20:26:25,361 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 244 transitions. Word has length 49 [2024-10-12 20:26:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:25,362 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 244 transitions. [2024-10-12 20:26:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-12 20:26:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2024-10-12 20:26:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:26:25,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:25,362 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-12 20:26:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:26:25,363 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-12 20:26:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1905877059, now seen corresponding path program 1 times [2024-10-12 20:26:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942465237] [2024-10-12 20:26:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:25,555 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-12 20:26:25,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:25,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942465237] [2024-10-12 20:26:25,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942465237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:25,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:25,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114981985] [2024-10-12 20:26:25,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:25,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:25,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:25,558 INFO L87 Difference]: Start difference. First operand 185 states and 244 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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-12 20:26:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:25,794 INFO L93 Difference]: Finished difference Result 312 states and 419 transitions. [2024-10-12 20:26:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:26:25,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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-12 20:26:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:25,796 INFO L225 Difference]: With dead ends: 312 [2024-10-12 20:26:25,796 INFO L226 Difference]: Without dead ends: 305 [2024-10-12 20:26:25,796 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-12 20:26:25,797 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 431 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:25,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 380 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-12 20:26:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 185. [2024-10-12 20:26:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.3370165745856353) internal successors, (242), 184 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 242 transitions. [2024-10-12 20:26:25,803 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 242 transitions. Word has length 50 [2024-10-12 20:26:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:25,803 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 242 transitions. [2024-10-12 20:26:25,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 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-12 20:26:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2024-10-12 20:26:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:26:25,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:25,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:26:25,804 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-12 20:26:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash 56983254, now seen corresponding path program 1 times [2024-10-12 20:26:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979342033] [2024-10-12 20:26:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:26,115 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-12 20:26:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979342033] [2024-10-12 20:26:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979342033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:26:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125427758] [2024-10-12 20:26:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:26,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:26:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:26:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:26:26,118 INFO L87 Difference]: Start difference. First operand 185 states and 242 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:26,476 INFO L93 Difference]: Finished difference Result 336 states and 456 transitions. [2024-10-12 20:26:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:26:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-12 20:26:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:26,477 INFO L225 Difference]: With dead ends: 336 [2024-10-12 20:26:26,477 INFO L226 Difference]: Without dead ends: 222 [2024-10-12 20:26:26,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:26:26,478 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 413 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:26,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 498 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-12 20:26:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 185. [2024-10-12 20:26:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.3259668508287292) internal successors, (240), 184 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2024-10-12 20:26:26,482 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 50 [2024-10-12 20:26:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:26,483 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2024-10-12 20:26:26,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2024-10-12 20:26:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:26:26,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:26,484 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-12 20:26:26,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:26:26,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:26,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1065738822, now seen corresponding path program 1 times [2024-10-12 20:26:26,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:26,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776779912] [2024-10-12 20:26:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:26,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:27,090 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-12 20:26:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776779912] [2024-10-12 20:26:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776779912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 20:26:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413855524] [2024-10-12 20:26:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:27,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 20:26:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 20:26:27,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:26:27,093 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 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-12 20:26:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:27,539 INFO L93 Difference]: Finished difference Result 185 states and 240 transitions. [2024-10-12 20:26:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:26:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 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-12 20:26:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:27,540 INFO L225 Difference]: With dead ends: 185 [2024-10-12 20:26:27,541 INFO L226 Difference]: Without dead ends: 165 [2024-10-12 20:26:27,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:26:27,541 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 154 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:27,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 720 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-12 20:26:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-12 20:26:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.3312883435582823) internal successors, (217), 164 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2024-10-12 20:26:27,546 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 50 [2024-10-12 20:26:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:27,547 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2024-10-12 20:26:27,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 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-12 20:26:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2024-10-12 20:26:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:26:27,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:27,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:27,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:26:27,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:27,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -893080879, now seen corresponding path program 1 times [2024-10-12 20:26:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169393749] [2024-10-12 20:26:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:28,188 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-12 20:26:28,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169393749] [2024-10-12 20:26:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169393749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 20:26:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18885188] [2024-10-12 20:26:28,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:28,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 20:26:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 20:26:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:26:28,192 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:28,855 INFO L93 Difference]: Finished difference Result 275 states and 373 transitions. [2024-10-12 20:26:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:26:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:26:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:28,857 INFO L225 Difference]: With dead ends: 275 [2024-10-12 20:26:28,857 INFO L226 Difference]: Without dead ends: 269 [2024-10-12 20:26:28,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2024-10-12 20:26:28,858 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 264 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:28,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1251 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:26:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-12 20:26:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 171. [2024-10-12 20:26:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.331360946745562) internal successors, (225), 170 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2024-10-12 20:26:28,863 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 52 [2024-10-12 20:26:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:28,864 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2024-10-12 20:26:28,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2024-10-12 20:26:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:26:28,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:28,866 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-12 20:26:28,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:26:28,866 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-12 20:26:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash -208243913, now seen corresponding path program 1 times [2024-10-12 20:26:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733081225] [2024-10-12 20:26:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:29,263 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-12 20:26:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733081225] [2024-10-12 20:26:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733081225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:26:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110577495] [2024-10-12 20:26:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:29,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:26:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:26:29,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:26:29,266 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-12 20:26:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:29,578 INFO L93 Difference]: Finished difference Result 275 states and 376 transitions. [2024-10-12 20:26:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:26:29,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-12 20:26:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:29,579 INFO L225 Difference]: With dead ends: 275 [2024-10-12 20:26:29,579 INFO L226 Difference]: Without dead ends: 269 [2024-10-12 20:26:29,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-10-12 20:26:29,581 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 343 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:29,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 756 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-12 20:26:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 159. [2024-10-12 20:26:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 158 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2024-10-12 20:26:29,585 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 53 [2024-10-12 20:26:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:29,586 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2024-10-12 20:26:29,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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-12 20:26:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2024-10-12 20:26:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 20:26:29,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:29,587 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] [2024-10-12 20:26:29,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:26:29,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:29,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1062013184, now seen corresponding path program 1 times [2024-10-12 20:26:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:29,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230779407] [2024-10-12 20:26:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:29,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-12 20:26:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230779407] [2024-10-12 20:26:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230779407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211132581] [2024-10-12 20:26:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:29,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:29,672 INFO L87 Difference]: Start difference. First operand 159 states and 210 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:29,744 INFO L93 Difference]: Finished difference Result 663 states and 978 transitions. [2024-10-12 20:26:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:26:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 20:26:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:29,747 INFO L225 Difference]: With dead ends: 663 [2024-10-12 20:26:29,747 INFO L226 Difference]: Without dead ends: 579 [2024-10-12 20:26:29,747 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-12 20:26:29,748 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 492 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:29,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 504 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-12 20:26:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 241. [2024-10-12 20:26:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.3875) internal successors, (333), 240 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2024-10-12 20:26:29,755 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 70 [2024-10-12 20:26:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:29,755 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2024-10-12 20:26:29,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2024-10-12 20:26:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:26:29,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:29,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:29,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:26:29,757 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-12 20:26:29,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1740451689, now seen corresponding path program 1 times [2024-10-12 20:26:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:29,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199236249] [2024-10-12 20:26:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:29,853 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-12 20:26:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199236249] [2024-10-12 20:26:29,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199236249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:29,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:29,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974605818] [2024-10-12 20:26:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:29,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:29,855 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:29,909 INFO L93 Difference]: Finished difference Result 823 states and 1210 transitions. [2024-10-12 20:26:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:29,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:26:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:29,912 INFO L225 Difference]: With dead ends: 823 [2024-10-12 20:26:29,912 INFO L226 Difference]: Without dead ends: 657 [2024-10-12 20:26:29,912 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-12 20:26:29,913 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 292 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:29,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 428 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-12 20:26:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 405. [2024-10-12 20:26:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.438118811881188) internal successors, (581), 404 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2024-10-12 20:26:29,921 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 72 [2024-10-12 20:26:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:29,922 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2024-10-12 20:26:29,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2024-10-12 20:26:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:26:29,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:29,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:29,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:26:29,923 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-12 20:26:29,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1106785176, now seen corresponding path program 1 times [2024-10-12 20:26:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091327840] [2024-10-12 20:26:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:30,053 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-12 20:26:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091327840] [2024-10-12 20:26:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091327840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:30,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:30,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052364349] [2024-10-12 20:26:30,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:30,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:30,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:30,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:30,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:30,056 INFO L87 Difference]: Start difference. First operand 405 states and 581 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:30,105 INFO L93 Difference]: Finished difference Result 737 states and 1081 transitions. [2024-10-12 20:26:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:26:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:30,107 INFO L225 Difference]: With dead ends: 737 [2024-10-12 20:26:30,108 INFO L226 Difference]: Without dead ends: 407 [2024-10-12 20:26:30,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:26:30,108 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 108 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:30,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 237 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-12 20:26:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-10-12 20:26:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.4282178217821782) internal successors, (577), 404 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 577 transitions. [2024-10-12 20:26:30,116 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 577 transitions. Word has length 72 [2024-10-12 20:26:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:30,116 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 577 transitions. [2024-10-12 20:26:30,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 577 transitions. [2024-10-12 20:26:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:26:30,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:30,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:30,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:26:30,118 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-12 20:26:30,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1040291664, now seen corresponding path program 1 times [2024-10-12 20:26:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259397904] [2024-10-12 20:26:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:30,167 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-12 20:26:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259397904] [2024-10-12 20:26:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259397904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197829659] [2024-10-12 20:26:30,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:30,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:30,170 INFO L87 Difference]: Start difference. First operand 405 states and 577 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:30,195 INFO L93 Difference]: Finished difference Result 1013 states and 1479 transitions. [2024-10-12 20:26:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:30,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:26:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:30,198 INFO L225 Difference]: With dead ends: 1013 [2024-10-12 20:26:30,198 INFO L226 Difference]: Without dead ends: 683 [2024-10-12 20:26:30,198 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-12 20:26:30,199 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:30,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-12 20:26:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 673. [2024-10-12 20:26:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.4211309523809523) internal successors, (955), 672 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 955 transitions. [2024-10-12 20:26:30,211 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 955 transitions. Word has length 72 [2024-10-12 20:26:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:30,211 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 955 transitions. [2024-10-12 20:26:30,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 955 transitions. [2024-10-12 20:26:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:26:30,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:30,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:26:30,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:26:30,213 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-12 20:26:30,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1125773673, now seen corresponding path program 1 times [2024-10-12 20:26:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030172086] [2024-10-12 20:26:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:30,295 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-12 20:26:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030172086] [2024-10-12 20:26:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030172086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:30,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110945432] [2024-10-12 20:26:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:30,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:30,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:30,298 INFO L87 Difference]: Start difference. First operand 673 states and 955 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:30,359 INFO L93 Difference]: Finished difference Result 1725 states and 2489 transitions. [2024-10-12 20:26:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:30,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-12 20:26:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:30,364 INFO L225 Difference]: With dead ends: 1725 [2024-10-12 20:26:30,364 INFO L226 Difference]: Without dead ends: 1425 [2024-10-12 20:26:30,364 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-12 20:26:30,365 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 292 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:30,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 442 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-10-12 20:26:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1121. [2024-10-12 20:26:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4330357142857142) internal successors, (1605), 1120 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1605 transitions. [2024-10-12 20:26:30,385 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1605 transitions. Word has length 72 [2024-10-12 20:26:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:30,385 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1605 transitions. [2024-10-12 20:26:30,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1605 transitions. [2024-10-12 20:26:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:26:30,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:30,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:30,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:26:30,387 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-12 20:26:30,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash -265469296, now seen corresponding path program 1 times [2024-10-12 20:26:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320991959] [2024-10-12 20:26:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:30,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:30,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-12 20:26:30,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:30,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320991959] [2024-10-12 20:26:30,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320991959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:30,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:30,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877230485] [2024-10-12 20:26:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:30,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:30,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:30,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:30,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:30,448 INFO L87 Difference]: Start difference. First operand 1121 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:30,481 INFO L93 Difference]: Finished difference Result 2525 states and 3650 transitions. [2024-10-12 20:26:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-12 20:26:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:30,487 INFO L225 Difference]: With dead ends: 2525 [2024-10-12 20:26:30,487 INFO L226 Difference]: Without dead ends: 1479 [2024-10-12 20:26:30,488 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-12 20:26:30,489 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:30,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 279 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-10-12 20:26:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1461. [2024-10-12 20:26:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.4246575342465753) internal successors, (2080), 1460 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2080 transitions. [2024-10-12 20:26:30,520 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2080 transitions. Word has length 73 [2024-10-12 20:26:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:30,521 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2080 transitions. [2024-10-12 20:26:30,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2080 transitions. [2024-10-12 20:26:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:26:30,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:30,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:30,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:26:30,523 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-12 20:26:30,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1631774551, now seen corresponding path program 1 times [2024-10-12 20:26:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:30,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351074001] [2024-10-12 20:26:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:30,625 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-12 20:26:30,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351074001] [2024-10-12 20:26:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351074001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:26:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351980670] [2024-10-12 20:26:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:30,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:26:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:26:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:26:30,627 INFO L87 Difference]: Start difference. First operand 1461 states and 2080 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:30,687 INFO L93 Difference]: Finished difference Result 2675 states and 3838 transitions. [2024-10-12 20:26:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:26:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-12 20:26:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:30,694 INFO L225 Difference]: With dead ends: 2675 [2024-10-12 20:26:30,694 INFO L226 Difference]: Without dead ends: 2265 [2024-10-12 20:26:30,696 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-12 20:26:30,696 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 289 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:30,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 463 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-10-12 20:26:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 1851. [2024-10-12 20:26:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1850 states have (on average 1.4281081081081082) internal successors, (2642), 1850 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2642 transitions. [2024-10-12 20:26:30,739 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2642 transitions. Word has length 73 [2024-10-12 20:26:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:30,740 INFO L471 AbstractCegarLoop]: Abstraction has 1851 states and 2642 transitions. [2024-10-12 20:26:30,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2642 transitions. [2024-10-12 20:26:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:26:30,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:30,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:30,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:26:30,742 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-12 20:26:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash -437607184, now seen corresponding path program 1 times [2024-10-12 20:26:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908811134] [2024-10-12 20:26:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:30,836 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-12 20:26:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908811134] [2024-10-12 20:26:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908811134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:30,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:30,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49428483] [2024-10-12 20:26:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:30,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:30,840 INFO L87 Difference]: Start difference. First operand 1851 states and 2642 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:30,873 INFO L93 Difference]: Finished difference Result 5187 states and 7384 transitions. [2024-10-12 20:26:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-12 20:26:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:30,886 INFO L225 Difference]: With dead ends: 5187 [2024-10-12 20:26:30,886 INFO L226 Difference]: Without dead ends: 3411 [2024-10-12 20:26:30,889 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-12 20:26:30,889 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 55 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:30,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2024-10-12 20:26:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 3193. [2024-10-12 20:26:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3192 states have (on average 1.4094611528822054) internal successors, (4499), 3192 states have internal predecessors, (4499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4499 transitions. [2024-10-12 20:26:30,955 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4499 transitions. Word has length 73 [2024-10-12 20:26:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4499 transitions. [2024-10-12 20:26:30,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4499 transitions. [2024-10-12 20:26:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:26:30,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:30,956 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-12 20:26:30,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:26:30,957 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-12 20:26:30,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2125552703, now seen corresponding path program 1 times [2024-10-12 20:26:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:30,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055751760] [2024-10-12 20:26:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:31,062 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-12 20:26:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:31,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055751760] [2024-10-12 20:26:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055751760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:31,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:31,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780711119] [2024-10-12 20:26:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:31,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:31,064 INFO L87 Difference]: Start difference. First operand 3193 states and 4499 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:31,111 INFO L93 Difference]: Finished difference Result 8997 states and 12577 transitions. [2024-10-12 20:26:31,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:31,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-12 20:26:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:31,132 INFO L225 Difference]: With dead ends: 8997 [2024-10-12 20:26:31,133 INFO L226 Difference]: Without dead ends: 5879 [2024-10-12 20:26:31,139 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-12 20:26:31,140 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 255 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-12 20:26:31,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 255 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2024-10-12 20:26:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5445. [2024-10-12 20:26:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5445 states, 5444 states have (on average 1.3796840558412933) internal successors, (7511), 5444 states have internal predecessors, (7511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 7511 transitions. [2024-10-12 20:26:31,256 INFO L78 Accepts]: Start accepts. Automaton has 5445 states and 7511 transitions. Word has length 74 [2024-10-12 20:26:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:31,256 INFO L471 AbstractCegarLoop]: Abstraction has 5445 states and 7511 transitions. [2024-10-12 20:26:31,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5445 states and 7511 transitions. [2024-10-12 20:26:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:26:31,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:31,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:31,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:26:31,258 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-12 20:26:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash -946215132, now seen corresponding path program 1 times [2024-10-12 20:26:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944139631] [2024-10-12 20:26:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:31,459 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-12 20:26:31,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944139631] [2024-10-12 20:26:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944139631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:31,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:31,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:26:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162312050] [2024-10-12 20:26:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:31,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:26:31,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:31,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:26:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:26:31,462 INFO L87 Difference]: Start difference. First operand 5445 states and 7511 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:31,507 INFO L93 Difference]: Finished difference Result 5543 states and 7640 transitions. [2024-10-12 20:26:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:26:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:26:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:31,528 INFO L225 Difference]: With dead ends: 5543 [2024-10-12 20:26:31,528 INFO L226 Difference]: Without dead ends: 5541 [2024-10-12 20:26:31,531 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-12 20:26:31,531 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:31,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 592 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5541 states. [2024-10-12 20:26:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5541 to 5541. [2024-10-12 20:26:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5540 states have (on average 1.3658844765342961) internal successors, (7567), 5540 states have internal predecessors, (7567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7567 transitions. [2024-10-12 20:26:31,666 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7567 transitions. Word has length 75 [2024-10-12 20:26:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:31,666 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 7567 transitions. [2024-10-12 20:26:31,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7567 transitions. [2024-10-12 20:26:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:26:31,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:31,667 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-12 20:26:31,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:26:31,667 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-12 20:26:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1346024867, now seen corresponding path program 1 times [2024-10-12 20:26:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:31,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086686332] [2024-10-12 20:26:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086686332] [2024-10-12 20:26:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086686332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084234664] [2024-10-12 20:26:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:31,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:31,748 INFO L87 Difference]: Start difference. First operand 5541 states and 7567 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-12 20:26:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:31,801 INFO L93 Difference]: Finished difference Result 12849 states and 17505 transitions. [2024-10-12 20:26:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:31,802 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-12 20:26:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:31,826 INFO L225 Difference]: With dead ends: 12849 [2024-10-12 20:26:31,826 INFO L226 Difference]: Without dead ends: 7383 [2024-10-12 20:26:31,833 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-12 20:26:31,834 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 257 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-12 20:26:31,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2024-10-12 20:26:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6773. [2024-10-12 20:26:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6773 states, 6772 states have (on average 1.333579444772593) internal successors, (9031), 6772 states have internal predecessors, (9031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 9031 transitions. [2024-10-12 20:26:31,951 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 9031 transitions. Word has length 76 [2024-10-12 20:26:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:31,951 INFO L471 AbstractCegarLoop]: Abstraction has 6773 states and 9031 transitions. [2024-10-12 20:26:31,952 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-12 20:26:31,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 9031 transitions. [2024-10-12 20:26:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:26:31,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:31,955 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] [2024-10-12 20:26:31,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:26:31,955 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-12 20:26:31,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 138540374, now seen corresponding path program 1 times [2024-10-12 20:26:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:31,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953193515] [2024-10-12 20:26:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953193515] [2024-10-12 20:26:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953193515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288156605] [2024-10-12 20:26:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:32,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:32,347 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-12 20:26:32,349 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-12 20:26:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:32,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 20:26:32,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:33,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288156605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:34,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-12 20:26:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819459854] [2024-10-12 20:26:34,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 20:26:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 20:26:34,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:26:34,419 INFO L87 Difference]: Start difference. First operand 6773 states and 9031 transitions. Second operand has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 26 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:38,904 INFO L93 Difference]: Finished difference Result 64542 states and 85423 transitions. [2024-10-12 20:26:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-10-12 20:26:38,905 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 26 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:26:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:39,017 INFO L225 Difference]: With dead ends: 64542 [2024-10-12 20:26:39,017 INFO L226 Difference]: Without dead ends: 57844 [2024-10-12 20:26:39,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6930 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2867, Invalid=17725, Unknown=0, NotChecked=0, Total=20592 [2024-10-12 20:26:39,055 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 2723 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:39,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2723 Valid, 1944 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:26:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57844 states. [2024-10-12 20:26:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57844 to 25463. [2024-10-12 20:26:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25463 states, 25462 states have (on average 1.32177362343885) internal successors, (33655), 25462 states have internal predecessors, (33655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25463 states to 25463 states and 33655 transitions. [2024-10-12 20:26:39,879 INFO L78 Accepts]: Start accepts. Automaton has 25463 states and 33655 transitions. Word has length 97 [2024-10-12 20:26:39,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:39,880 INFO L471 AbstractCegarLoop]: Abstraction has 25463 states and 33655 transitions. [2024-10-12 20:26:39,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 26 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25463 states and 33655 transitions. [2024-10-12 20:26:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:26:39,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:39,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:39,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:26:40,087 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,SelfDestructingSolverStorable25 [2024-10-12 20:26:40,088 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-12 20:26:40,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:40,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1032865704, now seen corresponding path program 1 times [2024-10-12 20:26:40,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:40,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487024408] [2024-10-12 20:26:40,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:40,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487024408] [2024-10-12 20:26:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487024408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:40,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449879149] [2024-10-12 20:26:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:40,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:40,206 INFO L87 Difference]: Start difference. First operand 25463 states and 33655 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-12 20:26:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:40,394 INFO L93 Difference]: Finished difference Result 50086 states and 66234 transitions. [2024-10-12 20:26:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:40,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:26:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:40,443 INFO L225 Difference]: With dead ends: 50086 [2024-10-12 20:26:40,443 INFO L226 Difference]: Without dead ends: 24705 [2024-10-12 20:26:40,473 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-12 20:26:40,473 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 237 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-12 20:26:40,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24705 states. [2024-10-12 20:26:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24705 to 24528. [2024-10-12 20:26:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24528 states, 24527 states have (on average 1.2962041831451054) internal successors, (31792), 24527 states have internal predecessors, (31792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24528 states to 24528 states and 31792 transitions. [2024-10-12 20:26:41,128 INFO L78 Accepts]: Start accepts. Automaton has 24528 states and 31792 transitions. Word has length 97 [2024-10-12 20:26:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:41,128 INFO L471 AbstractCegarLoop]: Abstraction has 24528 states and 31792 transitions. [2024-10-12 20:26:41,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-12 20:26:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 24528 states and 31792 transitions. [2024-10-12 20:26:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:26:41,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:41,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:41,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:26:41,133 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-12 20:26:41,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash -992643637, now seen corresponding path program 1 times [2024-10-12 20:26:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:41,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773599321] [2024-10-12 20:26:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:26:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773599321] [2024-10-12 20:26:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773599321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:26:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201882288] [2024-10-12 20:26:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:41,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:41,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:41,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:26:41,351 INFO L87 Difference]: Start difference. First operand 24528 states and 31792 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:41,782 INFO L93 Difference]: Finished difference Result 74289 states and 96071 transitions. [2024-10-12 20:26:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:26:41,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 20:26:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:41,850 INFO L225 Difference]: With dead ends: 74289 [2024-10-12 20:26:41,850 INFO L226 Difference]: Without dead ends: 49831 [2024-10-12 20:26:41,880 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-12 20:26:41,881 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 252 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:41,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 611 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49831 states. [2024-10-12 20:26:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49831 to 24528. [2024-10-12 20:26:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24528 states, 24527 states have (on average 1.2961226403555266) internal successors, (31790), 24527 states have internal predecessors, (31790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24528 states to 24528 states and 31790 transitions. [2024-10-12 20:26:42,494 INFO L78 Accepts]: Start accepts. Automaton has 24528 states and 31790 transitions. Word has length 98 [2024-10-12 20:26:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:42,495 INFO L471 AbstractCegarLoop]: Abstraction has 24528 states and 31790 transitions. [2024-10-12 20:26:42,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 24528 states and 31790 transitions. [2024-10-12 20:26:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:26:42,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:42,500 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] [2024-10-12 20:26:42,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:26:42,501 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-12 20:26:42,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1100077838, now seen corresponding path program 1 times [2024-10-12 20:26:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383590300] [2024-10-12 20:26:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:26:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383590300] [2024-10-12 20:26:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383590300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437874860] [2024-10-12 20:26:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:42,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:42,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:42,576 INFO L87 Difference]: Start difference. First operand 24528 states and 31790 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:42,738 INFO L93 Difference]: Finished difference Result 46102 states and 59929 transitions. [2024-10-12 20:26:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:42,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:26:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:42,768 INFO L225 Difference]: With dead ends: 46102 [2024-10-12 20:26:42,768 INFO L226 Difference]: Without dead ends: 21656 [2024-10-12 20:26:42,790 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-12 20:26:42,791 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 87 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:42,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 136 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21656 states. [2024-10-12 20:26:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21656 to 21656. [2024-10-12 20:26:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21656 states, 21655 states have (on average 1.2823828215192796) internal successors, (27770), 21655 states have internal predecessors, (27770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21656 states to 21656 states and 27770 transitions. [2024-10-12 20:26:43,288 INFO L78 Accepts]: Start accepts. Automaton has 21656 states and 27770 transitions. Word has length 100 [2024-10-12 20:26:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 21656 states and 27770 transitions. [2024-10-12 20:26:43,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 21656 states and 27770 transitions. [2024-10-12 20:26:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:26:43,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:43,292 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] [2024-10-12 20:26:43,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:26:43,292 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-12 20:26:43,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1875526439, now seen corresponding path program 1 times [2024-10-12 20:26:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209122631] [2024-10-12 20:26:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209122631] [2024-10-12 20:26:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209122631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218121] [2024-10-12 20:26:43,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:43,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:43,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:43,783 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-12 20:26:43,784 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-12 20:26:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:43,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 20:26:43,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:26:44,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:26:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218121] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:45,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:45,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 26 [2024-10-12 20:26:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252162209] [2024-10-12 20:26:45,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 20:26:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 20:26:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:26:45,197 INFO L87 Difference]: Start difference. First operand 21656 states and 27770 transitions. Second operand has 26 states, 26 states have (on average 11.038461538461538) internal successors, (287), 26 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:53,912 INFO L93 Difference]: Finished difference Result 157248 states and 202258 transitions. [2024-10-12 20:26:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2024-10-12 20:26:53,912 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.038461538461538) internal successors, (287), 26 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:26:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:54,048 INFO L225 Difference]: With dead ends: 157248 [2024-10-12 20:26:54,048 INFO L226 Difference]: Without dead ends: 135254 [2024-10-12 20:26:54,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16950 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5551, Invalid=36679, Unknown=0, NotChecked=0, Total=42230 [2024-10-12 20:26:54,079 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 6423 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 4362 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6423 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 4362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:54,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6423 Valid, 2375 Invalid, 4601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 4362 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:26:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135254 states. [2024-10-12 20:26:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135254 to 118346. [2024-10-12 20:26:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118346 states, 118345 states have (on average 1.2815666061092568) internal successors, (151667), 118345 states have internal predecessors, (151667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118346 states to 118346 states and 151667 transitions. [2024-10-12 20:26:56,222 INFO L78 Accepts]: Start accepts. Automaton has 118346 states and 151667 transitions. Word has length 100 [2024-10-12 20:26:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:56,222 INFO L471 AbstractCegarLoop]: Abstraction has 118346 states and 151667 transitions. [2024-10-12 20:26:56,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.038461538461538) internal successors, (287), 26 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:26:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 118346 states and 151667 transitions. [2024-10-12 20:26:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:26:56,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:56,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:56,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:26:56,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:56,434 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-12 20:26:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash 454478672, now seen corresponding path program 1 times [2024-10-12 20:26:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204181321] [2024-10-12 20:26:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:56,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:57,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:57,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204181321] [2024-10-12 20:26:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204181321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:57,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339547303] [2024-10-12 20:26:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:57,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:57,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:57,149 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-12 20:26:57,150 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-12 20:26:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:57,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 20:26:57,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:27:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:00,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:27:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:04,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339547303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:27:04,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:27:04,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 25] total 63 [2024-10-12 20:27:04,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634454216] [2024-10-12 20:27:04,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:27:04,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-12 20:27:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:04,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-12 20:27:04,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3537, Unknown=0, NotChecked=0, Total=3906 [2024-10-12 20:27:04,147 INFO L87 Difference]: Start difference. First operand 118346 states and 151667 transitions. Second operand has 63 states, 63 states have (on average 4.476190476190476) internal successors, (282), 63 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)