./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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:35:17,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:35:17,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:35:17,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:35:17,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:35:17,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:35:17,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:35:17,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:35:17,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:35:17,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:35:17,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:35:17,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:35:17,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:35:17,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:35:17,447 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:35:17,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:35:17,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:35:17,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:35:17,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:35:17,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:35:17,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:35:17,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:35:17,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:35:17,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:35:17,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:35:17,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:35:17,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:35:17,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:35:17,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:35:17,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:35:17,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:35:17,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:35:17,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:35:17,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:35:17,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:35:17,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:35:17,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:35:17,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:35:17,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:35:17,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:35:17,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:35:17,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:35:17,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a [2024-10-11 03:35:17,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:35:17,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:35:17,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:35:17,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:35:17,697 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:35:17,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:35:19,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:35:19,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:35:19,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:35:19,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3687b1c40/01d6d38bbd0d4dc8821b22a50d1a7dca/FLAGf89e350c6 [2024-10-11 03:35:19,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3687b1c40/01d6d38bbd0d4dc8821b22a50d1a7dca [2024-10-11 03:35:19,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:35:19,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:35:19,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:35:19,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:35:19,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:35:19,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:35:19" (1/1) ... [2024-10-11 03:35:19,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c772bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:19, skipping insertion in model container [2024-10-11 03:35:19,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:35:19" (1/1) ... [2024-10-11 03:35:19,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:35:19,831 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2024-10-11 03:35:19,889 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2024-10-11 03:35:19,914 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2024-10-11 03:35:19,944 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2024-10-11 03:35:20,061 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2024-10-11 03:35:20,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:20,147 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:35:20,223 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2024-10-11 03:35:20,227 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2024-10-11 03:35:20,235 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2024-10-11 03:35:20,240 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2024-10-11 03:35:20,271 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_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2024-10-11 03:35:20,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:35:20,311 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:35:20,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20 WrapperNode [2024-10-11 03:35:20,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:35:20,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:20,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:35:20,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:35:20,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,393 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1639 [2024-10-11 03:35:20,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:35:20,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:35:20,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:35:20,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:35:20,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,454 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:35:20,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:35:20,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:35:20,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:35:20,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:35:20,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (1/1) ... [2024-10-11 03:35:20,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:35:20,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:35:20,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:35:20,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:35:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:35:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:35:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:35:20,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:35:20,707 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:35:20,709 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:35:21,655 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 03:35:21,656 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:35:21,745 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:35:21,747 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:35:21,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:21 BoogieIcfgContainer [2024-10-11 03:35:21,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:35:21,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:35:21,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:35:21,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:35:21,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:35:19" (1/3) ... [2024-10-11 03:35:21,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65328410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:21, skipping insertion in model container [2024-10-11 03:35:21,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:35:20" (2/3) ... [2024-10-11 03:35:21,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65328410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:35:21, skipping insertion in model container [2024-10-11 03:35:21,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:35:21" (3/3) ... [2024-10-11 03:35:21,758 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:35:21,774 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:35:21,774 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-11 03:35:21,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:35:21,858 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;@f5db18a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:35:21,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 03:35:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 386 states, 380 states have (on average 1.8289473684210527) internal successors, (695), 385 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 03:35:21,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:21,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:21,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1698524554, now seen corresponding path program 1 times [2024-10-11 03:35:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:21,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748850073] [2024-10-11 03:35:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:21,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748850073] [2024-10-11 03:35:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748850073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:22,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:22,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:22,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780639038] [2024-10-11 03:35:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:22,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:22,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:22,638 INFO L87 Difference]: Start difference. First operand has 386 states, 380 states have (on average 1.8289473684210527) internal successors, (695), 385 states have internal predecessors, (695), 0 states have call successors, (0), 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 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:22,816 INFO L93 Difference]: Finished difference Result 713 states and 1272 transitions. [2024-10-11 03:35:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:22,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-10-11 03:35:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:22,831 INFO L225 Difference]: With dead ends: 713 [2024-10-11 03:35:22,831 INFO L226 Difference]: Without dead ends: 588 [2024-10-11 03:35:22,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:22,836 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 423 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:22,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1238 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-11 03:35:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 586. [2024-10-11 03:35:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 581 states have (on average 1.4802065404475042) internal successors, (860), 585 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 860 transitions. [2024-10-11 03:35:22,887 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 860 transitions. Word has length 140 [2024-10-11 03:35:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:22,888 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 860 transitions. [2024-10-11 03:35:22,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 860 transitions. [2024-10-11 03:35:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 03:35:22,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:22,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:22,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:35:22,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:22,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:22,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1698955530, now seen corresponding path program 1 times [2024-10-11 03:35:22,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832829529] [2024-10-11 03:35:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832829529] [2024-10-11 03:35:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832829529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266128884] [2024-10-11 03:35:23,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:23,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:23,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:23,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:23,476 INFO L87 Difference]: Start difference. First operand 586 states and 860 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:23,605 INFO L93 Difference]: Finished difference Result 2253 states and 3287 transitions. [2024-10-11 03:35:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:23,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-10-11 03:35:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:23,611 INFO L225 Difference]: With dead ends: 2253 [2024-10-11 03:35:23,612 INFO L226 Difference]: Without dead ends: 1691 [2024-10-11 03:35:23,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:23,615 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 998 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:23,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1963 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-10-11 03:35:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1102. [2024-10-11 03:35:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1097 states have (on average 1.4694621695533272) internal successors, (1612), 1101 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1612 transitions. [2024-10-11 03:35:23,653 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1612 transitions. Word has length 140 [2024-10-11 03:35:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:23,653 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1612 transitions. [2024-10-11 03:35:23,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1612 transitions. [2024-10-11 03:35:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 03:35:23,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:23,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:23,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:35:23,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:23,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1124938092, now seen corresponding path program 1 times [2024-10-11 03:35:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711212147] [2024-10-11 03:35:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711212147] [2024-10-11 03:35:23,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711212147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:23,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:23,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678207556] [2024-10-11 03:35:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:23,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:23,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:23,732 INFO L87 Difference]: Start difference. First operand 1102 states and 1612 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:23,758 INFO L93 Difference]: Finished difference Result 2179 states and 3181 transitions. [2024-10-11 03:35:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:23,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-10-11 03:35:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:23,762 INFO L225 Difference]: With dead ends: 2179 [2024-10-11 03:35:23,763 INFO L226 Difference]: Without dead ends: 1104 [2024-10-11 03:35:23,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:23,765 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 0 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:23,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1095 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-10-11 03:35:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2024-10-11 03:35:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1099 states have (on average 1.4686078252957233) internal successors, (1614), 1103 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1614 transitions. [2024-10-11 03:35:23,785 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1614 transitions. Word has length 141 [2024-10-11 03:35:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:23,786 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1614 transitions. [2024-10-11 03:35:23,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1614 transitions. [2024-10-11 03:35:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 03:35:23,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:23,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:23,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:35:23,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash -973418926, now seen corresponding path program 1 times [2024-10-11 03:35:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194668795] [2024-10-11 03:35:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194668795] [2024-10-11 03:35:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194668795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:23,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:23,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500111326] [2024-10-11 03:35:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:23,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:23,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:23,907 INFO L87 Difference]: Start difference. First operand 1104 states and 1614 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:23,961 INFO L93 Difference]: Finished difference Result 3074 states and 4501 transitions. [2024-10-11 03:35:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:23,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-10-11 03:35:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:23,968 INFO L225 Difference]: With dead ends: 3074 [2024-10-11 03:35:23,968 INFO L226 Difference]: Without dead ends: 2145 [2024-10-11 03:35:23,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:23,971 INFO L432 NwaCegarLoop]: 1011 mSDtfsCounter, 478 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:23,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1518 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-10-11 03:35:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2107. [2024-10-11 03:35:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2102 states have (on average 1.455756422454805) internal successors, (3060), 2106 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3060 transitions. [2024-10-11 03:35:24,012 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3060 transitions. Word has length 142 [2024-10-11 03:35:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:24,013 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 3060 transitions. [2024-10-11 03:35:24,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3060 transitions. [2024-10-11 03:35:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 03:35:24,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:24,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:24,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:35:24,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:24,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash 639743637, now seen corresponding path program 1 times [2024-10-11 03:35:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449319946] [2024-10-11 03:35:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449319946] [2024-10-11 03:35:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449319946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:24,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147064619] [2024-10-11 03:35:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:24,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:24,432 INFO L87 Difference]: Start difference. First operand 2107 states and 3060 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:24,467 INFO L93 Difference]: Finished difference Result 3558 states and 5174 transitions. [2024-10-11 03:35:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:24,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-10-11 03:35:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:24,474 INFO L225 Difference]: With dead ends: 3558 [2024-10-11 03:35:24,474 INFO L226 Difference]: Without dead ends: 1616 [2024-10-11 03:35:24,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:24,477 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 25 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:24,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1728 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-10-11 03:35:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2024-10-11 03:35:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1611 states have (on average 1.4494103041589075) internal successors, (2335), 1615 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2335 transitions. [2024-10-11 03:35:24,509 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2335 transitions. Word has length 142 [2024-10-11 03:35:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:24,509 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2335 transitions. [2024-10-11 03:35:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2335 transitions. [2024-10-11 03:35:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:35:24,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:24,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:24,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:35:24,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:24,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:24,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1618906701, now seen corresponding path program 1 times [2024-10-11 03:35:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012475186] [2024-10-11 03:35:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:24,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012475186] [2024-10-11 03:35:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012475186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:24,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:24,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651718179] [2024-10-11 03:35:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:24,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:24,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:24,887 INFO L87 Difference]: Start difference. First operand 1616 states and 2335 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:25,000 INFO L93 Difference]: Finished difference Result 3194 states and 4768 transitions. [2024-10-11 03:35:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-10-11 03:35:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:25,008 INFO L225 Difference]: With dead ends: 3194 [2024-10-11 03:35:25,008 INFO L226 Difference]: Without dead ends: 2612 [2024-10-11 03:35:25,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:25,010 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 876 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:25,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 984 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2024-10-11 03:35:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2610. [2024-10-11 03:35:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2605 states have (on average 1.4610364683301345) internal successors, (3806), 2609 states have internal predecessors, (3806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3806 transitions. [2024-10-11 03:35:25,053 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3806 transitions. Word has length 148 [2024-10-11 03:35:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:25,053 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 3806 transitions. [2024-10-11 03:35:25,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3806 transitions. [2024-10-11 03:35:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:35:25,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:25,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:25,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:35:25,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:25,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:25,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1415539251, now seen corresponding path program 1 times [2024-10-11 03:35:25,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:25,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438092408] [2024-10-11 03:35:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:25,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:25,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438092408] [2024-10-11 03:35:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438092408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275252292] [2024-10-11 03:35:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:25,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:25,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:25,343 INFO L87 Difference]: Start difference. First operand 2610 states and 3806 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:25,453 INFO L93 Difference]: Finished difference Result 6765 states and 9837 transitions. [2024-10-11 03:35:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:25,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-10-11 03:35:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:25,465 INFO L225 Difference]: With dead ends: 6765 [2024-10-11 03:35:25,465 INFO L226 Difference]: Without dead ends: 4173 [2024-10-11 03:35:25,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:25,470 INFO L432 NwaCegarLoop]: 792 mSDtfsCounter, 482 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:25,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2048 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2024-10-11 03:35:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4143. [2024-10-11 03:35:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4138 states have (on average 1.4407926534557758) internal successors, (5962), 4142 states have internal predecessors, (5962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5962 transitions. [2024-10-11 03:35:25,566 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5962 transitions. Word has length 148 [2024-10-11 03:35:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:25,567 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5962 transitions. [2024-10-11 03:35:25,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5962 transitions. [2024-10-11 03:35:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 03:35:25,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:25,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:25,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:35:25,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1960226256, now seen corresponding path program 1 times [2024-10-11 03:35:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737648220] [2024-10-11 03:35:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737648220] [2024-10-11 03:35:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737648220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:25,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:25,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674625095] [2024-10-11 03:35:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:25,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:25,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:25,634 INFO L87 Difference]: Start difference. First operand 4143 states and 5962 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:25,674 INFO L93 Difference]: Finished difference Result 9044 states and 13013 transitions. [2024-10-11 03:35:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:25,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2024-10-11 03:35:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:25,690 INFO L225 Difference]: With dead ends: 9044 [2024-10-11 03:35:25,690 INFO L226 Difference]: Without dead ends: 5818 [2024-10-11 03:35:25,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:25,697 INFO L432 NwaCegarLoop]: 999 mSDtfsCounter, 519 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:25,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1541 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2024-10-11 03:35:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 4143. [2024-10-11 03:35:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4138 states have (on average 1.4405509908168197) internal successors, (5961), 4142 states have internal predecessors, (5961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5961 transitions. [2024-10-11 03:35:25,778 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5961 transitions. Word has length 149 [2024-10-11 03:35:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:25,778 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5961 transitions. [2024-10-11 03:35:25,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5961 transitions. [2024-10-11 03:35:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:35:25,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:25,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:25,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:35:25,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1574033763, now seen corresponding path program 1 times [2024-10-11 03:35:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:25,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424928923] [2024-10-11 03:35:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:25,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:25,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:25,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424928923] [2024-10-11 03:35:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424928923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:25,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416824954] [2024-10-11 03:35:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:25,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:25,857 INFO L87 Difference]: Start difference. First operand 4143 states and 5961 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:25,943 INFO L93 Difference]: Finished difference Result 10907 states and 15672 transitions. [2024-10-11 03:35:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-11 03:35:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:25,963 INFO L225 Difference]: With dead ends: 10907 [2024-10-11 03:35:25,963 INFO L226 Difference]: Without dead ends: 7094 [2024-10-11 03:35:25,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:25,970 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 470 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:25,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1511 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2024-10-11 03:35:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7068. [2024-10-11 03:35:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7068 states, 7063 states have (on average 1.4166784652413988) internal successors, (10006), 7067 states have internal predecessors, (10006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7068 states to 7068 states and 10006 transitions. [2024-10-11 03:35:26,128 INFO L78 Accepts]: Start accepts. Automaton has 7068 states and 10006 transitions. Word has length 150 [2024-10-11 03:35:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:26,128 INFO L471 AbstractCegarLoop]: Abstraction has 7068 states and 10006 transitions. [2024-10-11 03:35:26,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7068 states and 10006 transitions. [2024-10-11 03:35:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 03:35:26,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:26,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:26,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:35:26,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:26,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1271435424, now seen corresponding path program 1 times [2024-10-11 03:35:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382975506] [2024-10-11 03:35:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:26,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382975506] [2024-10-11 03:35:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382975506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:26,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:26,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673082093] [2024-10-11 03:35:26,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:26,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:26,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:26,406 INFO L87 Difference]: Start difference. First operand 7068 states and 10006 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:26,486 INFO L93 Difference]: Finished difference Result 11725 states and 16636 transitions. [2024-10-11 03:35:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:26,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-11 03:35:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:26,496 INFO L225 Difference]: With dead ends: 11725 [2024-10-11 03:35:26,497 INFO L226 Difference]: Without dead ends: 6427 [2024-10-11 03:35:26,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:26,502 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 19 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:26,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1706 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6427 states. [2024-10-11 03:35:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6427 to 6427. [2024-10-11 03:35:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6427 states, 6422 states have (on average 1.4201183431952662) internal successors, (9120), 6426 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6427 states to 6427 states and 9120 transitions. [2024-10-11 03:35:26,625 INFO L78 Accepts]: Start accepts. Automaton has 6427 states and 9120 transitions. Word has length 150 [2024-10-11 03:35:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:26,626 INFO L471 AbstractCegarLoop]: Abstraction has 6427 states and 9120 transitions. [2024-10-11 03:35:26,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6427 states and 9120 transitions. [2024-10-11 03:35:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:35:26,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:26,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:26,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:35:26,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 831740837, now seen corresponding path program 1 times [2024-10-11 03:35:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793277776] [2024-10-11 03:35:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793277776] [2024-10-11 03:35:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793277776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:26,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902423911] [2024-10-11 03:35:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:26,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:26,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:26,713 INFO L87 Difference]: Start difference. First operand 6427 states and 9120 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:26,958 INFO L93 Difference]: Finished difference Result 18187 states and 25947 transitions. [2024-10-11 03:35:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:26,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-11 03:35:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:26,976 INFO L225 Difference]: With dead ends: 18187 [2024-10-11 03:35:26,977 INFO L226 Difference]: Without dead ends: 12518 [2024-10-11 03:35:26,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:26,986 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 457 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:26,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 875 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12518 states. [2024-10-11 03:35:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12518 to 12464. [2024-10-11 03:35:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12464 states, 12459 states have (on average 1.4123123846215586) internal successors, (17596), 12463 states have internal predecessors, (17596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12464 states to 12464 states and 17596 transitions. [2024-10-11 03:35:27,170 INFO L78 Accepts]: Start accepts. Automaton has 12464 states and 17596 transitions. Word has length 156 [2024-10-11 03:35:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:27,170 INFO L471 AbstractCegarLoop]: Abstraction has 12464 states and 17596 transitions. [2024-10-11 03:35:27,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 12464 states and 17596 transitions. [2024-10-11 03:35:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:35:27,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:27,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:27,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:35:27,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:27,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash 400986186, now seen corresponding path program 1 times [2024-10-11 03:35:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130214722] [2024-10-11 03:35:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:28,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130214722] [2024-10-11 03:35:28,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130214722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:28,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:28,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:35:28,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199639672] [2024-10-11 03:35:28,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:28,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:35:28,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:35:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:35:28,009 INFO L87 Difference]: Start difference. First operand 12464 states and 17596 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:28,288 INFO L93 Difference]: Finished difference Result 16272 states and 23683 transitions. [2024-10-11 03:35:28,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-11 03:35:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:28,307 INFO L225 Difference]: With dead ends: 16272 [2024-10-11 03:35:28,308 INFO L226 Difference]: Without dead ends: 11266 [2024-10-11 03:35:28,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:35:28,318 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 1302 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:28,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 2754 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:35:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states. [2024-10-11 03:35:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 11264. [2024-10-11 03:35:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11264 states, 11259 states have (on average 1.3833377742250643) internal successors, (15575), 11263 states have internal predecessors, (15575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11264 states to 11264 states and 15575 transitions. [2024-10-11 03:35:28,576 INFO L78 Accepts]: Start accepts. Automaton has 11264 states and 15575 transitions. Word has length 156 [2024-10-11 03:35:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:28,576 INFO L471 AbstractCegarLoop]: Abstraction has 11264 states and 15575 transitions. [2024-10-11 03:35:28,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 11264 states and 15575 transitions. [2024-10-11 03:35:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:35:28,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:28,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:35:28,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:28,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1745181395, now seen corresponding path program 1 times [2024-10-11 03:35:28,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:28,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598706634] [2024-10-11 03:35:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598706634] [2024-10-11 03:35:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598706634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:28,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:28,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448155772] [2024-10-11 03:35:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:28,838 INFO L87 Difference]: Start difference. First operand 11264 states and 15575 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:29,128 INFO L93 Difference]: Finished difference Result 54813 states and 75534 transitions. [2024-10-11 03:35:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-11 03:35:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:29,187 INFO L225 Difference]: With dead ends: 54813 [2024-10-11 03:35:29,187 INFO L226 Difference]: Without dead ends: 43587 [2024-10-11 03:35:29,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:29,203 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 1534 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:29,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 2444 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43587 states. [2024-10-11 03:35:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43587 to 21785. [2024-10-11 03:35:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21785 states, 21780 states have (on average 1.366115702479339) internal successors, (29754), 21784 states have internal predecessors, (29754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21785 states to 21785 states and 29754 transitions. [2024-10-11 03:35:29,844 INFO L78 Accepts]: Start accepts. Automaton has 21785 states and 29754 transitions. Word has length 156 [2024-10-11 03:35:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:29,844 INFO L471 AbstractCegarLoop]: Abstraction has 21785 states and 29754 transitions. [2024-10-11 03:35:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 21785 states and 29754 transitions. [2024-10-11 03:35:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 03:35:29,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:29,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:29,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:35:29,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:29,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1520485193, now seen corresponding path program 1 times [2024-10-11 03:35:29,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:29,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401130012] [2024-10-11 03:35:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:29,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401130012] [2024-10-11 03:35:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401130012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:29,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800949469] [2024-10-11 03:35:29,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:29,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:29,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:29,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:29,953 INFO L87 Difference]: Start difference. First operand 21785 states and 29754 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:30,059 INFO L93 Difference]: Finished difference Result 43473 states and 59381 transitions. [2024-10-11 03:35:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2024-10-11 03:35:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:30,094 INFO L225 Difference]: With dead ends: 43473 [2024-10-11 03:35:30,094 INFO L226 Difference]: Without dead ends: 21791 [2024-10-11 03:35:30,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:30,121 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:30,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21791 states. [2024-10-11 03:35:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21791 to 21791. [2024-10-11 03:35:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21791 states, 21786 states have (on average 1.3660148719361058) internal successors, (29760), 21790 states have internal predecessors, (29760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21791 states to 21791 states and 29760 transitions. [2024-10-11 03:35:30,667 INFO L78 Accepts]: Start accepts. Automaton has 21791 states and 29760 transitions. Word has length 157 [2024-10-11 03:35:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:30,667 INFO L471 AbstractCegarLoop]: Abstraction has 21791 states and 29760 transitions. [2024-10-11 03:35:30,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 21791 states and 29760 transitions. [2024-10-11 03:35:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 03:35:30,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:30,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:30,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:35:30,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:30,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1175383643, now seen corresponding path program 1 times [2024-10-11 03:35:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:30,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020451256] [2024-10-11 03:35:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:30,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020451256] [2024-10-11 03:35:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020451256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:30,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886180950] [2024-10-11 03:35:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:30,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:30,959 INFO L87 Difference]: Start difference. First operand 21791 states and 29760 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:31,378 INFO L93 Difference]: Finished difference Result 63139 states and 86024 transitions. [2024-10-11 03:35:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:31,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-11 03:35:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:31,518 INFO L225 Difference]: With dead ends: 63139 [2024-10-11 03:35:31,519 INFO L226 Difference]: Without dead ends: 42281 [2024-10-11 03:35:31,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:31,575 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 465 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:31,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1531 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42281 states. [2024-10-11 03:35:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42281 to 42227. [2024-10-11 03:35:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42227 states, 42222 states have (on average 1.3471176164085075) internal successors, (56878), 42226 states have internal predecessors, (56878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42227 states to 42227 states and 56878 transitions. [2024-10-11 03:35:32,647 INFO L78 Accepts]: Start accepts. Automaton has 42227 states and 56878 transitions. Word has length 158 [2024-10-11 03:35:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:32,648 INFO L471 AbstractCegarLoop]: Abstraction has 42227 states and 56878 transitions. [2024-10-11 03:35:32,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 42227 states and 56878 transitions. [2024-10-11 03:35:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 03:35:32,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:32,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:32,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:35:32,737 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:32,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash 994487656, now seen corresponding path program 1 times [2024-10-11 03:35:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:32,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026096691] [2024-10-11 03:35:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:33,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026096691] [2024-10-11 03:35:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026096691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:33,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383716910] [2024-10-11 03:35:33,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:33,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:33,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:33,359 INFO L87 Difference]: Start difference. First operand 42227 states and 56878 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:33,543 INFO L93 Difference]: Finished difference Result 72287 states and 97526 transitions. [2024-10-11 03:35:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:33,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-11 03:35:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:33,605 INFO L225 Difference]: With dead ends: 72287 [2024-10-11 03:35:33,606 INFO L226 Difference]: Without dead ends: 42591 [2024-10-11 03:35:33,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:33,639 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 477 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:33,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1880 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42591 states. [2024-10-11 03:35:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42591 to 42385. [2024-10-11 03:35:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42385 states, 42380 states have (on average 1.34624823029731) internal successors, (57054), 42384 states have internal predecessors, (57054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42385 states to 42385 states and 57054 transitions. [2024-10-11 03:35:34,597 INFO L78 Accepts]: Start accepts. Automaton has 42385 states and 57054 transitions. Word has length 158 [2024-10-11 03:35:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:34,597 INFO L471 AbstractCegarLoop]: Abstraction has 42385 states and 57054 transitions. [2024-10-11 03:35:34,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 42385 states and 57054 transitions. [2024-10-11 03:35:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 03:35:34,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:34,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:34,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:35:34,632 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:34,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash -189491316, now seen corresponding path program 1 times [2024-10-11 03:35:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293822990] [2024-10-11 03:35:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:34,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293822990] [2024-10-11 03:35:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293822990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529118956] [2024-10-11 03:35:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:34,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:34,943 INFO L87 Difference]: Start difference. First operand 42385 states and 57054 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:35,625 INFO L93 Difference]: Finished difference Result 128323 states and 172490 transitions. [2024-10-11 03:35:35,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:35,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-11 03:35:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:35,753 INFO L225 Difference]: With dead ends: 128323 [2024-10-11 03:35:35,753 INFO L226 Difference]: Without dead ends: 86223 [2024-10-11 03:35:35,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:35,801 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1516 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:35,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2340 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86223 states. [2024-10-11 03:35:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86223 to 42649. [2024-10-11 03:35:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42649 states, 42644 states have (on average 1.3448785292186474) internal successors, (57351), 42648 states have internal predecessors, (57351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42649 states to 42649 states and 57351 transitions. [2024-10-11 03:35:36,819 INFO L78 Accepts]: Start accepts. Automaton has 42649 states and 57351 transitions. Word has length 158 [2024-10-11 03:35:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:36,819 INFO L471 AbstractCegarLoop]: Abstraction has 42649 states and 57351 transitions. [2024-10-11 03:35:36,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 42649 states and 57351 transitions. [2024-10-11 03:35:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 03:35:36,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:36,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:36,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:35:36,848 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:36,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1175066184, now seen corresponding path program 1 times [2024-10-11 03:35:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373967270] [2024-10-11 03:35:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373967270] [2024-10-11 03:35:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373967270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:36,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:36,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462735538] [2024-10-11 03:35:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:36,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:35:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:35:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:36,906 INFO L87 Difference]: Start difference. First operand 42649 states and 57351 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:37,047 INFO L93 Difference]: Finished difference Result 84147 states and 113334 transitions. [2024-10-11 03:35:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:35:37,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-10-11 03:35:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:37,100 INFO L225 Difference]: With dead ends: 84147 [2024-10-11 03:35:37,100 INFO L226 Difference]: Without dead ends: 42669 [2024-10-11 03:35:37,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:35:37,134 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:37,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42669 states. [2024-10-11 03:35:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42669 to 42669. [2024-10-11 03:35:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42669 states, 42664 states have (on average 1.3447168573035815) internal successors, (57371), 42668 states have internal predecessors, (57371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42669 states to 42669 states and 57371 transitions. [2024-10-11 03:35:38,037 INFO L78 Accepts]: Start accepts. Automaton has 42669 states and 57371 transitions. Word has length 159 [2024-10-11 03:35:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:38,037 INFO L471 AbstractCegarLoop]: Abstraction has 42669 states and 57371 transitions. [2024-10-11 03:35:38,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 42669 states and 57371 transitions. [2024-10-11 03:35:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:35:38,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:38,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:38,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:35:38,074 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:38,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 446416235, now seen corresponding path program 1 times [2024-10-11 03:35:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192577921] [2024-10-11 03:35:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:38,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192577921] [2024-10-11 03:35:38,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192577921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:38,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894836993] [2024-10-11 03:35:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:38,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:38,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:38,626 INFO L87 Difference]: Start difference. First operand 42669 states and 57371 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:38,772 INFO L93 Difference]: Finished difference Result 71371 states and 95843 transitions. [2024-10-11 03:35:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:38,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-10-11 03:35:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:38,804 INFO L225 Difference]: With dead ends: 71371 [2024-10-11 03:35:38,804 INFO L226 Difference]: Without dead ends: 28757 [2024-10-11 03:35:38,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:38,834 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 12 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:38,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1687 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28757 states. [2024-10-11 03:35:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28757 to 28757. [2024-10-11 03:35:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28757 states, 28752 states have (on average 1.3404980523094046) internal successors, (38542), 28756 states have internal predecessors, (38542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28757 states to 28757 states and 38542 transitions. [2024-10-11 03:35:39,493 INFO L78 Accepts]: Start accepts. Automaton has 28757 states and 38542 transitions. Word has length 160 [2024-10-11 03:35:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:39,493 INFO L471 AbstractCegarLoop]: Abstraction has 28757 states and 38542 transitions. [2024-10-11 03:35:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 28757 states and 38542 transitions. [2024-10-11 03:35:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:39,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:39,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:39,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:35:39,511 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:39,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 550043268, now seen corresponding path program 1 times [2024-10-11 03:35:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521499440] [2024-10-11 03:35:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521499440] [2024-10-11 03:35:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521499440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903893203] [2024-10-11 03:35:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:39,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:35:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:35:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:39,622 INFO L87 Difference]: Start difference. First operand 28757 states and 38542 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:39,860 INFO L93 Difference]: Finished difference Result 56434 states and 75810 transitions. [2024-10-11 03:35:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:39,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-11 03:35:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:39,891 INFO L225 Difference]: With dead ends: 56434 [2024-10-11 03:35:39,892 INFO L226 Difference]: Without dead ends: 28757 [2024-10-11 03:35:39,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:35:39,916 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 1454 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:39,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 496 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28757 states. [2024-10-11 03:35:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28757 to 28757. [2024-10-11 03:35:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28757 states, 28752 states have (on average 1.323594880356149) internal successors, (38056), 28756 states have internal predecessors, (38056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28757 states to 28757 states and 38056 transitions. [2024-10-11 03:35:40,493 INFO L78 Accepts]: Start accepts. Automaton has 28757 states and 38056 transitions. Word has length 168 [2024-10-11 03:35:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:40,493 INFO L471 AbstractCegarLoop]: Abstraction has 28757 states and 38056 transitions. [2024-10-11 03:35:40,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 28757 states and 38056 transitions. [2024-10-11 03:35:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:40,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:40,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:40,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:35:40,510 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:40,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1580081503, now seen corresponding path program 1 times [2024-10-11 03:35:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487542269] [2024-10-11 03:35:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:40,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487542269] [2024-10-11 03:35:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487542269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:40,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:40,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:40,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259230028] [2024-10-11 03:35:40,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:40,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:40,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:40,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:40,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:40,764 INFO L87 Difference]: Start difference. First operand 28757 states and 38056 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:40,967 INFO L93 Difference]: Finished difference Result 52675 states and 71257 transitions. [2024-10-11 03:35:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-11 03:35:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:41,015 INFO L225 Difference]: With dead ends: 52675 [2024-10-11 03:35:41,015 INFO L226 Difference]: Without dead ends: 41244 [2024-10-11 03:35:41,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:41,036 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 852 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:41,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 936 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41244 states. [2024-10-11 03:35:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41244 to 41242. [2024-10-11 03:35:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41242 states, 41237 states have (on average 1.3042413366636758) internal successors, (53783), 41241 states have internal predecessors, (53783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41242 states to 41242 states and 53783 transitions. [2024-10-11 03:35:41,901 INFO L78 Accepts]: Start accepts. Automaton has 41242 states and 53783 transitions. Word has length 168 [2024-10-11 03:35:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 41242 states and 53783 transitions. [2024-10-11 03:35:41,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 41242 states and 53783 transitions. [2024-10-11 03:35:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:41,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:41,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:41,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:35:41,936 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:41,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1293467271, now seen corresponding path program 1 times [2024-10-11 03:35:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:41,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770171584] [2024-10-11 03:35:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:42,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770171584] [2024-10-11 03:35:42,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770171584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:42,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:42,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:35:42,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324378524] [2024-10-11 03:35:42,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:42,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:42,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:42,221 INFO L87 Difference]: Start difference. First operand 41242 states and 53783 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:42,449 INFO L93 Difference]: Finished difference Result 82742 states and 107852 transitions. [2024-10-11 03:35:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:42,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-11 03:35:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:42,507 INFO L225 Difference]: With dead ends: 82742 [2024-10-11 03:35:42,507 INFO L226 Difference]: Without dead ends: 41839 [2024-10-11 03:35:42,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:35:42,544 INFO L432 NwaCegarLoop]: 910 mSDtfsCounter, 471 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:42,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 2248 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41839 states. [2024-10-11 03:35:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41839 to 41530. [2024-10-11 03:35:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41530 states, 41525 states have (on average 1.3025888019265504) internal successors, (54090), 41529 states have internal predecessors, (54090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41530 states to 41530 states and 54090 transitions. [2024-10-11 03:35:43,427 INFO L78 Accepts]: Start accepts. Automaton has 41530 states and 54090 transitions. Word has length 168 [2024-10-11 03:35:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:43,428 INFO L471 AbstractCegarLoop]: Abstraction has 41530 states and 54090 transitions. [2024-10-11 03:35:43,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 41530 states and 54090 transitions. [2024-10-11 03:35:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 03:35:43,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:43,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:43,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:35:43,455 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1372328206, now seen corresponding path program 1 times [2024-10-11 03:35:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:43,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490632510] [2024-10-11 03:35:43,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:43,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:43,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490632510] [2024-10-11 03:35:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490632510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:43,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:43,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:35:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372676774] [2024-10-11 03:35:43,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:35:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:43,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:35:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:43,850 INFO L87 Difference]: Start difference. First operand 41530 states and 54090 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:43,962 INFO L93 Difference]: Finished difference Result 59377 states and 77282 transitions. [2024-10-11 03:35:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:35:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-11 03:35:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:44,004 INFO L225 Difference]: With dead ends: 59377 [2024-10-11 03:35:44,004 INFO L226 Difference]: Without dead ends: 35957 [2024-10-11 03:35:44,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:35:44,027 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:44,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1632 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:35:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35957 states. [2024-10-11 03:35:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35957 to 35957. [2024-10-11 03:35:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35957 states, 35952 states have (on average 1.302097240765465) internal successors, (46813), 35956 states have internal predecessors, (46813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35957 states to 35957 states and 46813 transitions. [2024-10-11 03:35:44,423 INFO L78 Accepts]: Start accepts. Automaton has 35957 states and 46813 transitions. Word has length 168 [2024-10-11 03:35:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:44,424 INFO L471 AbstractCegarLoop]: Abstraction has 35957 states and 46813 transitions. [2024-10-11 03:35:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 35957 states and 46813 transitions. [2024-10-11 03:35:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:35:44,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:44,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:44,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:35:44,445 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1026916521, now seen corresponding path program 1 times [2024-10-11 03:35:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:44,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074501338] [2024-10-11 03:35:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074501338] [2024-10-11 03:35:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074501338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:35:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101559433] [2024-10-11 03:35:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:35:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:35:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:35:46,194 INFO L87 Difference]: Start difference. First operand 35957 states and 46813 transitions. Second operand has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:54,284 INFO L93 Difference]: Finished difference Result 76542 states and 106019 transitions. [2024-10-11 03:35:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-11 03:35:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:35:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:54,367 INFO L225 Difference]: With dead ends: 76542 [2024-10-11 03:35:54,367 INFO L226 Difference]: Without dead ends: 72122 [2024-10-11 03:35:54,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2024-10-11 03:35:54,381 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 7324 mSDsluCounter, 16136 mSDsCounter, 0 mSdLazyCounter, 5633 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7324 SdHoareTripleChecker+Valid, 17365 SdHoareTripleChecker+Invalid, 5799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 5633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:54,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7324 Valid, 17365 Invalid, 5799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 5633 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 03:35:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72122 states. [2024-10-11 03:35:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72122 to 37323. [2024-10-11 03:35:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37323 states, 37318 states have (on average 1.297818746985369) internal successors, (48432), 37322 states have internal predecessors, (48432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37323 states to 37323 states and 48432 transitions. [2024-10-11 03:35:54,993 INFO L78 Accepts]: Start accepts. Automaton has 37323 states and 48432 transitions. Word has length 170 [2024-10-11 03:35:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 37323 states and 48432 transitions. [2024-10-11 03:35:54,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37323 states and 48432 transitions. [2024-10-11 03:35:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:35:55,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:55,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:55,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:35:55,028 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:55,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1705310020, now seen corresponding path program 1 times [2024-10-11 03:35:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148270416] [2024-10-11 03:35:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148270416] [2024-10-11 03:35:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148270416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:55,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:35:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706297223] [2024-10-11 03:35:55,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:55,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:35:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:35:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:35:55,600 INFO L87 Difference]: Start difference. First operand 37323 states and 48432 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:35:55,848 INFO L93 Difference]: Finished difference Result 60981 states and 80207 transitions. [2024-10-11 03:35:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:35:55,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:35:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:35:55,876 INFO L225 Difference]: With dead ends: 60981 [2024-10-11 03:35:55,877 INFO L226 Difference]: Without dead ends: 25898 [2024-10-11 03:35:55,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:35:55,901 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 1935 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1935 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:35:55,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1935 Valid, 585 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:35:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25898 states. [2024-10-11 03:35:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25898 to 20339. [2024-10-11 03:35:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20339 states, 20334 states have (on average 1.2814497885315235) internal successors, (26057), 20338 states have internal predecessors, (26057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20339 states to 20339 states and 26057 transitions. [2024-10-11 03:35:56,125 INFO L78 Accepts]: Start accepts. Automaton has 20339 states and 26057 transitions. Word has length 170 [2024-10-11 03:35:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:35:56,125 INFO L471 AbstractCegarLoop]: Abstraction has 20339 states and 26057 transitions. [2024-10-11 03:35:56,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:35:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 20339 states and 26057 transitions. [2024-10-11 03:35:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:35:56,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:35:56,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:35:56,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:35:56,139 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:35:56,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:35:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash -617238689, now seen corresponding path program 1 times [2024-10-11 03:35:56,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:35:56,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130735521] [2024-10-11 03:35:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:35:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:35:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:35:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:35:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:35:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130735521] [2024-10-11 03:35:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130735521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:35:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:35:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:35:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370027446] [2024-10-11 03:35:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:35:57,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:35:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:35:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:35:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:35:57,782 INFO L87 Difference]: Start difference. First operand 20339 states and 26057 transitions. Second operand has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:04,383 INFO L93 Difference]: Finished difference Result 35478 states and 47518 transitions. [2024-10-11 03:36:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 03:36:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:36:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:04,421 INFO L225 Difference]: With dead ends: 35478 [2024-10-11 03:36:04,422 INFO L226 Difference]: Without dead ends: 34166 [2024-10-11 03:36:04,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=497, Invalid=1759, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 03:36:04,432 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 5339 mSDsluCounter, 13306 mSDsCounter, 0 mSdLazyCounter, 4720 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5339 SdHoareTripleChecker+Valid, 14346 SdHoareTripleChecker+Invalid, 4787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:04,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5339 Valid, 14346 Invalid, 4787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4720 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 03:36:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34166 states. [2024-10-11 03:36:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34166 to 22184. [2024-10-11 03:36:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22184 states, 22179 states have (on average 1.274313539834979) internal successors, (28263), 22183 states have internal predecessors, (28263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22184 states to 22184 states and 28263 transitions. [2024-10-11 03:36:04,744 INFO L78 Accepts]: Start accepts. Automaton has 22184 states and 28263 transitions. Word has length 170 [2024-10-11 03:36:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:04,745 INFO L471 AbstractCegarLoop]: Abstraction has 22184 states and 28263 transitions. [2024-10-11 03:36:04,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22184 states and 28263 transitions. [2024-10-11 03:36:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:36:04,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:04,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:04,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:36:04,761 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:04,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2045558982, now seen corresponding path program 1 times [2024-10-11 03:36:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909507024] [2024-10-11 03:36:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:04,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:04,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909507024] [2024-10-11 03:36:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909507024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:04,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:04,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:36:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875051195] [2024-10-11 03:36:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:04,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:36:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:36:04,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:36:04,831 INFO L87 Difference]: Start difference. First operand 22184 states and 28263 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:05,096 INFO L93 Difference]: Finished difference Result 52503 states and 67985 transitions. [2024-10-11 03:36:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:36:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:36:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:05,315 INFO L225 Difference]: With dead ends: 52503 [2024-10-11 03:36:05,316 INFO L226 Difference]: Without dead ends: 38188 [2024-10-11 03:36:05,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:36:05,323 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 343 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:05,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1001 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:36:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38188 states. [2024-10-11 03:36:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38188 to 37670. [2024-10-11 03:36:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37670 states, 37665 states have (on average 1.2767821585025887) internal successors, (48090), 37669 states have internal predecessors, (48090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37670 states to 37670 states and 48090 transitions. [2024-10-11 03:36:05,683 INFO L78 Accepts]: Start accepts. Automaton has 37670 states and 48090 transitions. Word has length 170 [2024-10-11 03:36:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:05,684 INFO L471 AbstractCegarLoop]: Abstraction has 37670 states and 48090 transitions. [2024-10-11 03:36:05,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37670 states and 48090 transitions. [2024-10-11 03:36:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:36:05,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:36:05,711 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 754482051, now seen corresponding path program 1 times [2024-10-11 03:36:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796273029] [2024-10-11 03:36:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:07,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796273029] [2024-10-11 03:36:07,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796273029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:07,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-11 03:36:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513337509] [2024-10-11 03:36:07,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:07,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:36:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:36:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:36:07,624 INFO L87 Difference]: Start difference. First operand 37670 states and 48090 transitions. Second operand has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:12,109 INFO L93 Difference]: Finished difference Result 57533 states and 76862 transitions. [2024-10-11 03:36:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 03:36:12,109 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:36:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:12,172 INFO L225 Difference]: With dead ends: 57533 [2024-10-11 03:36:12,172 INFO L226 Difference]: Without dead ends: 51782 [2024-10-11 03:36:12,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 03:36:12,194 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 2718 mSDsluCounter, 11422 mSDsCounter, 0 mSdLazyCounter, 4285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 12422 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:12,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2718 Valid, 12422 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4285 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 03:36:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51782 states. [2024-10-11 03:36:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51782 to 37800. [2024-10-11 03:36:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37800 states, 37795 states have (on average 1.2765709749966927) internal successors, (48248), 37799 states have internal predecessors, (48248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 48248 transitions. [2024-10-11 03:36:12,700 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 48248 transitions. Word has length 170 [2024-10-11 03:36:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:12,700 INFO L471 AbstractCegarLoop]: Abstraction has 37800 states and 48248 transitions. [2024-10-11 03:36:12,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 48248 transitions. [2024-10-11 03:36:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:36:12,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:12,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:12,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:36:12,725 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:12,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1513083237, now seen corresponding path program 1 times [2024-10-11 03:36:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923638329] [2024-10-11 03:36:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923638329] [2024-10-11 03:36:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923638329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-11 03:36:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747714037] [2024-10-11 03:36:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:14,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:36:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:36:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:36:14,253 INFO L87 Difference]: Start difference. First operand 37800 states and 48248 transitions. Second operand has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:20,516 INFO L93 Difference]: Finished difference Result 102351 states and 140879 transitions. [2024-10-11 03:36:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-11 03:36:20,517 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:36:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:20,642 INFO L225 Difference]: With dead ends: 102351 [2024-10-11 03:36:20,643 INFO L226 Difference]: Without dead ends: 97814 [2024-10-11 03:36:20,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=832, Invalid=3724, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 03:36:20,681 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 7790 mSDsluCounter, 15776 mSDsCounter, 0 mSdLazyCounter, 5272 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7790 SdHoareTripleChecker+Valid, 16850 SdHoareTripleChecker+Invalid, 5449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 5272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:20,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7790 Valid, 16850 Invalid, 5449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 5272 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 03:36:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97814 states. [2024-10-11 03:36:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97814 to 39484. [2024-10-11 03:36:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39484 states, 39479 states have (on average 1.272068694749107) internal successors, (50220), 39483 states have internal predecessors, (50220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39484 states to 39484 states and 50220 transitions. [2024-10-11 03:36:21,679 INFO L78 Accepts]: Start accepts. Automaton has 39484 states and 50220 transitions. Word has length 170 [2024-10-11 03:36:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:21,680 INFO L471 AbstractCegarLoop]: Abstraction has 39484 states and 50220 transitions. [2024-10-11 03:36:21,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 39484 states and 50220 transitions. [2024-10-11 03:36:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:36:21,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:21,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:21,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:36:21,717 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:21,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1353563766, now seen corresponding path program 1 times [2024-10-11 03:36:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:21,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122096515] [2024-10-11 03:36:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:21,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:22,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:22,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122096515] [2024-10-11 03:36:22,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122096515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:36:22,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446805461] [2024-10-11 03:36:22,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:22,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:36:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:36:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:36:22,070 INFO L87 Difference]: Start difference. First operand 39484 states and 50220 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:22,322 INFO L93 Difference]: Finished difference Result 61746 states and 79763 transitions. [2024-10-11 03:36:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:36:22,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:36:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:22,354 INFO L225 Difference]: With dead ends: 61746 [2024-10-11 03:36:22,354 INFO L226 Difference]: Without dead ends: 28024 [2024-10-11 03:36:22,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:36:22,381 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1504 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:22,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 632 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:36:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28024 states. [2024-10-11 03:36:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28024 to 23614. [2024-10-11 03:36:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23614 states, 23609 states have (on average 1.2498199839044433) internal successors, (29507), 23613 states have internal predecessors, (29507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23614 states to 23614 states and 29507 transitions. [2024-10-11 03:36:22,757 INFO L78 Accepts]: Start accepts. Automaton has 23614 states and 29507 transitions. Word has length 170 [2024-10-11 03:36:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:22,757 INFO L471 AbstractCegarLoop]: Abstraction has 23614 states and 29507 transitions. [2024-10-11 03:36:22,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 23614 states and 29507 transitions. [2024-10-11 03:36:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:36:22,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:22,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:22,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:36:22,780 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:22,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1343352952, now seen corresponding path program 1 times [2024-10-11 03:36:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048388423] [2024-10-11 03:36:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048388423] [2024-10-11 03:36:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048388423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:23,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 03:36:23,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382549065] [2024-10-11 03:36:23,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:23,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:36:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:36:23,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:36:23,606 INFO L87 Difference]: Start difference. First operand 23614 states and 29507 transitions. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:24,606 INFO L93 Difference]: Finished difference Result 38836 states and 49541 transitions. [2024-10-11 03:36:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:36:24,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:36:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:24,653 INFO L225 Difference]: With dead ends: 38836 [2024-10-11 03:36:24,653 INFO L226 Difference]: Without dead ends: 35383 [2024-10-11 03:36:24,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:36:24,672 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 2475 mSDsluCounter, 5810 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2475 SdHoareTripleChecker+Valid, 6553 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:24,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2475 Valid, 6553 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:36:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35383 states. [2024-10-11 03:36:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35383 to 28075. [2024-10-11 03:36:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28075 states, 28070 states have (on average 1.2375489846811543) internal successors, (34738), 28074 states have internal predecessors, (34738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28075 states to 28075 states and 34738 transitions. [2024-10-11 03:36:25,167 INFO L78 Accepts]: Start accepts. Automaton has 28075 states and 34738 transitions. Word has length 170 [2024-10-11 03:36:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 28075 states and 34738 transitions. [2024-10-11 03:36:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 28075 states and 34738 transitions. [2024-10-11 03:36:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:36:25,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:25,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:25,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:36:25,194 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:25,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 993856680, now seen corresponding path program 1 times [2024-10-11 03:36:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:25,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38648501] [2024-10-11 03:36:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:25,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38648501] [2024-10-11 03:36:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38648501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:26,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:36:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235098345] [2024-10-11 03:36:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:36:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:36:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:36:26,945 INFO L87 Difference]: Start difference. First operand 28075 states and 34738 transitions. Second operand has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:36:33,209 INFO L93 Difference]: Finished difference Result 67042 states and 90295 transitions. [2024-10-11 03:36:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-11 03:36:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-10-11 03:36:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:36:33,299 INFO L225 Difference]: With dead ends: 67042 [2024-10-11 03:36:33,299 INFO L226 Difference]: Without dead ends: 64639 [2024-10-11 03:36:33,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=717, Invalid=3189, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 03:36:33,324 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 5184 mSDsluCounter, 18317 mSDsCounter, 0 mSdLazyCounter, 6038 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5184 SdHoareTripleChecker+Valid, 19601 SdHoareTripleChecker+Invalid, 6175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 6038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:36:33,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5184 Valid, 19601 Invalid, 6175 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [137 Valid, 6038 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 03:36:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64639 states. [2024-10-11 03:36:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64639 to 30679. [2024-10-11 03:36:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30679 states, 30674 states have (on average 1.2318902001695247) internal successors, (37787), 30678 states have internal predecessors, (37787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30679 states to 30679 states and 37787 transitions. [2024-10-11 03:36:34,137 INFO L78 Accepts]: Start accepts. Automaton has 30679 states and 37787 transitions. Word has length 170 [2024-10-11 03:36:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:36:34,137 INFO L471 AbstractCegarLoop]: Abstraction has 30679 states and 37787 transitions. [2024-10-11 03:36:34,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:36:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 30679 states and 37787 transitions. [2024-10-11 03:36:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:36:34,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:36:34,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:36:34,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:36:34,169 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 03:36:34,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:36:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1542246930, now seen corresponding path program 1 times [2024-10-11 03:36:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:36:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979257772] [2024-10-11 03:36:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:36:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:36:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:36:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:36:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:36:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979257772] [2024-10-11 03:36:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979257772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:36:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:36:34,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 03:36:34,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10981714] [2024-10-11 03:36:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:36:34,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:36:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:36:34,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:36:34,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:36:34,935 INFO L87 Difference]: Start difference. First operand 30679 states and 37787 transitions. Second operand has 16 states, 16 states have (on average 10.625) internal successors, (170), 15 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)